The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Heuristic approaches in robot path planning: A survey
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
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Sampling-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
Introduction to autonomous mobile robots
(2011) · Choice Reviews Online · doi:10.5860/choice.49-1492 · Cited by 2,169
Anytime Motion Planning using the RRT*
Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980479 · Cited by 881
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
Ge, S. S., & Cui, Y. J. (2002) · Autonomous Robots · doi:10.1023/a:1020564024509 · Cited by 803
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Optimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Webb, D. J., & van den Berg, J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631299 · Cited by 409
Robot path planning in uncertain environment using multi-objective particle swarm optimization
Zhang, Y., Gong, D.-W., & Zhang, J.-H. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.09.019 · Cited by 406
Cited by
Genetic Algorithm Based Approach for Autonomous Mobile Robot Path Planning
Lamini, C., Benhlima, S., & Elbekri, A. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.01.113 · Cited by 478
Geometric A-Star Algorithm: An Improved A-Star Algorithm for AGV Path Planning in a Port Environment
Tang, G., Tang, C., Claramunt, C., Hu, X., & Zhou, P. (2021) · IEEE Access · doi:10.1109/access.2021.3070054 · Cited by 474
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
Nazarahari, M., Khanmirza, E., & Doostie, S. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.08.008 · Cited by 454
A Survey of Path Planning Algorithms for Mobile Robots
Karur, K., Sharma, N., Dharmatti, C., & Siegel, J. E. (2021) · Vehicles · doi:10.3390/vehicles3030027 · Cited by 401
Path planning and obstacle avoidance for AUV: A review
Cheng, C., Sha, Q., He, B., & Li, G. (2021) · Ocean Engineering · doi:10.1016/j.oceaneng.2021.109355 · Cited by 378
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
Advancements in Humanoid Robots: A Comprehensive Review and Future Prospects
Tong, Y., Liu, H., & Zhang, Z. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2023.124140 · Cited by 288
Ajeil, F. H., Ibraheem, I. K., Sahib, M. A., & Humaidi, A. J. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106076 · Cited by 254
A Survey of Deep Learning Applications to Autonomous Vehicle Control
Kuutti, S., Bowden, R., Jin, Y., Barber, P., & Fallah, S. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2962338 · Cited by 96
Multi-robot Path Planning Based on Spatio-Temporal Information in Large-scale Unknown Environment
Ding, J., Zhang, L., & Cheng, J. (2021) · 2021 27th International Conference on Mechatronics and Machine Vision in Practice (M2VIP) · doi:10.1109/m2vip49856.2021.9665033 · Cited by 3
Metadata
- Authors
- Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2016-12
- Volume
- 86
- Pages
- 13-28
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2515498963
- Cited by
- 641
- References
- 51
- FWCI
- 30.58
- 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.