The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Path Planning for the Mobile Robot: A Review
Open accessAbstract
Good path planning technology of mobile robot can not only save a lot of time, but also reduce the wear and capital investment of mobile robot. Several methodologies have been proposed and reported in the literature for the path planning of mobile robot. Although these methodologies do not guarantee an optimal solution, they have been successfully applied in their works. The purpose of this paper is to review the modeling, optimization criteria and solution algorithms for the path planning of mobile robot. The survey shows GA (genetic algorithm), PSO (particle swarm optimization algorithm), APF (artificial potential field), and ACO (ant colony optimization algorithm) are the most used approaches to solve the path planning of mobile robot. Finally, future research is discussed which could provide reference for the path planning of mobile robot.
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
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
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×
“The smoothness S [15] is defined as where, α and β are weighted coefficients, DA l is the number of angle of deflection larger than the desired variable, N f is the total number of path segments, S min is the number of segments with the smallest number of path segments in the path.”
BackgroundOptimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C., Kong, Z., & Mettler, B. (2010) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9383-1 · Cited by 779
Theta*: Any-Angle Path Planning on Grids
Daniel, K., Nash, A., Koenig, S., & Felner, A. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2994 · Cited by 465
Using interpolation to improve path planning: The Field D* algorithm
Ferguson, D., & Stentz, A. (2006) · Journal of Field Robotics · doi:10.1002/rob.20109 · Cited by 393
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
Theta*: Any-angle path planning on grids
Daniel, K., Nash, A., Koenig, S., & Felner, A. (2007) · Cited by 334
Mobile robot path planning using artificial bee colony and evolutionary programming
Contreras-Cruz, M. A., Ayala-Ramirez, V., & Hernandez-Belmonte, U. H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.01.067 · Cited by 295
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Artificial potential field based path planning for mobile robots using a virtual obstacle concept
Lee, M. C., & Park, M. G. (2004) · Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003) · doi:10.1109/aim.2003.1225434 · Cited by 196
Dynamic robot path planning using an enhanced simulated annealing approach
Miao, H., & Tian, Y. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.07.022 · Cited by 161
A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment
Chen, D. Z., Szczerba, R. J., & Uhran, J. J. (1997) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.631228 · Cited by 102
An Evolutionary Artificial Potential Field Algorithm for Dynamic Path Planning of Mobile Robot
Qixin, C., Huang, Y., & Zhou, J. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282508 · Cited by 95
Idiotypic Immune Networks in Mobile-Robot Control
Whitbrook, A. M., Aickelin, U., & Garibaldi, J. M. (2007) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2007.907334 · Cited by 83
Tang, B., Zhu, Z., & Luo, J. (2016) · International Journal of Advanced Robotic Systems · doi:10.5772/63812 · Cited by 81
Adaptive Artificial Potential Field Approach for Obstacle Avoidance Path Planning
Zhou, L., & Li, W. (2014) · International Symposium on Computational Intelligence and Design · doi:10.1109/iscid.2014.144 · Cited by 72
Proposal of tangent graph and extended tangent graph for path planning of mobile robots
Liu, Y.-H., & Arimoto, S. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131594 · Cited by 66
Fast Motion Planning by Parallel Processing – a Review
Henrich, D. (1997) · Journal of Intelligent & Robotic Systems · doi:10.1023/a:1007948727999 · Cited by 58
Mobile robot navigation using motor schema and fuzzy context dependent behavior modulation
Huq, R., Mann, G. K. I., & Gosine, R. G. (2007) · Applied Soft Computing · doi:10.1016/j.asoc.2007.02.006 · Cited by 57
An Obstacle Avoidance Method of Soccer Robot Based on Evolutionary Artificial Potential Field
Zhang, Q., Chen, D., & Chen, T. (2012) · Energy Procedia · doi:10.1016/j.egypro.2012.01.276 · Cited by 49
Switching control approach for stable navigation of mobile robots in unknown environments
Toibero, J. M., Robertí, F., Carelli, R., & Fiorini, P. (2010) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2010.10.002 · Cited by 41
Chou, C., Lian, F., & Wang, C. (2010) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2010.2058531 · Cited by 38
Behavioral control through evolutionary neurocontrollers for autonomous mobile robot navigation
Fernández-León, J. A., Acosta, G. G., & Mayosky, M. A. (2008) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2008.06.012 · Cited by 35
Collision-free path planning for mobile robots and/or AGVs using simulated annealing
Martinez-Alfaro, H., & Flugrad, D. R. (2002) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1994.399849 · Cited by 19
Improved Ant Colony Optimization Algorithm and Its Application on Path Planning of Mobile Robot
Zhao, J., & Fu, X. (2012) · Journal of Computers · doi:10.4304/jcp.7.8.2055-2062 · Cited by 16
Cited by
Path planning techniques for mobile robots: Review and prospect
Liu, L., Wang, X., Yang, X., Liu, H., Li, J., & Wang, P. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120254 · Cited by 707
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
Vision-based navigation and guidance for agricultural autonomous vehicles and robots: A review
Bai, Y., Zhang, B., Xu, N., Zhou, J., Shi, J., & Diao, Z. (2023) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2022.107584 · Cited by 353
A Fast Large-Scale Path Planning Method on Lunar DEM Using Distributed Tile Pyramid Strategy
Hong, Z., Tu, B., Tong, X., Pan, H., Zhou, R., Zhang, Y., Han, Y., Wang, J., Yang, S., & Ma, Z. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2022.3226527 · Cited by 12
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
- Zhang, H.-Y., Lin, W.-M., & Chen, A.-X.
- Venue
- Symmetry
- Publisher
- MDPI AG
- Published
- 2018-10-01
- Volume
- 10
- Issue
- 10
- Pages
- 450
- ISSN
- 2073-8994 (ISSN-L)
- OpenAlex
- W2895647709
- Cited by
- 447
- References
- 27
- FWCI
- 8.97
- 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.