Path planning based quadtree representation for mobile robot using hybrid-simulated annealing and ant colony optimization algorithm

In this paper, a new path planning approach combining framed-quadtree representation with hybrid-simulated annealing (SA) and ant colony optimization (ACO) algorithm called SAACO is presented to improve the efficiency of path planning. The utilization of framed-quadtree representation is for improving the decomposed efficiency of the environment and maintaining the representation capability of maps. Simulated annealing and ant colony optimization were applied for robot path planning problem respectively and there have been plenty of accomplishments in recent year. Lots forms of SA depend on random starting points and how to efficiently offer better initial estimates of solution sets automatically is still a research hot point. We use ACO to supply a good initial solution for SA runs. According to the theoretical analysis and results obtained from simulation experiment, the presented SAACO algorithm can solve successfully the mobile robot path planning problem, which leads robot to seek the specific destination in the free-collision path and increases the speed of the robot navigation. Some excellent properties of this method have also been proved that is robustness, self-adaptation.

[1]  Tae-Bum Kwon,et al.  Thinning-based Topological Exploration using Position Probability of Topological Nodes , 2006, ICRA.

[2]  Jingan Yang,et al.  An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem , 2010, Appl. Soft Comput..

[3]  Quan Dang,et al.  Path planning approach in unknown environment , 2010, Int. J. Autom. Comput..

[4]  Danny Ziyi Chen,et al.  Planning Shortest Paths among 2D and 3D Weighted Regions Using Framed-Subspaces , 1998, Int. J. Robotics Res..

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Maki K. Habib,et al.  Development and implementation of navigation system for an autonomous mobile robot working in a building environment with its real time application , 1989, 15th Annual Conference of IEEE Industrial Electronics Society.

[7]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[8]  Renato Seiji Tavares,et al.  Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning , 2011, Expert Syst. Appl..

[9]  Alexander Zelinsky,et al.  A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..

[10]  Jozef Vörös.  Simple Path-Planning Algorithm for Mobile Robots using Quadtrees , 1995 .

[11]  Wan Kyun Chung,et al.  Navigable voronoi diagram : a local path planner for mobile robots using sonar sensors , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Larry S. Davis,et al.  Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..

[13]  Danny Ziyi Chen,et al.  A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment , 1997, IEEE Trans. Robotics Autom..

[14]  Tae Houn Song,et al.  The local minimum escape using the grid map , 2008, 2008 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems.

[15]  Shigang Cui,et al.  Mobile Robot Map Building Based on Grid Arrangement , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[16]  Horacio Martinez-Alfaro,et al.  Mobile robot path planning and tracking using simulated annealing and fuzzy logic control , 1998 .

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

[18]  Cyrill Stachniss,et al.  Bridging the gap between feature- and grid-based SLAM , 2010, Robotics Auton. Syst..

[19]  Eleonora Riva Sanseverino,et al.  Adaptive and Dynamic Ant Colony Search Algorithm for Optimal Distribution Systems Reinforcement Strategy , 2006, Applied Intelligence.

[20]  D. Jung,et al.  Octree-based hierarchical distance maps for collision detection , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[21]  Hiroshi Noborio,et al.  A quadtree-based path-planning algorithm for a mobile robot , 1990, J. Field Robotics.

[22]  Zafer Bingul,et al.  Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining , 2009, Eng. Appl. Artif. Intell..

[23]  Jing-Yu Yang,et al.  Online topological map building and qualitative localization in large-scale environment , 2010, Robotics Auton. Syst..

[24]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[25]  Kang Tai,et al.  Probability Collectives: A multi-agent approach for solving combinatorial optimization problems , 2010, Appl. Soft Comput..

[26]  Tae-Bum Kwon,et al.  Thinning-based topological exploration using position probability of topological nodes , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..