Informed RRT* with improved converging rate by adopting wrapping procedure
- 415 Downloads
Wrapping-based informed RRT*, proposed in this paper, combines a size-diminishing procedure, i.e., ‘wrapping procedure’ with informed RRT*, which samples random path nodes within a hyperellipsoid. The major and minor axes of the hyperellipsoid are determined by the initial and final configurations and current best solution’s path cost. Wrapping-based informed RRT* can advance from the first solution acquired by the planner to an improved, feasible solution which can drastically reduce the size of the hyperellipsoid. This leads to much quicker convergence to the optimal value of the path cost, resulting in the minimum action of the robot joints. The algorithm was tested in various environments with different numbers of joint variables and showed much better performance than the existing planners. Furthermore, the wrapping procedure proved to be a comparably insignificant computational burden regardless of the number of dimensions of the configuration space.
KeywordsMotion and path planning Path-based refiner Sampling-based motion planning Optimal motion planning
This research was supported by the MOTIE under the Industrial Foundation Technology Development Program supervised by the KEIT (No. 10084589).
- 1.Faverjon B, Tournassoud P (1987) A local based approach for path planning of manipulators with a high number of degrees of freedom. In: IEEE international conference on robotics and automation, pp 1152–1159Google Scholar
- 3.Gammell JD, Srinivasa SS, Barfoot TD (2015) Batch informed trees (BIT*): sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. In: IEEE proceedings of the international conference on robotics and automation 2015, pp 3067–3074Google Scholar
- 6.Rickert M, Brock O, Knoll A (2008) Balancing exploration and exploitation in motion planning. In: IEEE proceedings of the international conference on robotics and automation 2008, pp 2812–2817Google Scholar
- 10.Richter C, Bry A, Roy N (2016) Polynomial trajectory planning for aggressive quadrotor flight in dense indoor environments. In: The 16th international symposium on robotics research, vol 14, pp 649–666Google Scholar
- 11.Kuffner JJ, Lavalle SM (2000) RRT-connect: an efficient approach to single-query path planning. In: IEEE proceedings of the international conference on robotics and automation 2000, vol 2, pp 995–1001Google Scholar
- 12.Connell D, La HM (2017) Dynamic path planning and replanning for mobile robots using RRT. arXiv:1704.04585
- 14.Noreen I, Khan A, Habib Z (2016) A comparison of RRT, RRT* and RRT*—smart path planning algorithms. Int J Comput Sci Netw Secur (IJCSNS) 16(10):20–27Google Scholar
- 17.Yershova A, Jaillet L, Simeon T (2005) Dynamic-domain RRTs: efficient exploration by controlling the sampling domain. In: IEEE proceedings of the international conference on robotics and automation 2005, pp 3856–3861Google Scholar
- 19.Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed RRT*: optimal incremental path planning focused through an admissible ellipsoidal heuristic. In: IEEE/RSJ international conference on intelligent robots and systems, pp 2997–3004Google Scholar
- 20.Islam F, Nasir J, Malik U, Ayaz Y (2012) RRT*-smart: rapid convergence implementation of RRT* towards optimal solution. In: IEEE international conference on mechatronics and automation 2012, pp 1651–1656Google Scholar
- 22.Perez A, Karaman S, Shkolnik A, Frazzoli E, Teller S, Walter MR (2011) Asymptotically-optimal path planning for manipulation using incremental sampling-based algorithms. In: IEEE/RSJ international conference on intelligent robots and systems, pp 4307–4313Google Scholar