The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Neural RRT*: Learning-Based Optimal Path Planning
Abstract
Rapidly random-exploring tree (RRT) and its variants are very popular due to their ability to quickly and efficiently explore the state space. However, they suffer sensitivity to the initial solution and slow convergence to the optimal solution, which means that they consume a lot of memory and time to find the optimal path. It is critical to quickly find a short path in many applications such as the autonomous vehicle with limited power/fuel. To overcome these limitations, we propose a novel optimal path planning algorithm based on the convolutional neural network (CNN), namely the neural RRT* (NRRT*). The NRRT* utilizes a nonuniform sampling distribution generated from a CNN model. The model is trained using quantities of successful path planning cases. In this article, we use the A* algorithm to generate the training data set consisting of the map information and the optimal path. For a given task, the proposed CNN model can predict the probability distribution of the optimal path on the map, which is used to guide the sampling process. The time cost and memory usage of the planned path are selected as the metric to demonstrate the effectiveness and efficiency of the NRRT*. The simulation results reveal that the NRRT* can achieve convincing performance compared with the state-of-the-art path planning algorithms. Note to Practitioners-The motivation of this article stems from the need to develop a fast and efficient path planning algorithm for practical applications such as autonomous driving, warehouse robot, and countless others. Sampling-based algorithms are widely used in these areas due to their good scalability and high efficiency. However, the quality of the initial path is not guaranteed and it takes much time to converge to the optimal path. To quickly obtain a high-quality initial path and accelerate the convergence speed, we propose the NRRT*. It utilizes a nonuniform sampling distribution and achieves better performance. The NRRT* can be also applied to other sampling-based algorithms for improved results in different applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Fully convolutional networks for semantic segmentation
Long, J., Shelhamer, E., & Darrell, T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298965 · Cited by 38,834
Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation
Chen, L.-C., Zhu, Y., Papandreou, G., Schroff, F., & Adam, H. (2018) · arXiv · doi:10.48550/arxiv.1802.02611 · Cited by 20,063
Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation
Chen, L.-C., Zhu, Y., Papandreou, G., Schroff, F., & Adam, H. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01234-2_49 · Cited by 20,054
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“The artificial potential field (APF) method [2] utilizes a potential function over the whole configuration space to direct the movement of the robot.”
MethodRethinking Atrous Convolution for Semantic Image Segmentation
Chen, L.-C., Papandreou, G., Schroff, F., & Adam, H. (2017) · arXiv · doi:10.48550/arxiv.1706.05587 · Cited by 7,517
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 1×
“The sampling-based algorithms, such as probabilistic roadmap (PRM) [5] and rapidly random-exploring tree (RRT) [6], have become very popular for efficiently solving high-dimensional and mul-ticonstrained path planning problems.”
MethodSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
(2016) · Springer Handbooks · doi:10.1007/978-3-319-32552-1 · Cited by 2,122
3D-R2N2: A Unified Approach for Single and Multi-view 3D Object Reconstruction
Choy, C. B., Xu, D., Gwak, J., Chen, K., & Savarese, S. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46484-8_38 · Cited by 1,632
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6942976 · Cited by 1,207
Oksanen, T., Tiusanen, J., & Kostamo, J. (2009) · Precision agriculture '09 · doi:10.3920/9789086866649_102 · Cited by 414
Learning Sampling Distributions for Robot Motion Planning
Ichter, B., Harrison, J., & Pavone, M. (2018) · 2018 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2018.8460730 · Cited by 370
Approaches for heuristically biasing RRT growth
Urmson, C., & Simmons, R. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248805 · Cited by 334
Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain
Yershova, A., Jaillet, L., Simeon, T., & LaValle, S. M. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570709 · Cited by 258
Potential functions based sampling heuristic for optimal path planning
Qureshi, A. H., & Ayaz, Y. (2016) · Autonomous Robots · doi:10.1007/s10514-015-9518-0 · Cited by 248
Optimal Path Planning Using Generalized Voronoi Graph and Multiple Potential Functions
Wang, J., & Meng, M. Q. ‐. (2020) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2019.2962425 · Cited by 107
Self-citationDeeply Informed Neural Sampling for Robot Motion Planning
Qureshi, A. H., & Yip, M. C. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8593772 · Cited by 89
Learning Implicit Sampling Distributions for Motion Planning
Zhang, C., Huh, J., & Lee, D. D. (2018) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594028 · Cited by 86
Balancing Exploration and Exploitation in Sampling-Based Motion Planning
Rickert, M., Sieverling, A., & Brock, O. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2340191 · Cited by 78
Finding a High-Quality Initial Solution for the RRTs Algorithms in 2D Environments
Wang, J., Chi, W., Shao, M., & Meng, M. Q. ‐. (2019) · Robotica · doi:10.1017/s0263574719000195 · Cited by 47
Self-citationSemantic-Aware Informative Path Planning for Efficient Object Search Using Mobile Robot
Wang, C., Cheng, J., Chi, W., Yan, T., & Meng, M. Q. ‐. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2946646 · Cited by 47
Self-citation
Cited by
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
Path planning algorithms in the autonomous driving system: A comprehensive review
Reda, M., Onsy, A., Haikal, A. Y., & Ghanbari, A. (2024) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2024.104630 · Cited by 301
A Comprehensive Review of Path-Planning Algorithms for Planetary Rover Exploration
Miao, Q., & Wei, G. (2025) · Remote Sensing · doi:10.3390/rs17111924 · Cited by 13
“…and slow convergence speed associated with RRT and its variants, a new optimal path-planning algorithm called NRRT* (neural RRT*), which combines convolutional neural networks with RRT, was proposed [69], and the effectiveness of the algorithm was validated through simulation experiments.”
Metadata
- Authors
- Wang, J., Chi, W., Li, C., Wang, C., & Meng, M. Q.-H.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2020-10
- Volume
- 17
- Issue
- 4
- Pages
- 1748-1758
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W3011646207
- Cited by
- 555
- References
- 26
- FWCI
- 20.83
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.