Home /Research /Vortex Swarm Path Planning Algorithm
SWARM

Vortex Swarm Path Planning Algorithm

Helbert Espitia, E. Jorge Iv ́n Sofrony, P. Cesar Leonardo Gonz ́lez

Year
2011
Citations
3

Abstract

This paper presents an algorithm for trajectory planing using potential fields and swarms with vortex behavior. This algorithm is called Vortex Swarm Path Planning Algorithm (VSPP). There are several methods for trajectory planning in robotics, the most popular is the one based on artificial potential fields. However this method has the disadvantage of local minima which can make the robot fail when reaching the destination point. The proposed algorithm here presented employs a model of active Brownian particles with vortex behavior that allows the trajectory planning evading local minima.

Keywords

Maxima and minimaVortexSwarm behaviourMotion planningTrajectoryAlgorithmSwarm roboticsPath (computing)Computer scienceRobot

Related papers

Browse all SWARM papers