Roadmap Coverage Improvement using a Node Rearrangement Method for Mobile Robot Path Planning
SCIE
SCOPUS
- Title
- Roadmap Coverage Improvement using a Node Rearrangement Method for Mobile Robot Path Planning
- Authors
- Byungjae Park; Jinwoo Choi; Chung, WK
- Date Issued
- 2012-07
- Publisher
- Taylor and Francis
- Abstract
- This paper proposes a method to efficiently abstract the traversable regions of a bounded two-dimensional environment using the probabilistic roadmap (PRM) to plan the path for a mobile robot. The proposed method uses centroidal Voronoi tessellation to autonomously rearrange the positions of initially randomly generated nodes. The PRM using the rearranged nodes covers most of the traversable regions in the environment and regularly divides them. The rearranged roadmap reduces the search space of a graph search algorithm and helps to promptly answer arbitrary queries in the environment. The mobile robot path planner using the proposed rearranged roadmap was integrated with a local planner that considers the kinematic properties of a mobile robot, and the efficiency and the safety of the paths were verified by simulation. (C) Koninklijke Brill NV, Leiden and The Robotics Society of Japan, 2012
- Keywords
- Navigation; path planning; probabilistic roadmap; centroidal Voronoi tessellation; mobile robot; PROBABILISTIC ROADMAPS; ENVIRONMENTS; NAVIGATION; ALGORITHM
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15682
- DOI
- 10.1163/156855312X633075
- ISSN
- 0169-1864
- Article Type
- Article
- Citation
- Advanced Robotics, vol. 26, no. 8-9, page. 989 - 1012, 2012-07
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.