Skip to main content
SpringerLink
Log in

Informed RRT* with improved converging rate by adopting wrapping procedure

  • Original Research Paper
  • Published:
Intelligent Service Robotics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  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–1159

  2. Schwartz JT, Sharir M (1983) On the “Piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds. Adv Appl Math 4(3):298–351

    Article  MathSciNet  MATH  Google 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–3074

  4. Lozano-Perez T (1983) Spatial planning: a configuration space approach. IEEE Trans Comput C–32(2):108–120

    Article  MathSciNet  MATH  Google Scholar 

  5. Tolani D, Goswami A, Badler NI (2000) Real-time inverse kinematics techniques for anthropomorphic limbs. Graph Models 2000 62(5):353–388

    Article  MATH  Google 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–2817

  7. Kavraki LE, Svestka P, Latombe JC (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 1996 12(4):566–580

    Article  Google Scholar 

  8. Lozano-Perez T (1987) A simple motion-planning algorithm for general robot manipulators. IEEE J Robot Autom 1987 3(3):224–238

    Article  Google Scholar 

  9. Janson L, Schmerling E, Clark A, Pavone M (2015) Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions. Int J Robot Res 34(7):883–921

    Article  Google 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–666

  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–1001

  12. Connell D, La HM (2017) Dynamic path planning and replanning for mobile robots using RRT. arXiv:1704.04585

  13. Khan A et al (2017) Online complete coverage path planning using two-way proximity search. Intel Serv Robot 10(3):229–240

    Article  Google Scholar 

  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–27

    Google Scholar 

  15. Khan A, Noreen I, Habib Z (2017) On complete coverage path planning algorithms for non-holonomic mobile robots: survey and challenges. J Inf Sci Eng 33(1):101–121

    MathSciNet  Google Scholar 

  16. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 2011 30(7):846–894

    Article  MATH  Google 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–3861

  18. Solovey K, Salzman O, Halperin D (2016) Finding a needle in an exponential haystack; discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Int J Robot Res 35:501–513

    Article  Google 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–3004

  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–1656

  21. Geraerts R, Overmars MH (2007) Creating high-quality paths for motion planning. Int J Robot Res 26(8):845–863

    Article  Google 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–4313

Download references

Acknowledgements

This research was supported by the MOTIE under the Industrial Foundation Technology Development Program supervised by the KEIT (No. 10084589).

Author information

Authors and Affiliations

  1. School of Mechanical Engineering, Korea University, Seoul, Korea

    Min-Cheol Kim & Jae-Bok Song

Authors
  1. Min-Cheol Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jae-Bok Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jae-Bok Song.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (txt 0 KB)

Supplementary material 2 (txt 0 KB)

Supplementary material 3 (wmv 7299 KB)

Supplementary material 4 (wmv 5650 KB)

Supplementary material 5 (wmv 6431 KB)

Supplementary material 6 (wmv 2439 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, MC., Song, JB. Informed RRT* with improved converging rate by adopting wrapping procedure. Intel Serv Robotics 11, 53–60 (2018). https://doi.org/10.1007/s11370-017-0242-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11370-017-0242-9

Keywords

Search

Navigation