| Abstract: | Path planning using conventional roadmaps, such as visibility graphs, probability roadmaps and skeleton maps, may have some disadvantages of long length, sharp turns or collisions with obstacles. Specifically, the paths using the conventional skeleton map have unnecessary turns around crossing points, which make longer paths and prevent the robot from moving smoothly. To improve the skeleton map, this paper proposes a new roadmap construction algorithm for path planning of a mobile robot using skeleton maps. The proposed algorithm alleviates the problems of the conventional algorithms by constructing roadmaps which consist of polygons around the crossing points. Simulation results show the efficiency of the proposed algorithm by comparing the results with those obtained using the conventional algorithm. |
