Articulated Robot Motion Planning Using Ant Colony Optimisation

A new approach to robot motion planning is proposed by applying ant colony optimization (ACO) with the probabilistic roadmap planner (PRM). The aim of this approach is to apply ACO to 3-dimensional robot motion planning which is complicated when involving mobile 6-dof or multiple articulated robots. An ant colony robot motion planning (ACRMP) method is proposed that has the benefit of collective behaviour of ants foraging from a nest to a food source. A number of artificial ants are released from the nest (start configuration) and begin to forage (search) towards the food (goal configuration). During the foraging process, a 1-TREE (uni-directional) searching strategy is applied in order to establish any possible connection from the nest to goal. Results from preliminary tests show that the ACRMP is capable of reducing the intermediate configuration between the Initial and goal configuration in an acceptable running time

[1]  G. Swaminathan.  Robot Motion Planning , 2006 .

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  D. Touretzky.  Path Planning , 2003 .

[4]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[5]  Lydia E. Kavraki,et al.  Random networks in configuration space for fast path planning , 1994 .

[6]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[7]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[8]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[9]  Jean-Claude Latombe,et al.  Using a PRM planner to compare centralized and decoupled planning for multi-robot systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[10]  Mitul Saha,et al.  Planning multi-goal tours for robot arms , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[11]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration space for path planning: articulated robots , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[12]  Xiong Luo,et al.  Optimal path planning for mobile robots based on intensified ant colony optimization algorithm , 2003, IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003.

[13]  Tiejun Li,et al.  The Ant Algorithm for Solving Robot Path Planning Problem , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[14]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[15]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[16]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[17]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[18]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .