Evolutionary path planning using multiresolution path representation

A multiresolution representation of robot paths is introduced as a basis for path planning where explicit configuration-space computation is not feasible. This multiresolution representation is computationally efficient since the path representation depends on the complexity of the problem space-therefore, a simple path will be found quickly if one exists. An evolutionary algorithm uses a variable-length string to encode the path, and this length is systematically varied as the evolutionary search proceeds. Resolution independent constraints due to obstacle proximity, and path length are introduced into the evolutionary evaluation function. The resulting algorithm has been evaluated on problems of 2, 3, 4, and 6 degrees of freedom, including mobile articulated robots and six degree-of-freedom assembly trajectory problems. The resulting paths are practical and consistent with acceptable execution times.

[1]  Heinrich Braun,et al.  On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.

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

[3]  Gilles Venturini,et al.  Learning the behavior of a simulated moving robot using genetic algorithms , 1991 .

[4]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[5]  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.

[6]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[7]  John R. Koza,et al.  A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance , 1998, Inf. Sci..

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

[9]  Arthur C. Sanderson,et al.  Planning multi-paths using speciation in genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[11]  Takanori Shibata,et al.  Intelligent motion planning by genetic algorithm with fuzzy critic , 1993, Proceedings of 8th IEEE International Symposium on Intelligent Control.

[12]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[13]  Arthur C. Sanderson,et al.  Multimodal Function Optimization Using Minimal Representation Size Clustering and Its Application to Planning Multipaths , 1997, Evolutionary Computation.

[14]  Joseph Duffy,et al.  Two dimensional collision-free path planning using linear parametric curve , 1997, J. Field Robotics.

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

[16]  J. Duffy,et al.  Two dimensional collision-free path planning using linear parametric curve , 1997 .

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

[18]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[19]  Robert G. Reynolds,et al.  Evolutionary Speciation Using Minimal Representation Size Clustering , 1995 .

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

[21]  Arthur C. Sanderson,et al.  Evolutionary Speciation Using Minimal Representation Size Clustering , 1995, Evolutionary Programming.