The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Optimal path planning of mobile robots: A review
Open accessAbstract
Mobile robots are increasingly used in automated industrial environments. There are also other applications like planet exploration, surveillance, landmine detection, etc. In all these applications, in order that the mobile robots perform their tasks, collision-free path planning is a prerequisite. This article provides an overview of the research progress in path planning of a mobile robot for off-line as well as on-line environments. Commonly used classic and evolutionary approaches of path planning of mobile robots have been addressed. Review shows that evolutionary optimization algorithms are computationally efficient and hence are increasingly being used in tandem with classic approaches while handling Non-deterministic Polynomial time hard (NP-hard) problems. Also, challenges involved in developing a computationally efficient path planning algorithm are addressed. Key words: Path planning, mobile robot, off-line environment, on-line environment, classic, evolutionary algorithms.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
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
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
The dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
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
The vector field histogram-fast obstacle avoidance for mobile robots
Borenstein, J., & Koren, Y. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88137 · Cited by 2,301
Introduction to autonomous mobile robots
(2011) · Choice Reviews Online · doi:10.5860/choice.49-1492 · Cited by 2,169
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
Motion Planning in Dynamic Environments Using Velocity Obstacles
Fiorini, P., & Shiller, Z. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700706 · Cited by 2,008
Anytime dynamic A*: an anytime, replanning algorithm
Likhachev, M. A., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005) · Cited by 558
Obstacle avoidance in a dynamic environment: a collision cone approach
Chakravarthy, A., & Ghose, D. (1998) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.709600 · Cited by 556
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
High-speed navigation using the global dynamic window approach
Brock, O., & Khatib, O. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.770002 · Cited by 539
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Adaptive evolutionary planner/navigator for mobile robots
Xiao, J., Michalewicz, Z., Zhang, L., & Trojanowski, K. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585889 · Cited by 408
A “retraction” method for planning the motion of a disc
Ó'Dúnlaing, C., & Yap, C. K. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90021-5 · Cited by 404
Evolutionary artificial potential fields and their application in real time robot path planning
Vadakkepat, P., Tan, K. C., & Ming-Liang, W. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870304 · Cited by 346
Classic And Heuristic Approaches In Robot Motion Planning A Chronological Review
Masehian, E., & Sedighizadeh, D. (2007) · doi:10.5281/zenodo.1074971 · Cited by 209
Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching
Garrido, S., Moreno, L., Abderrahim, M., & Martin, F. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282649 · Cited by 199
New heuristic algorithms for efficient hierarchical path planning
Zhu, D. J., & Latombe, J.-C. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.68066 · Cited by 191
Obstacle avoidance with multi-objective optimization by PSO in dynamic environment
Min, H., Zhu, J., & Zheng, X.-J. (2005) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2005.1527447 · Cited by 64
Tan, G., He, H., & Sloman, A. (2006) · Journal of Central South University of Technology · doi:10.1007/s11771-006-0111-8 · Cited by 61
Robot Path Planning in Unknown Environments Using Particle Swarm Optimization
Li, L., & Gong, D. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.923 · Cited by 55
Application of evolutionary artificial potential field in robot soccer system
Vadakkepat, P., Lee, T. H., & Xin, L. (2002) · Joint IFSA World Congress and NAFIPS International Conference · doi:10.1109/nafips.2001.943666 · Cited by 50
Path Planning Based on Improved Binary Particle Swarm Optimization Algorithm
Zhang, Q., & Gu, G. (2008) · IEEE Conference on Robotics, Automation and Mechatronics (RAM) · doi:10.1109/ramech.2008.4681408 · Cited by 30
Memetic Algorithm Based Path Planning For A Mobile Robot
Shahidi, N., Esmaeilzadeh, H., Abdollahi, M., & Lucas, C. (2007) · doi:10.5281/zenodo.1331164 · Cited by 26
Numerical Potential Field and Ant Colony Optimization Based Path Planning in Dynamic Environment
Lv, N., & Feng, Z. (2006) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2006.1713734 · Cited by 20
Cited by
Path Planning with Modified a Star Algorithm for a Mobile Robot
Duchoň, F., Babinec, A., Kajan, M., Beňo, P., Florek, M., Fico, T., & Jurišica, L. (2014) · Procedia Engineering · doi:10.1016/j.proeng.2014.12.098 · Cited by 869
A review of mobile robots: Concepts, methods, theoretical framework, and applications
Rubio, F., Valero, F., & Llopis-Albert, C. (2019) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881419839596 · Cited by 763
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
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
Metadata
- Authors
- Raja, P.
- Venue
- International Journal of the Physical Sciences
- Publisher
- Academic Journals
- Published
- 2012-02-23
- Volume
- 7
- Issue
- 9
- ISSN
- 1992-1950 (ISSN-L)
- OpenAlex
- W2124058244
- Cited by
- 404
- References
- 30
- FWCI
- 20.00
- Type
- journal article
- Language
- en
- Open access
- diamond
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.