Mobile robot path planning for circular shaped obstacles using simulated annealing

Many heuristic methods are used for path planning by researchers in the past and contemporary work but due to easy implementation, convergence properties, capability of escaping local optima and the use of hill-climbing moves have made simulated annealing (SA) a good choice for path planning. In this research the simulated annealing algorithm is used to obtain a collision-free optimal path among fixed circular shaped obstacles for a mobile robot. A feasible path is computed by series of points in cells generated between start to goal point. The effectiveness of the proposed algorithm in different environments is shown through simulation results.

[1]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[2]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[3]  Singiresu S. Rao.  Engineering Optimization : Theory and Practice , 2010 .

[4]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[5]  Charles W. Warren,et al.  Fast path planning using modified A* method , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[6]  Jeffrey S. Russell,et al.  VISIBILITY GRAPH APPROACH TO DETAILED PATH PLANNING IN CNC CONCRETE PLACEMENT , 1994 .

[7]  Yu-Chu Tian,et al.  Robot path planning in dynamic environments using a simulated annealing based approach , 2008, 2008 10th International Conference on Control, Automation, Robotics and Vision.

[8]  Zbigniew Michalewicz,et al.  Adaptive evolutionary planner/navigator for mobile robots , 1997, IEEE Trans. Evol. Comput..

[9]  Thiago de C. Martins,et al.  Robot path planning using simulated annealing , 2006 .

[10]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[11]  Buniyamin,et al.  A Simple Local Path Planning Algorithm for Autonomous Mobile Robots , 2010 .