The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Solving the optimal path planning of a mobile robot using improved Q-learning
Abstract
Abstract Q-learning, a type of reinforcement learning, has gained increasing popularity in autonomous mobile robot path planning recently, due to its self-learning ability without requiring a priori model of the environment. Yet, despite such advantage, Q-learning exhibits slow convergence to the optimal solution. In order to address this limitation, the concept of partially guided Q-learning is introduced wherein, the flower pollination algorithm (FPA) is utilized to improve the initialization of Q-learning. Experimental evaluation of the proposed improved Q-learning under the challenging environment with a different layout of obstacles shows that the convergence of Q-learning can be accelerated when Q-values are initialized appropriately using the FPA. Additionally, the effectiveness of the proposed algorithm is validated in a real-world experiment using a three-wheeled mobile robot.
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
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
13 Flower Pollination Algorithm for Global OptimizationPreprint
Yang, X. (2012) · Cited by 2,272
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
Introduction to Mobile Robot Control
Tzafestaş, S. G. (2014) · Elsevier eBooks · doi:10.1016/c2013-0-01365-5 · Cited by 345
A Deterministic Improved Q-Learning for Path Planning of a Mobile Robot
Konar, A., Chakraborty, I. G., Singh, S. J., Jain, L. C., & Nagar, A. K. (2013) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmca.2012.2227719 · Cited by 269
Neural networks based reinforcement learning for mobile robots obstacle avoidance
Duguleana, M., & Mogan, G. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.06.021 · Cited by 197
Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments
Tahir, Z., Qureshi, A. H., Ayaz, Y., & Nawaz, R. (2018) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2018.06.013 · Cited by 175
Large-scale cost function learning for path planning using deep inverse reinforcement learning
Wulfmeier, M., Rao, D., Wang, D. Z., Ondruska, P., & Posner, I. (2017) · The International Journal of Robotics Research · doi:10.1177/0278364917722396 · Cited by 170
Backward Q-learning: The combination of Sarsa algorithm and Q-learning
Wang, Y.-H., Li, T.-H. S., & Lin, C.-J. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.06.016 · Cited by 164
Rakshit, P., Konar, A., Bhowmik, P., Goswami, I., Das, S., Jain, L. C., & Nagar, A. K. (2013) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmca.2012.2226024 · Cited by 157
Application of mutation operators to flower pollination algorithm
Salgotra, R., & Singh, U. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.02.035 · Cited by 127
How to Discount Deep Reinforcement Learning: Towards New Dynamic StrategiesPreprint
François-Lavet, V., Raphael Fonteneau, D., & Ernst, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.02011 · Cited by 122
Q learning algorithm based UAV path learning and obstacle avoidence approach
Zhao, Y., Zheng, Z., Zhang, X., & Yang, L. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8027884 · Cited by 117
Incremental Q -learning strategy for adaptive PID control of mobile robots
Carlucho, I., Paula, M. D., Villar, S. A., & Acosta, G. G. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.03.002 · Cited by 107
Koenig, S., & Simmons, R. G. (1996) · Machine Learning · doi:10.1007/bf00114729 · Cited by 106
A Path Planning Algorithm for UAV Based on Improved Q-Learning
Yan, C., & Xiang, X. (2018) · International Conference on Robotics and Automation Sciences (ICRAS) · doi:10.1109/icras.2018.8443226 · Cited by 95
Synergism of Firefly Algorithm and Q-Learning for Robot Arm Path Planning
Sadhu, A. K., Konar, A., Bhattacharjee, T., & Das, S. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.03.014 · Cited by 93
A machine-learning approach to multi-robot coordination
Wang, Y., & de Silva, C. W. (2007) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2007.05.006 · Cited by 83
Cruz, D. L., & Yu, W. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.08.108 · Cited by 72
Improved decentralized Q-learning algorithm for interference reduction in LTE-femtocells
Simsek, M., Czylwik, A., Galindo‐Serrano, A., & Giupponi, L. (2011) · Wireless Advanced (WiAd) · doi:10.1109/wiad.2011.5983301 · Cited by 51
An efficient initialization approach of Q-learning for mobile robots
Song, Y. H., Li, Y., Li, C., & Zhang, G. (2012) · International Journal of Control Automation and Systems · doi:10.1007/s12555-012-0119-9 · Cited by 43
Using flower pollination algorithm and atomic potential function for shape matching
Zhou, Y., Zhang, S., Luo, Q., & Wen, C. (2016) · Neural Computing and Applications · doi:10.1007/s00521-016-2524-0 · Cited by 35
Continuous-time path planning for multi-agents with fuzzy reinforcement learning
Cruz, D. L., & Yu, W. (2017) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-161822 · Cited by 29
Arin, A., & Rabadi, G. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2016.10.022 · Cited by 24
(2012) · doi:10.1109/wiad19785.2012 · Cited by 18
Zaki, O. F., & Dunnigan, M. W. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2017.07.012 · Cited by 13
Cited by
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68
“Optimal Value RL [209, 210].”
Barth, A., & Ma, O. (2024) · Acta Astronautica · doi:10.1016/j.actaastro.2023.11.014 · Cited by 15
Metadata
- Authors
- Low, E. S., Ong, P., & Cheah, K. C.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2019-05
- Volume
- 115
- Pages
- 143-161
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W2917089854
- Cited by
- 326
- References
- 27
- FWCI
- 16.92
- 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.