Path planning using multi-resolution map for a mobile robot

Path planning is one of important topics in robotics. When the mobile robot is building the map, it is better to use the higher resolution map in order to build a precise map. However, after the map building, if the resolution of the built map is very high, it takes much computational memory and time to perform the path planning. To realize the effective path planning, we use a multi-resolution map. The multi-resolution map can be updated by the operators suitable to a specific aim. The first aim is to represent the occupied or empty cells in the built map. The next aim is to represent the unknown areas in the built map. These are used for the path planning. The path planning is based on potential field method. The path planning uses steady-state genetic algorithm in order to set up the sub-target points. The experimental results show the effectiveness of the proposed method.

[1]  Charles E. Thorpe,et al.  Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.

[2]  Yoram Koren,et al.  Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[3]  Gregory Dudek,et al.  Online control policy optimization for minimizing map uncertainty during exploration , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[4]  Robert B. Tilove,et al.  Local obstacle avoidance for mobile robots based on the method of artificial potentials , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[5]  Naoyuki Kubota,et al.  Steady-State Genetic Algorithms for Growing Topological Mapping and Localization , 2010, PRICAI.

[6]  Henrik I. Christensen,et al.  Closing the Loop With Graphical SLAM , 2007, IEEE Transactions on Robotics.

[7]  Naoyuki Kubota,et al.  Collision avoidance planning of a robot manipulator by using genetic algorithm. A consideration for the problem in which moving obstacles and/or several robots are included in the workspace , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[8]  Tim D. Barfoot,et al.  Path planning with variable-fidelity terrain assessment , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Wan Kyun Chung,et al.  Effective Maximum Likelihood Grid Map With Conflict Evaluation Filter Using Sonar Sensors , 2009, IEEE Transactions on Robotics.

[10]  Frank Dellaert,et al.  iSAM: Incremental Smoothing and Mapping , 2008, IEEE Transactions on Robotics.

[11]  Héctor H. González-Baños,et al.  Navigation Strategies for Exploring Indoor Environments , 2002, Int. J. Robotics Res..

[12]  GianAntonio Magnani,et al.  Passivity-based model predictive control for mobile robot navigation planning in rough terrains , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Naoyuki Kubota,et al.  Intelligent Control of multi-agent system based on multi-objective behavior coordination , 2008, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence).

[14]  Eduardo Mario Nebot,et al.  Consistency of the EKF-SLAM Algorithm , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Wan Kyun Chung,et al.  Unscented FastSLAM: A Robust and Efficient Solution to the SLAM Problem , 2008, IEEE Transactions on Robotics.

[16]  Masafumi Hagiwara,et al.  A simple path planning system using fuzzy rules and a potential field , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.