Planning multiple paths with evolutionary speciation

This paper demonstrates a new approach to multidimensional path planning that is based on multiresolution path representation, where explicit configuration space computation is not required, and incorporates an evolutionary algorithm for solving the multimodal optimization problem, generating multiple alternative paths simultaneously. The multiresolution path representation reduces the expected search length for the path-planning problem and accordingly reduces the overall computational complexity. Resolution independent constraints due to obstacle proximity and path length are introduced into the evaluation function. The system can be applied for planning paths for mobile robots, assembly, and articulated manipulators. The resulting path-planning system has been evaluated on problems of two, three, four, and six degrees of freedom. The resulting paths are practical, consistent, and have acceptable execution times. The multipath algorithm is demonstrated on a number of 2D path-planning problems.

[1]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

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

[3]  Arthur C. Sanderson,et al.  Multi-dimensional path planning using evolutionary computation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[5]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7]  A. Sanderson,et al.  Model inference and pattern discovery by minimal representation method , 1981 .

[8]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

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

[10]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[11]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

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

[13]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[14]  Michael E. Wall,et al.  Galib: a c++ library of genetic algorithm components , 1996 .

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

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

[17]  Rüdiger Dillmann,et al.  Learning Robot Behaviour and Skills Based on Human Demonstration and Advice: The Machine Learning Paradigm , 2000 .

[18]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

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

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

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

[22]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[23]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[24]  Yong K. Hwang,et al.  SANDROS: a dynamic graph search algorithm for motion planning , 1998, IEEE Trans. Robotics Autom..

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

[26]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

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

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

[29]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[31]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[32]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[33]  Jérôme Barraquand,et al.  Path planning through variational dynamic programming , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[34]  John Canny,et al.  The complexity of robot motion planning , 1988 .

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

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

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

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

[39]  Micha Sharir,et al.  A Survey of Motion Planning and Related Geometric Algorithms , 1988, Artificial Intelligence.

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

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

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

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

[44]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[45]  Arthur C. Sanderson,et al.  Attributed image matching using a minimum representation size criterion , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[46]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

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

[48]  Ronald C. Arkin,et al.  Using Genetic Algorithms to Learn Reactive Control Parameters for Autonomous Robotic Navigation , 1994, Adapt. Behav..

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

[50]  John J. Grefenstette,et al.  Lamarckian Learning in Multi-Agent Environments , 1991, ICGA.

[51]  Andrew B. Kahng,et al.  Optimal robust path planning in general environments , 1993, IEEE Trans. Robotics Autom..

[52]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[53]  G. Rudolph.  On a multi-objective evolutionary algorithm and its convergence to the Pareto set , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[54]  Phillip J. McKerrow,et al.  Introduction to robotics , 1991 .

[55]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[56]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[57]  Andrei N. Kolmogorov,et al.  Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.

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