Skip to main content
Log in

Neural-network-driven method for optimal path planning via high-accuracy region prediction

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

Sampling-based path planning algorithms suffer from heavy reliance on uniform sampling, which accounts for unreliable and time-consuming performance, especially in complex environments. Recently, neural-network-driven methods predict regions as sampling domains to realize a non-uniform sampling and reduce calculation time. However, the accuracy of region prediction hinders further improvement. We propose a sampling-based algorithm, abbreviated to Region Prediction Neural Network RRT* (RPNN-RRT*), to rapidly obtain the optimal path based on a high-accuracy region prediction. First, we implement a region prediction neural network (RPNN), to predict accurate regions for the RPNN-RRT*. A full-layer channel-wise attention module is employed to enhance the feature fusion in the concatenation between the encoder and decoder. Moreover, a three-level hierarchy loss is designed to learn the pixel-wise, map-wise, and patch-wise features. A dataset, named Complex Environment Motion Planning, is established to test the performance in complex environments. Ablation studies and test results show that a high accuracy of 89.13% is achieved by the RPNN for region prediction, compared with other region prediction models. In addition, the RPNN-RRT* performs in different complex scenarios, demonstrating significant and reliable superiority in terms of the calculation time, sampling efficiency, and success rate for optimal path planning.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Data availability

The data are available from the corresponding author on reasonable request.

References

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

    Article  MathSciNet  Google Scholar 

  2. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107

    Article  Google Scholar 

  3. Lavalle SM (1998) Rapidly-exploring random trees: a new tool for path planning. Comput Sci Dept. https://api.semanticscholar.org/CorpusID:14744621

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

    Article  Google Scholar 

  5. Zafar MN, Mohanta J (2018) Methodology for path planning and optimization of mobile robots: a review. Procedia Comput Sci 133:141–152

    Article  Google Scholar 

  6. Urmson C, Simmons R (2003) Approaches for heuristically biasing RRT growth: intelligent robots and systems. In: Proceedings 2003 IEEE/RSJ international conference on intelligent robots and systems (IROS 2003) (Cat. No.03CH37453), Las Vegas, NV, USA, vol 2, pp 1178–1183

  7. Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed RRT*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE/RSJ international conference on intelligent robots and systems, Chicago, IL, USA, pp 2997–3004

  8. Gammell JD, Barfoot TD, Srinivasa SS (2020) Batch informed trees (bit*): informed asymptotically optimal anytime search. Int J Robot Res 39(5):543–567

    Article  Google Scholar 

  9. Wang J, Chi W, Shao M, Meng MQ-H (2019) Finding a high-quality initial solution for the RRTs algorithms in 2D environments. Robotica 37(10):1677–1694

    Article  Google Scholar 

  10. Ichter B, Harrison J, Pavone M (2018) Learning sampling distributions for robot motion planning. In: 2018 IEEE international conference on robotics and automation (ICRA), Brisbane, QLD, Australia, pp 7087–7094

  11. Zhang C, Huh J, Lee DD (2018) Learning implicit sampling distributions for motion planning. In: 2018 IEEE/RSJ international conference on intelligent robots and systems (IROS), Madrid, Spain, pp 3654–3661

  12. Wang J, Chi W, Li C, Wang C, Meng MQ-H (2020) Neural RRT*: learning-based optimal path planning. IEEE Trans Autom Sci Eng 17(4):1748–1758

    Article  Google Scholar 

  13. Zhang T, Wang J, Meng MQ-H (2021) Generative adversarial network based heuristics for sampling-based path planning. IEEE/CAA J Autom Sin 9(1):64–74

    Article  Google Scholar 

  14. Ma N, Wang J, Liu J, Meng MQ-H (2021) Conditional generative adversarial networks for optimal path planning. IEEE Trans Cogn Dev Syst 14(2):662–671

    Article  Google Scholar 

  15. Liu J, Li B, Li T, Chi W, Wang J, Meng MQ-H (2021) Learning-based fast path planning in complex environments. In: 2021 IEEE international conference on robotics and biomimetics (ROBIO), Sanya, China, pp 1351–1358

  16. Wang J, Liu J, Chen W, Chi W, Meng MQ-H (2021) Robot path planning via neural-network-driven prediction. IEEE Trans Artif Intell 3(3):451–460

    Article  Google Scholar 

  17. Ma H, Li C, Liu J, Wang J, Meng MQ-H (2022) Enhance connectivity of promising regions for sampling-based path planning. IEEE Trans Autom Sci Eng 20(3):1997–2010

    Article  Google Scholar 

  18. Wang J, Jia X, Zhang T, Ma N, Meng MQ-H (2021) Deep neural network enhanced sampling-based path planning in 3D space. IEEE Trans Autom Sci Eng 19(4):3434–3443

    Article  Google Scholar 

  19. Cho K, Van Merriënboer B, Gulcehre C, Bahdanau D, Bougares F, Schwenk H, Bengio Y (2014) Learning phrase representations using RNN encoder–decoder for statistical machine translation. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), Doha, Qatar, pp 1724

  20. Ronneberger O, Fischer P, Brox T (2015) U-net: convolutional networks for biomedical image segmentation. In: Medical image computing and computer-assisted intervention-MICCAI, 18th international conference, Munich, Germany, October 5–9, 2015, proceedings, part III 18. Springer, Berlin, pp 234–241

  21. Wang H, Cao P, Wang J, Zaiane OR (2022) Uctransnet: rethinking the skip connections in U-Net from a channel-wise perspective with transformer. In: Proceedings of the AAAI conference on artificial intelligence, Vancouver, Canada, vol 36, no 3, pp 2441–2449

  22. He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: 2016 IEEE conference on computer vision and pattern recognition (CVPR), Las Vegas, NV, USA, pp 770–778

  23. Hu J, Shen L, Sun G (2018) Squeeze-and-excitation networks. IEEE Trans Pattern Anal Mach Intell 42(8):2011–2023

    Article  Google Scholar 

  24. Johnson JJ, Kalra US, Bhatia A, Li L, Qureshi AH, Yip MC (2022) Motion planning transformers: a motion planning framework for mobile robots. arXiv preprint. arXiv:2106.02791

  25. Yan F, Liu Y-S, Xiao J-Z (2013) Path planning in complex 3D environments using a probabilistic roadmap method. Int J Autom Comput 10:525–533

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuan Huang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was submitted and accepted for the Journal Track of the joint symposium of the 29th International Symposium on Artificial Life and Robotics, the 9th International Symposium on BioComplexity, and the 7th International Symposium on Swarm Behavior and Bio-Inspired Robotics (Beppu, Oita and Online, January 24–26, 2024).

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, Y., Tsao, CT., Shen, T. et al. Neural-network-driven method for optimal path planning via high-accuracy region prediction. Artif Life Robotics 29, 12–21 (2024). https://doi.org/10.1007/s10015-023-00915-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-023-00915-6

Keywords

Navigation