Multi-objective path planning in discrete space

Finding a path for a robot which is near to natural looking paths is a challenging problem in motion planning. This paper suggests two single and multi-objective optimization models focusing on length and clearance of the path in discrete space. Considering the complexity of the models and potency of evolutionary algorithms we apply a genetic algorithm with NSGA-II framework for solving the problems addressed in the models. The proposed algorithm uses an innovative family of path refiner operators, in addition to the standard genetic operators. The new operators intensify explorative power of the algorithm in finding Pareto-optimal fronts in the complicated path planning problems such as narrow passages and clutter spaces. Finally, we compare efficiency of the refiner operators and the algorithm with PSO and A* algorithms in several path planning problems.

[1]  Howie Choset,et al.  Path Planning between Two Points for a Robot Experiencing Localization Error in Known and Unknown Environments , 1999 .

[2]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[3]  Du Xin,et al.  Neural network and genetic algorithm based global path planning in a static environment , 2005 .

[4]  Norlida Buniyamin,et al.  Robot global path planning overview and a variation of ant colony system algorithm , 2011 .

[5]  Oscar Castillo,et al.  Multiple Objective Genetic Algorithms for Path-planning Optimization in Autonomous Mobile Robots , 2006, Soft Comput..

[6]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  Wei Li,et al.  Application of improved PSO in mobile robotic path planning , 2010, 2010 International Conference on Intelligent Computing and Integrated Systems.

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

[10]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[11]  Jing-Sin Liu,et al.  A comparative study of smooth path planning for a mobile robot by evolutionary multi-objective optimization , 2007, 2007 International Symposium on Computational Intelligence in Robotics and Automation.

[12]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[13]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

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

[15]  Mark H. Overmars,et al.  AUTOMATIC CONSTRUCTION OF ROADMAPS FOR PATH PLANNING IN GAMES , 2004 .

[16]  Mirjana Bonković,et al.  Mobile robot path planning using exact cell decomposition and potential field methods , 2009 .

[17]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[18]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[19]  Mehdi Ghatee,et al.  Motion planning in order to optimize the length and clearance applying a Hopfield neural network , 2009, Expert Syst. Appl..

[20]  Sidhartha Panda,et al.  MULTI-OBJECTIVE NON-DOMINATED SHORTING GENETIC ALGORITHM-II FOR EXCITATION AND TCSC-BASED CONTROLLER DESIGN , 2009 .

[21]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[22]  S. Areibi,et al.  Genetic algorithm for dynamic path planning , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

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

[24]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[25]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[26]  Nancy M. Amato,et al.  Probabilistic roadmaps-putting it all together , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[27]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

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

[29]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[30]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[31]  Abraham Sánchez López,et al.  Sampling-Based Motion Planning: A Survey , 2008, Computación y Sistemas.

[32]  Heng-Ming Tai,et al.  Autonomous local path planning for a mobile robot using a genetic algorithm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).