Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

An Improved RRT* Path Planning Algorithm in Dynamic Environment

  • Conference paper
  • First Online:
Methods and Applications for Modeling and Simulation of Complex Systems (AsiaSim 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1713))

Included in the following conference series:

Abstract

With the increasingly diverse usage scenarios of mobile robots, the path planning of mobile robots in dynamic environments has become a hot issue. Aiming at the slow planning speed of RRT* algorithm in dynamic environment, this paper proposes an improved RRT* algorithm: efficient dynamic rapidly-exploring random tree star (ED-RRT*). In a static environment, the algorithm uses goal-biased sampling to reduce the randomness of the RRT* sampling method, and sets the sampling step size to be adaptive to improve the planning speed of the initial path. When the dynamic environment encounters obstacles and needs to be re-planned, the local target points are given based on the initial path and environmental information to quickly complete the local re-planning. The path information planned in the static environment is used as the prior information to improve the efficiency of the replanning algorithm. Finally, in the simulation environment based on OpenCV2, the ED-RRT* algorithm is compared with the improved RRT* algorithm. The experimental results show that ED-RRT* has faster dynamic performance and fewer nodes.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Punith, K.M.B., Sumanth, S., Savadatti, M.A.: Internet rescue robots for disaster management. Int. J. Wirel. Microwave Technol. 11(2), 13–23 (2021)

    Article  Google Scholar 

  2. Vasquez, A., et al.: Deep detection of people and their mobility aids for a hospital robot. In: 2017 European Conference on Mobile Robots (ECMR). IEEE (2017)

    Google Scholar 

  3. Alatise, M.B., Hancke, G.P.: A review on challenges of autonomous mobile robot and sensor fusion methods. IEEE Access 8, 39830–39846 (2020)

    Article  Google Scholar 

  4. Hart, P.E., et al.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (2007)

    Article  Google Scholar 

  5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  6. Li, Z., Shi, R., Zhang, Z.: A new path planning method based on sparse A* algorithm with map segmentation. Trans. Inst. Meas. Control. 44(4), 916–925 (2022)

    Article  Google Scholar 

  7. LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378–400 (2001)

    Article  Google Scholar 

  8. Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings of the 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), vol. 2, pp. 995–1001 (2000)

    Google Scholar 

  9. Urmson, C., Simmons, R.: Approaches for heuristically biasing RRT growth. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, Las Vegas, USA, vol. 2, pp. 1178–1183 (2003)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Adiyatov, O., Varol, H.A.: Rapidly-exploring random tree based memory efficient motion planning. In: 2013 IEEE International Conference on Mechatronics and Automation, pp. 354–359. IEEE (2013)

    Google Scholar 

  12. Gammell, J.D., Srinivasa, S.S., Barfoot, T.D.: Informed RRT*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE (2014)

    Google Scholar 

  13. Fang, Z., Qidan, Z., Guoliang, Z.: Path optimization of manipulator based on the improved rapidly-exploring random tree algorithm. J. Mech. Eng. 47(11), 30–35 (2011)

    Article  Google Scholar 

  14. Nasir, J., Islam, F., Malik, U., et al.: RRT*-smart: a rapid convergence implementation of RRT*. Int. J. Adv. Rob. Syst. 10(7), 299–311 (2013)

    Article  Google Scholar 

  15. Stentz, A., et al.: The focussed d∗ algorithm for real-time replanning. IJCAI 95, 1652–1659 (1995)

    Google Scholar 

  16. Koenig, S., Likhachev, M.: Improved fast replanning for robot navigation in unknown terrain. In: Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), vol. 1, pp. 968–975 (2002)

    Google Scholar 

  17. Xi, Y., et al.: A real-time dynamic path planning method combining artificial potential field method and biased target RRT algorithm. J. Phys: Conf. Ser. 1, 2021 (1905)

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Natural Science Found of China (Grant No. 62103393).

Author information

Authors and Affiliations

  1. University of Science and Technology of China, Hefei, Anhui, China

    Jianyu Li, Kezhi Wang, Zonghai Chen & Jikai Wang

Authors
  1. Jianyu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kezhi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zonghai Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jikai Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jikai Wang .

Editor information

Editors and Affiliations

  1. Tsinghua University, Beijing, China

    Wenhui Fan

  2. Beihang University, Beijing, China

    Lin Zhang

  3. Beihang University, Beijing, China

    Ni Li

  4. Beihang University, Beijing, China

    Xiao Song

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, J., Wang, K., Chen, Z., Wang, J. (2022). An Improved RRT* Path Planning Algorithm in Dynamic Environment. In: Fan, W., Zhang, L., Li, N., Song, X. (eds) Methods and Applications for Modeling and Simulation of Complex Systems. AsiaSim 2022. Communications in Computer and Information Science, vol 1713. Springer, Singapore. https://doi.org/10.1007/978-981-19-9195-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-9195-0_25

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-9194-3

  • Online ISBN: 978-981-19-9195-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation