MULTI ROBOT PATH PLANNING ALGORITHMS: A SURVEY

Authors

  • S Vaniya Department Information Technology, Gujarat Technological University A.D.Patel Institute of Technology, New Vallabh Vidyanagar, Anand, Gujarat, India Author
  • B Solanki Department Information Technology, Gujarat Technological University A.D.Patel Institute of Technology, New Vallabh Vidyanagar, Anand, Gujarat, India Author
  • S Gupte 1 Department Information Technology, Gujarat Technological University A.D.Patel Institute of Technology, New Vallabh Vidyanagar, Anand, Gujarat, India Author

Keywords:

Bacteria forging Optimization (BFO), Ant Colony Optimization (ACO), Particle Swam Optimization (PSO), Ant Colony System (ACS), Robot path planning (RPP), Genetic algorithms (GA)

Abstract

To find the optimal path by interacting with multiple robots is the main research area in field of robotics. The task is to find the global optimal path with a minimum amount of computation time. Path planning has numerous application like industrial robotics, to design autonomous system etc. In this paper, we survey on three most recent algorithms namely Bacteria forging Optimization (BFO), Ant Colony Optimization (ACO), Particle Swam Optimization (PSO) that can apply on multiple robots to find the optimal path. The main feature of BFO is the chemotactic movement of a virtual bacterium that is helpful to investigate the all the possible path and finally arrived at optimal solution. In Ant Colony System (ACS) algorithm is integration of heuristic and visibility equation of state transition rules for finding the optimal path. PSO is stochastic optimization technique inspired by social behaviour of bird flocking. The solutions, called particles, fly through the problem space by some set of the rules.

References

O. Khatib, Real time obstacle avoidance for manipulators and mobile robots, International Journal of Robotics Research, Vol. 5(10), 1985, pp. 90-98.

G. Nagib, Gharieb W, Path planning for a mobile robot using genetic Algorithm, IEEE proceeding of Robotics, 2004, pp. 185-189.

R. C. Eberhart and Y.H. Shi. Particle swarm optimization: Developments, applications and resources. In CEC 2001: proceedings of the IEEE congress on evolutionary computation, pages 81–86, Seoul, South Korea, May, 2001. IEEE.

M. Tasgetiren, Y. Liang, “A Binary particle Swarm Optimization Algorithm for Lot Sizing Problem”, Journal of Economic and Social Research 5(2), 1-20.

W. Jatmiko, K. Sekiyama, T. Fukuda, “A PSO Based Mobile Sensor Network for Odor Source Localization in Dynamic Environment: Theory, Simulation and Measurement”, 2006 Congress on evolutionary Computation, Vancouver, BC, pp. 3781 -3788, July 2006.

L. Smith, G. Venayagamoorthy, P. Holloway, “Obstacle Avoidance in Collective Robotic Search Using Particle Swarm Optimization”

S. Doctor, G. Venayagamoorthy, V. Gudise,”OptimalPSO for Collective Robotic Search Applications”, IEEE Congress on Evolutionary Computation, Portland, OR, pp. 1390-1395, June 2004.

S. Doctor, G. Venayagamoorthy, “Unmanned Vehicle Navigation Using Swarm Intelligence”, Intelligent Sensing and Information Processing, ICISIP 2005.

R. Grabowski, L. Navaroo-Serment, P. Khosla, “An Army of Small Robots”, Scientific American Reports, Vol. 18 No.1, pp. 34-39, May 2008.

Wireless Meshed Network for Building Automation, Industrial Wireless Book Issue 10:2, http://wireless.industrial-networking.com/articles/articledisplay.asp?id=1264.

J. Pugh, A. Martinoli, “Inspiring And Modeling Multi-Robot Search with Particle Swarm Optimization.”

K. M. Passino. Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Systems Magazine, 22: 52–67, 2002.

S. Das, A. Biswas, S. Dasgupta, A. Abraham, “Bacterial Foraging Optimization Algorithm: Theoretical, Foundation, Analysis and Applications.”

N. B. Sariff, N. Buniyamin, “Ant Colony System for Robot path Planning in Global Static Environment.”

Published

2011-05-12

How to Cite

S Vaniya, B Solanki, & S Gupte. (2011). MULTI ROBOT PATH PLANNING ALGORITHMS: A SURVEY. International Journal of Computer Science and Engineering Research and Development (IJCSERD), 1(1), 38-49. https://ijcserd.in/index.php/home/article/view/5