The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
Open accessAbstract
Abstract The sampling-based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (B-RRT*). We introduce a new variant called Intelligent Bidirectional-RRT* (IB-RRT*) which is an improved variant of the optimal RRT* and bidirectional version of RRT* (B-RRT*) algorithms and is specially designed for complex cluttered environments. IB-RRT* utilizes the bidirectional trees approach and introduces intelligent sample insertion heuristic for fast convergence to the optimal path solution using uniform sampling heuristics. The proposed algorithm is evaluated theoretically and experimental results are presented that compares IB-RRT* with RRT* and B-RRT*. Moreover, experimental results demonstrate the superior efficiency of IB-RRT* in comparison with RRT* and B-RRT in complex cluttered environments.
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
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×
“Arguably, the most well-known sampling-based algorithms include Probabilistic Road Maps (PRM) [14] [15] and Rapidly exploring Random Trees (RRT) [23].”
BackgroundSampling-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
LaValle, S. M. (2006) · Cited by 4,177
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Potential field methods and their inherent limitations for mobile robot navigation
Koren, Y., & Borenstein, J. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131810 · Cited by 1,570
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
Differentially constrained mobile robot motion planning in state lattices
Pivtoraiko, M., Knepper, R. A., & Kelly, A. (2009) · Journal of Field Robotics · doi:10.1002/rob.20285 · Cited by 393
Computational modeling for the computer animation of legged figures
Girard, M., & Maciejewski, A. A. (1985) · ACM SIGGRAPH Computer Graphics · doi:10.1145/325165.325244 · Cited by 314
Howe, R. D., & Matsuoka, Y. (1999) · Annual Review of Biomedical Engineering · doi:10.1146/annurev.bioeng.1.1.211 · Cited by 282
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
Latombe, J.-C. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922067753 · Cited by 264
Anytime search in dynamic graphs
Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2007.11.009 · Cited by 254
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2011) · Robotics · doi:10.7551/mitpress/9123.003.0038 · Cited by 190
Current Issues in Sampling-Based Motion Planning
Lindemann, S. R., & LaValle, S. M. (2005) · Springer Tracts in Advanced Robotics · doi:10.1007/11008941_5 · Cited by 166
Assembly maintainability study with motion planning
Chang, H. T., & Li, T. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1995.525415 · Cited by 130
Optimal Bidirectional Rapidly-Exploring Random Trees
Jordan, M., & Pérez, A. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 114
SANDROS: a dynamic graph search algorithm for motion planning
Chen, P. C., & Hwang, Y. K. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.678449 · Cited by 110
Kinodynamic motion planning with state lattice motion primitives
Pivtoraiko, M., & Kelly, A. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094900 · Cited by 109
Incrementally reducing dispersion by increasing Voronoi bias in RRTs
Lindemann, S. R., & LaValle, S. M. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1308755 · Cited by 94
Asymptotically-optimal path planning for manipulation using incremental sampling-based algorithms
Perez, A., Karaman, S., Shkolnik, A. C., Frazzoli, E., Teller, S. J., & Walter, M. R. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6048640 · Cited by 62
Potential guided directional-RRT* for accelerated motion planning in cluttered environments
Qureshi, A. H., Iqbal, K. F., Qamar, S. M., Islam, F., Ayaz, Y., & Muhammad, N. (2013) · IEEE International Conference on Mechatronics and Automation (ICMA) · doi:10.1109/icma.2013.6617971 · Cited by 54
Self-citationField and Service Robotics: Results of the 6th International Conference
Laugier, C., & Siegwart, R. (2008) · Springer tracts in advanced robotics · doi:10.1007/978-3-540-75404-6 · Cited by 53
Cited by
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Noreen, I., Khan, A., & Habib, Z. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071114 · 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-citationLearning Hierarchical Interactive Multi-Object Search for Mobile Manipulation
Schmalstieg, F., Honerkamp, D., Welschehold, T., & Valada, A. (2023) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2023.3329619 · Cited by 21
Metadata
- Authors
- Qureshi, A. H., & Ayaz, Y.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2015-06
- Volume
- 68
- Pages
- 1-11
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2086860466
- Cited by
- 262
- References
- 29
- FWCI
- 6.93
- 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
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.