The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
A Deterministic Improved Q-Learning for Path Planning of a Mobile Robot
Abstract
This paper provides a new deterministic Q-learning with a presumed knowledge about the distance from the current state to both the next state and the goal. This knowledge is efficiently used to update the entries in the Q-table once only by utilizing four derived properties of the Q-learning, instead of repeatedly updating them like the classical Q-learning. Naturally, the proposed algorithm has an insignificantly small time complexity in comparison to its classical counterpart. Furthermore, the proposed algorithm stores the Q-value for the best possible action at a state and thus saves significant storage. Experiments undertaken on simulated maze and real platforms confirm that the Q-table obtained by the proposed Q-learning when used for the path-planning application of mobile robots outperforms both the classical and the extended Q-learning with respect to three metrics: traversal time, number of states traversed, and 90° turns required. The reduction in 90° turnings minimizes the energy consumption and thus has importance in the robotics literature.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Barto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
Reinforcement Learning and Dynamic Programming Using Function Approximators
Busoniu, L., Babuska, R., De Schutter, B., & Ernst, D. (2017) · CRC Press eBooks · doi:10.1201/9781439821091 · Cited by 919
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
Average reward reinforcement learning: Foundations, algorithms, and empirical results
Mahadevan, S. (1996) · Machine Learning · doi:10.1007/bf00114727 · Cited by 385
Computational Intelligence: Principles, Techniques and Applications
Konar, A. (2005) · Cited by 320
Self-citationDistributed Q-Learning for Aggregated Interference Control in Cognitive Radio Networks
Galindo-Serrano, A., & Giupponi, L. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2010.2043124 · Cited by 226
Extending Q-Learning to General Adaptive Multi-Agent Systems
Tesauro, G. J. (2003) · Cited by 187
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
Multi-Agent Reinforcement Learning: A Review of Challenges and Applications
Canese, L., Cardarilli, G. C., Di Nunzio, L., Fazzolari, R., Giardino, D., Re, M., & Spanò, S. (2021) · Applied Sciences · doi:10.3390/app11114948 · Cited by 403
Qu, C., Gai, W., Zhong, M., & Zhang, J. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106099 · Cited by 334
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
Metadata
- Authors
- Konar, A., Chakraborty, I. G., Singh, S. J., Jain, L. C., & Nagar, A. K.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2013-09
- Volume
- 43
- Issue
- 5
- Pages
- 1141-1153
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W1997880753
- Cited by
- 269
- References
- 26
- FWCI
- 10.31
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Deterministic Improved Q-Learning for Path Planning of a Mobile Robot. https://app.cochat.ai/papers/10.1109/tsmca.2012.2227719
- The paper
- Konar, A., Chakraborty, I. G., Singh, S. J., Jain, L. C., & Nagar, A. K. (2013). A Deterministic Improved Q-Learning for Path Planning of a Mobile Robot. IEEE Transactions on Systems, Man, and Cybernetics: Systems. https://doi.org/10.1109/tsmca.2012.2227719
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.