The DOI matches its Crossref record; 167 of the 167 references it cites were found in a registry or an index.
Sampling-Based Robot Motion Planning: A Review
Open accessAbstract
Motion planning is a fundamental research area in robotics. Sampling-based methods offer an efficient solution for what is otherwise a rather challenging dilemma of path planning. Consequently, these methods have been extended further away from basic robot planning into further difficult scenarios and diverse applications. A comprehensive survey of the growing body of work in sampling-based planning is given here. Simulations are executed to evaluate some of the proposed planners and highlight some of the implementation details that are often left unspecified. An emphasis is placed on contemporary research directions in this field. We address planners that tackle current issues in robotics. For instance, real-life kinodynamic planning, optimal planning, replanning in dynamic environments, and planning under uncertainty are discussed. The aim of this paper is to survey the state of the art in motion planning and to assess selected planners, examine implementation details and above all shed a light on the current challenges in motion planning and the promising approaches that will potentially overcome those problems.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
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
Vision meets robotics: The KITTI dataset
Geiger, A., Lenz, P., Stiller, C., & Urtasun, R. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913491297 · Cited by 9,913
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×
“Khatib [40] proposed a potential field method such that artificial forces repelled the robot away from the obstacles and attracted it towards the goal position.”
BackgroundMetropolis, N., & Ulam, S. (1949) · Journal of the American Statistical Association · doi:10.1080/01621459.1949.10483310 · Cited by 6,474
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 4×
“Initially developed for articulated robots [53]–[55].”
MethodInfluentialSampling-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) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Simultaneous localization and mapping: part I
Durrant-Whyte, H., & Bailey, T. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1638022 · Cited by 4,199
Cited by
A Survey of Autonomous Driving: Common Practices and Emerging Technologies
Yurtsever, E., Lambert, J., Carballo, A., & Takeda, K. (2020) · IEEE Access · doi:10.1109/access.2020.2983149 · Cited by 1,889
“A detailed overview of Sampling Based Planning (SBP) methods can be found in [262].”
MethodA Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Heuristic approaches in robot path planning: A survey
Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.08.001 · Cited by 641
Deep reinforcement learning based mobile robot navigation: A review
Zhu, K., & Zhang, T. (2021) · Tsinghua Science and Technology · doi:10.26599/tst.2021.9010012 · Cited by 499
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Song, B., Wang, Z., & Zou, L. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106960 · Cited by 441
Tan, C. S., Mohd-Mokhtar, R., & Arshad, M. R. (2021) · IEEE Access · doi:10.1109/access.2021.3108177 · Cited by 346
In the Passenger Seat: Investigating Ride Comfort Measures in Autonomous Cars
Elbanhawi, M., Simic, M., & Jazar, R. (2015) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2015.2405571 · Cited by 326
Self-citationPath 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
Chang, L., Shan, L., Jiang, C., & Dai, Y. (2021) · Autonomous Robots · doi:10.1007/s10514-020-09947-4 · Cited by 290
Qureshi, A. H., & Ayaz, Y. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2015.02.007 · Cited by 262
Human-Machine Interface for Remote Training of Robot Tasks
Spranger, J., Buzatoiu, R., Polydoros, A., Nalpantidis, L., & Boukas, E. (2018) · 2018 IEEE International Conference on Imaging Systems and Techniques (IST) · doi:10.1109/ist.2018.8577081 · Cited by 10
Metadata
- Authors
- Elbanhawi, M., & Simic, M.
- Venue
- IEEE Access
- Published
- 2014
- Volume
- 2
- Pages
- 56-77
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2055201760
- Cited by
- 786
- References
- 167
- FWCI
- 23.15
- Type
- journal article
- Language
- en
- Open access
- gold
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.