Path Planning Using Neighborhood Based Crowding Differential Evolution

Path planning problems are known as one of the most important techniques used in robot navigation. The task of path planning is to find several short and collision-free paths. Various optimization algorithms have used to handle path planning problems. Neighborhood based crowding differential evolution (NCDE) is an effective multi-modal optimization algorithm. It is able to locate multiple optima in a single run. In this paper, Bezier curve concept and NCDE are used to solve path planning problems. It is compared with several other methods and the results show that NCDE is able to generate satisfactory solutions. It can provide several alternative optimal paths in one single run for all the tested problems.

[1]  Cungen Cao,et al.  Particle Swarm Algorithm for the Shortest Bezier Curve , 2009, 2009 International Workshop on Intelligent Systems and Applications.

[2]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[3]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[4]  De-Shuang Huang,et al.  Intelligent Computing Theories and Application , 2016, Lecture Notes in Computer Science.

[5]  Libor Preucil,et al.  Robot Path Planning using Particle Swarm Optimization of Ferguson Splines , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[6]  Jing J. Liang,et al.  Differential Evolution With Neighborhood Mutation for Multimodal Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[7]  Amit Konar,et al.  Distributed cooperative multi-robot path planning using differential evolution , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[8]  Amit Konar,et al.  Cooperative multi-robot path planning using differential evolution , 2009, J. Intell. Fuzzy Syst..

[9]  Ying Zhang,et al.  A rough set GA-based hybrid method for robot path planning , 2006, Int. J. Autom. Comput..

[10]  John Smith,et al.  Genetic algorithms for adaptive motion planning of an autonomous mobile robot , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[11]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[12]  Luo Zhongwen,et al.  Path planning algorithm for mobile robot obstacle avoidance adopting Bezier curve based on Genetic Algorithm , 2008, 2008 Chinese Control and Decision Conference.

[13]  Z.A. Bashir,et al.  Short-Term Load Forecasting Using Artificial Neural Network Based on Particle Swarm Optimization Algorithm , 2007, 2007 Canadian Conference on Electrical and Computer Engineering.

[14]  Hongwei Mo,et al.  Bio-geography based differential evolution for robot path planning , 2012, 2012 IEEE International Conference on Information and Automation.

[15]  Jing-Sin Liu,et al.  Collision-free curvature-bounded smooth path planning using composite Bezier curve based on Voronoi diagram , 2009, 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation - (CIRA).

[16]  Jing J. Liang,et al.  Path Planning Based on Dynamic Multi-Swarm Particle Swarm Optimizer with Crossover , 2012, ICIC.