Visibility analysis and genetic algorithms for fast robot motion planning

Although extensive work about robot path planning has been carried out, there is still a need for fast, practical and general-purpose motion planners. New applications of robots, outside the known and fixed environment of a factory, will increase the need for such planners. In these situations it will be necessary to cope with very variable and complex environments and with direct human interaction. A new approach for n-degree-of-freedom robot motion planning, based on the concept of visibility tetrahedra and the use of genetic algorithms combined with local search methods, is presented in this paper. The proposed approach has been successfully tested over several selected experiments, obtaining fast planning even for complex situations.

[1]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[2]  Yuval Davidor,et al.  Genetic algorithms and robotics , 1991 .

[3]  Arthur C. Sanderson,et al.  Evolutionary path planning using multiresolution path representation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[4]  A. Zalzala,et al.  A genetic approach to motion planning of redundant mobile manipulator systems considering safety and configuration , 1997, J. Field Robotics.

[5]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  Ali M. S. Zalzala,et al.  A genetic approach to motion planning of redundant mobile manipulator systems considering safety and configuration , 1997, J. Field Robotics.

[7]  Mark H. Overmars,et al.  Motion Planning for Carlike Robots Using a Probabilistic Learning Approach , 1997, Int. J. Robotics Res..

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

[9]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

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

[12]  Jean-Claude Latombe,et al.  A reactive architecture for planning and executing robot motions with incomplete knowledge , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[13]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[14]  M. Hernando,et al.  New concept of visibility tetrahedra for fast robot motion planning , 2001, 2001 IEEE/ASME International Conference on Advanced Intelligent Mechatronics. Proceedings (Cat. No.01TH8556).