The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm
Open accessAbstract
The main aim of this paper is to solve a path planning problem for an autonomous mobile robot in static and dynamic environments. The problem is solved by determining the collision-free path that satisfies the chosen criteria for shortest distance and path smoothness. The proposed path planning algorithm mimics the real world by adding the actual size of the mobile robot to that of the obstacles and formulating the problem as a moving point in the free-space. The proposed algorithm consists of three modules. The first module forms an optimized path by conducting a hybridized Particle Swarm Optimization-Modified Frequency Bat (PSO-MFB) algorithm that minimizes distance and follows path smoothness criteria. The second module detects any infeasible points generated by the proposed hybrid PSO-MFB Algorithm by a novel Local Search (LS) algorithm integrated with the hybrid PSO-MFB algorithm to be converted into feasible solutions. The third module features obstacle detection and avoidance (ODA), which is triggered when the mobile robot detects obstacles within its sensing region, allowing it to avoid collision with obstacles. The simulation results indicate that this method generates an optimal feasible path even in complex dynamic environments and thus overcomes the shortcomings of conventional approaches such as grid methods. Moreover, compared to recent path planning techniques, simulation results show that the proposed hybrid PSO-MFB algorithm is highly competitive in terms of path optimality.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
A review: On path planning strategies for navigation of mobile robot
Patle, B. K., Babu L, G., Pandey, A., Parhi, D. R. K., & Jagadeesh, A. (2019) · Defence Technology · doi:10.1016/j.dt.2019.04.011 · Cited by 914
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
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
Introduction to Mobile Robot Control
Tzafestaş, S. G. (2014) · Elsevier eBooks · doi:10.1016/c2013-0-01365-5 · Cited by 441
Mobile robot path planning using membrane evolutionary artificial potential field
Orozco-Rosas, U., Montiel, O., & Sepúlveda, R. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.01.036 · Cited by 426
Bakdi, A., Hentout, A., Boutami, H., Maoudj, A., Hachour, O., & Bouzouia, B. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.12.008 · Cited by 246
Hossain, M. A., & Ferdous, I. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.07.002 · Cited by 176
A Robust Path Planning For Mobile Robot Using Smart Particle Swarm Optimization
Dewang, H. S., Mohanty, P. K., & Kundu, S. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.07.036 · Cited by 114
Zhang, J., Zhang, Y., & Zhou, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2864188 · Cited by 72
Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
Hosseininejad, S., & Dadkhah, C. (2019) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881419839575 · Cited by 66
Syed, U., Kunwar, F., & Iqbal, M. (2014) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.12.004 · Cited by 65
Humaidi, A. J., & Ibraheem, I. K. (2019) · Energies · doi:10.3390/en12091651 · Cited by 65
Self-citationGlobal Path Planning for Autonomous Mobile Robot Using Genetic Algorithm
Samadi, M., & Othman, M. F. (2013) · International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) · doi:10.1109/sitis.2013.118 · Cited by 60
Kim, H., & Kim, B. K. (2017) · International Journal of Control Automation and Systems · doi:10.1007/s12555-016-0111-x · Cited by 33
Artificial Immune System Based Path Planning of Mobile Robot
Das, P. K., Pradhan, S. K., Patro, S. N., & Balabantaray, B. K. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-25507-6_17 · Cited by 30
Path Planning of an Autonomous Mobile Robot using Directed Artificial Bee Colony Algorithm
HadiAbbas, N., & Ali, F. M. (2014) · International Journal of Computer Applications · doi:10.5120/16836-6681 · Cited by 25
A Fast On-line Global Path Planning Algorithm Based on Regionalized Roadmap for Robot Navigation
Zhong, C., Liu, S., Zhang, B., Lu, Q., Wang, J., Wu, Q., & Gao, F. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.053 · Cited by 8
Optimization of Fuzzy Logic Controllers for Robotic Autonomous Systems with PSO and ACO
Castillo, O., Melín, P., Valdez, F., & Martínez-Marroquín, R. (2011) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-17390-5_17 · Cited by 2
Metadata
- Authors
- Ajeil, F. H., Ibraheem, I. K., Sahib, M. A., & Humaidi, A. J.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2020-04
- Volume
- 89
- Pages
- 106076
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2998786991
- Cited by
- 254
- References
- 21
- FWCI
- 12.95
- 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.