Metaheuristic global path planning algorithm for mobile robots

A new metaheuristic method applied to the global path planning for mobile robots in dynamic environments is presented. This algorithm, named the quad harmony search method, consists of dividing the robot's environment into free regions by applying the quad-tree algorithm and utilising this information to accelerate the next phase which implements the harmony search optimisation method to provide the optimal route. The presented results have displayed that this method gives best results when compared to other metaheuristic techniques and is therefore applicable to the global path planning problem.

[1]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[2]  Hamid Haj Seyyed Javadi,et al.  Using Particle Swarm Optimization for Robot Path Planning in Dynamic Environments with Moving Obstacles and Target , 2009, 2009 Third UKSim European Symposium on Computer Modeling and Simulation.

[3]  Jianhua Zhang,et al.  Robot path planning in uncertain environment using multi-objective particle swarm optimization , 2013, Neurocomputing.

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[6]  Yu-Chu Tian,et al.  Dynamic robot path planning using an enhanced simulated annealing approach , 2013, Appl. Math. Comput..

[7]  P. Raja,et al.  Path Planning for Mobile Robots in Dynamic Environments Using Particle Swarm Optimization , 2009, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

[8]  Wolfram Burgard,et al.  Efficient grid-based spatial representations for robot navigation in dynamic environments , 2013, Robotics Auton. Syst..

[9]  Yujie Cui,et al.  Dynamic path planning for mobile robot based on genetic algorithm in unknown environment , 2010, 2010 Chinese Control and Decision Conference.

[10]  Xiaodi Huang,et al.  Dynamic vehicle path planning using an enhanced simulated annealing approach for supply chains , 2012 .

[11]  Barbara M. Chapman,et al.  Towards optimisation of openMP codes for synchronisation and data reuse , 2004, Int. J. High Perform. Comput. Netw..

[12]  Anupam Shukla,et al.  DYNAMIC ENVIRONMENT ROBOT PATH PLANNING USING HIERARCHICAL EVOLUTIONARY ALGORITHMS , 2010, Cybern. Syst..

[13]  Christian Roux,et al.  Registration of Non-Segmented Images Using a Genetic Algorithm , 1995, CVRMed.

[14]  Oscar Castillo,et al.  Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation , 2009, Appl. Soft Comput..

[15]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[16]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[17]  Jiang Wu,et al.  Max-Min Adaptive Ant Colony Optimization Approach to Multi-UAVs Coordinated Trajectory Replanning in Dynamic and Uncertain Environments , 2009 .

[18]  Jing-Sin Liu,et al.  Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints , 2010, SAC '10.