The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments
Open accessAbstract
Abstract Rapidly-exploring Random Tree star (RRT*) has recently gained immense popularity in the motion planning community as it provides a probabilistically complete and asymptotically optimal solution without requiring the complete information of the obstacle space. In spite of all of its advantages, RRT* converges to optimal solution very slowly. Hence to improve the convergence rate, its bidirectional variants were introduced, the Bi-directional RRT* (B-RRT*) and Intelligent Bi-directional RRT* (IB-RRT*). However, as both variants perform pure exploration, they tend to suffer in highly cluttered environments. In order to overcome these limitations we introduce a new concept of potentially guided bidirectional trees in our proposed Potentially Guided Intelligent Bi-directional RRT* (PIB-RRT*) and Potentially Guided Bi-directional RRT* (PB-RRT*). The proposed algorithms greatly improve the convergence rate and have a more efficient memory utilization. Theoretical and experimental evaluation of the proposed algorithms have been made and compared to the latest state of the art motion planning algorithms under different challenging environmental conditions and have proven their remarkable improvement in efficiency and convergence rate.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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×
“Hence in order to avoid discretization of the state space and to avoid the above stated problems such as the local minima, sampling based stochastic searches were introduced such as Expansive Space Trees (ESTs) [20], Probabilistic Road Maps (PRMs) [21] and Rapidly-exploring Random Trees (RRTs) [22].”
Method
Cited by
A Novel Hybrid Particle Swarm Optimization Algorithm for Path Planning of UAVs
Yu, Z., Si, Z., Li, X., Wang, D., & Song, H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3182798 · Cited by 352
Solving the optimal path planning of a mobile robot using improved Q-learning
Low, E. S., Ong, P., & Cheah, K. C. (2019) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2019.02.013 · Cited by 326
Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners
Qureshi, A. H., Miao, Y., Simeonov, A., & Yip, M. C. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3006716 · Cited by 287
Self-citationQureshi, A. H., Simeonov, A., Bency, M. J., & Yip, M. C. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8793889 · Cited by 253
Self-citation
Metadata
- Authors
- Tahir, Z., Qureshi, A. H., Ayaz, Y., & Nawaz, R.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2018-10
- Volume
- 108
- Pages
- 13-27
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2877466430
- Cited by
- 175
- References
- 2
- FWCI
- 8.10
- Type
- journal article
- Language
- en
- Open access
- green
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: Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments. https://app.cochat.ai/papers/10.1016/j.robot.2018.06.013
- The paper
- Tahir, Z., Qureshi, A. H., Ayaz, Y., & Nawaz, R. (2018). Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments. Robotics and Autonomous Systems. https://doi.org/10.1016/j.robot.2018.06.013
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.