Efficient and safe path planning for a Mobile Robot using genetic algorithm

In this paper, a new method for path planning is proposed using a genetic algorithm (GA). Our method has two key advantages over existing GA methods. The first is a novel environment representation which allows a more efficient method for obstacles dilation in comparison to current cell based approaches that have a tradeoff between speed and accuracy. The second is the strategy we use to generate the initial population in order to speed up the convergence rate which is completely novel. Simulation results show that our method can find a near optimal path faster than computational geometry approaches and with more accuracy in smaller number of generations than GA methods.

[1]  Daniel Thalmann,et al.  Space Discretization for Efficient Human Navigation , 1998, Comput. Graph. Forum.

[2]  Caro Lucas,et al.  Path Planning in an Environment with Static and Dynamic Obstacles Using Genetic Algorithm: A Simplified Search Space Approach , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[3]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[4]  Houjun Wang,et al.  Improved Genetic Algorithms Based Path planning of Mobile Robot Under Dynamic Unknown Environment , 2006, 2006 International Conference on Mechatronics and Automation.

[5]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[6]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

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

[8]  Adi Botea,et al.  Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..

[9]  Simon X. Yang,et al.  A knowledge based genetic algorithm for path planning of a mobile robot , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[10]  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).

[11]  Lydia E. Kavraki,et al.  A two level fuzzy PRM for manipulation planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[12]  Jur P. van den Berg,et al.  The visibility-Voronoi complex and its applications , 2007, Comput. Geom..

[13]  Yang Wang,et al.  Mobile Robot Path Planning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[14]  T.P. Fries.  Evolutionary Robot Navigation Using Fuzzy Terrain Conditions , 2006, NAFIPS 2006 - 2006 Annual Meeting of the North American Fuzzy Information Processing Society.

[15]  Mahmood Naderan-Tahan,et al.  A real-time Clearance-Based approach for motion planning of mobile robots , 2008, 2008 7th IEEE International Conference on Cognitive Informatics.

[16]  Jin Lu,et al.  Path Planning Based on Double-Layer Genetic Algorithm , 2007, Third International Conference on Natural Computation (ICNC 2007).

[17]  Mark H. Overmars,et al.  Clearance based path optimization for motion planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[18]  Tao Yu,et al.  Step-spreading map knowledge based multi-objective genetic algorithm for robot-path planning , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.