Sampling-Based Retraction Method for Improving the Quality of Mobile Robot Path Planning

다국어 초록 (Multilingual Abstract)

This paper presents a method for improving the quality of the initial path produced by the probabilistic roadmap (PRM)-based mobile robot path planner. The sampling-based retraction method modifies the initial path to achieve approximate maximum safety by removing unsafe and redundant sections. The updated directions and distances of the waypoints on the initial path are determined by approximately modeling clearances around the initial paths using random samples. The proposed me-thod can control the update speed to induce smooth convergence. The performance of the proposed method was verified by simulation.

참고문헌 (Reference)

1 R. Wein, "The visibility-Voronoi complex and its applications" 36 (36): 66-87, 2007

2 P. Goel, "Robot localization using relative and absolute position estimates" 1134-1140, 1999

3 정완균, "Roadmap Coverage Improvement using a Node Rearrangement Method for Mobile Robot Path Planning" Taylor and Francis 26 (26): 989-1012, 201207

4 M. Branicky, "Quasi-Randomized path planning" 1481-1487, 2001

5 L. Kavraki, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces" 12 (12): 566-580, 1996

6 R. Geraerts, "Planning short paths with clearance using explicit corridors" 1997-2004, 2010

7 D. Hsu, "Placing a robot manipulator amid obstacles for optimized execution" 280-285, 1999

8 D. Dolgov, "Path planning for autonomous vehicles in unknown semistructured environments" 29 (29): 485-501, 2010

9 R. Geraerts, "On improving the clearance for robots in high-dimensional configuration spaces" 4074-4079, 2005

10 J. Minguez, "Nearness diagram (ND) navigation" 20 (20): 45-59, 2004

11 C. Geem, "Mobility analysis for feasibility studies in CAD models of industrial environments" 1770-1775, 1999

12 M. Saha, "Finding narrow passages with probabilistic roadmaps: the small step retraction method" 622-627, 2005

13 D. Ferguson, "Field d*: an interpolationbased path planner and replanner" 2005

14 J. Kim, "Extracting optimal paths from roadmaps for motion planning" 2424-2429, 2003

15 S. Quinlan, "Elastic bands: connecting path planning and control" 802-807, 1993

16 M. Khatib, "Dynamic path modification for car-like nonholonomic mobile robots" 3920-2925, 1997

17 R. Geraens, "Creating high-quality roadmaps for motion planning in virtual environments" 4355-4361, 2006

18 R. Geraerts, "Creating high-quality paths for motion planning" 26 (26): 845-863, 2007

19 P. Isto, "Constructing probabilistic roadmaps with powerful local planning and path optimization" 2323-2328, 2002

20 R. Geraerts, "Clearance based path optimization for motion planning" 2386-2392, 2004

21 J. van den Berg, "Anytime path planning and replanning in dynamic environments" 2366-2371, 2006

22 양광진, "Anytime Synchronized-Biased-Greedy Rapidly-exploring Random Tree Path Planning in Two Dimensional Complex Environments" 제어·로봇·시스템학회 9 (9): 750-758, 2011

23 양광진, "An Analytical Continuous-Curvature Path-Smoothing Algorithm" IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC 26 (26): 561-568, 201006

24 B. Park, "Adaptive node sampling method for probabilistic roadmap planners" 4399-4405, 2009

25 M. Dissanayake, "A solution to the simultaneous localization and map building (SLAM) problem" 17 (17): 229-241, 2001

26 B. Raveh, "A little more, a lot better: improving path quality by a path-merging algorithm" 27 (27): 365-371, 2011

27 J.-M. Lien, "A general framework for sampling on the medial axis of the free space" 4439-4444, 2003