The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Fast and Efficient Double-Tree RRT$^*$-Like Sampling-Based Planner Applying on Mobile Robotic Systems
Abstract
As a variant of rapidly exploring random tree (RRT), RRT* is an important improvement of sampling-based algorithms. Although it can provide a feasible planning solution with a higher quality, more resources on optimization are required, resulting in a very slow convergence rate, which cannot satisfy the real-time requirements of most autonomous systems. In this paper, we propose a novel approach of RRT* in collaboration with a double-tree structure to separate the extension and optimization procedure. In our algorithm, the original RRT is employed to explore the unknown environment and to search feasible connecting areas, represented by piecewise lines. Different from the method of anytime RRT*, the RRT phase in our method is to find different homotopic paths during each iteration. Thereafter, a modified RRT* is used to obtain an optimal solution. Simulation results on two benchmarks demonstrate an improved performance of our approach in comparison with the original RRT* and its variants (e.g., DT-RRT). An additional evaluation on two real robotic systems further proves the efficiency of our approach.
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
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
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Cited by
Motion Planning for Autonomous Driving: The State of the Art and Future Perspectives
Teng, S., Hu, X., Deng, P., Li, B., Li, Y., Ai, Y., Yang, D., Li, L., Xuanyuan, Z., Zhu, F., et al. (2023) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2023.3274536 · Cited by 590
Self-citationMOD-RRT*: A Sampling-Based Algorithm for Robot Path Planning in Dynamic Environment
Qi, J., Yang, H., & Sun, H. (2021) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2020.2998740 · Cited by 299
Deep Learning-Based Trajectory Planning and Control for Autonomous Ground Vehicle Parking Maneuver
Chai, R., Liu, D., Liu, T., Tsourdos, A., Xia, Y., & Chai, S. (2023) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2022.3183610 · Cited by 273
Metadata
- Authors
- Chen, L., Shan, Y., Tian, W., Li, B., & Cao, D.
- Venue
- IEEE/ASME Transactions on Mechatronics
- Published
- 2018-12
- Volume
- 23
- Issue
- 6
- Pages
- 2568-2578
- ISSN
- 1083-4435 (ISSN-L)
- 1941-014X
- OpenAlex
- W2796419292
- Cited by
- 178
- References
- 2
- FWCI
- 6.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Fast and Efficient Double-Tree RRT$^*$-Like Sampling-Based Planner Applying on Mobile Robotic Systems. https://app.cochat.ai/papers/10.1109/tmech.2018.2821767
- The paper
- Chen, L., Shan, Y., Tian, W., Li, B., & Cao, D. (2018). A Fast and Efficient Double-Tree RRT$^*$-Like Sampling-Based Planner Applying on Mobile Robotic Systems. IEEE/ASME Transactions on Mechatronics. https://doi.org/10.1109/tmech.2018.2821767
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.