Incremental Reinforcement Learning With Prioritized Sweeping for Dynamic Environments
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In this paper, a novel incremental learning algorithm is presented for reinforcement learning (RL) in dynamic environments, where the rewards of state-action pairs may change over time. The proposed incremental RL (IRL) algorithm learns from the dynamic environments without making any assumptions or having any prior knowledge about the ever-changing environment. First, IRL generates a detector-agent to detect the changed part of the environment (drift environment) by executing a virtual RL process. Then, the agent gives priority to the drift environment and its neighbor environment for iteratively updating their state-action value functions using new rewards by dynamic programming. After the prioritized sweeping process, IRL restarts a canonical learning process to obtain a new optimal policy adapting to the new environment. The novelty is that IRL fuses the new information into the existing knowledge system incrementally as well as weakening the conflict between them. The IRL algorithm is compared to two direct approaches and various state-of-the-art transfer learning methods for classical maze navigation problems and an intelligent warehouse with multiple robots. The experimental results verify that IRL can effectively improve the adaptability and efficiency of RL algorithms in dynamic environments.
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
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148 · cited 1×
“RL algorithms, such as temporal difference [2] and Q-learning [3], have been widely used in intelligent control and industrial applications [4]–[11].”
MethodIncremental Learning for Robust Visual Tracking
Ross, D. A., Lim, J., Lin, R.-S., & Yang, M.-H. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0075-7 · Cited by 3,061 · cited 3×
“Well-performed instances include incremental principal component analysis (IPCA) for robust visual tracking [28] and face recognition [29], population-based incremental learning for dynamic optimization problems [30], incremental learning for evolutionary-algorithms-based classification [31], and human–robot interacti…”
BackgroundMethodQuantum Reinforcement Learning
Dong, D., Chen, C., Li, H., & Tarn, T.-J. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.925743 · Cited by 410
Self-citation
Cited by
A Survey on Offline Reinforcement Learning: Taxonomy, Review, and Open Problems
Figueiredo Prudencio, R., Maximo, M. R. O. A., & Colombini, E. L. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3250269 · Cited by 361
Morales, E. F., Murrieta-Cid, R., Becerra, I., & Esquivel-Basaldua, M. A. (2021) · Intelligent Service Robotics · doi:10.1007/s11370-021-00398-z · Cited by 101
Rule-Based Reinforcement Learning for Efficient Robot Navigation With Space Reduction
Zhu, Y., Wang, Z., Chen, C., & Dong, D. (2022) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2021.3072675 · Cited by 57
“As one of the fundamental topics in the research of mobile robots, robot navigation can be seen as a sequence of translations and rotations for finding the destination, while avoiding obstacles in the environment [3].”
BackgroundSelf-citationWang, Z., Li, H.-X., & Chen, C. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2927320 · Cited by 39
Self-citation
Metadata
- Authors
- Wang, Z., Chen, C., Li, H.-X., Dong, D., & Tarn, T.-J.
- Venue
- IEEE/ASME Transactions on Mechatronics
- Published
- 2019-04
- Volume
- 24
- Issue
- 2
- Pages
- 621-632
- ISSN
- 1083-4435 (ISSN-L)
- 1941-014X
- OpenAlex
- W2912681837
- Cited by
- 73
- References
- 3
- FWCI
- 4.14
- 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: Incremental Reinforcement Learning With Prioritized Sweeping for Dynamic Environments. https://app.cochat.ai/papers/10.1109/tmech.2019.2899365
- The paper
- Wang, Z., Chen, C., Li, H.-X., Dong, D., & Tarn, T.-J. (2019). Incremental Reinforcement Learning With Prioritized Sweeping for Dynamic Environments. IEEE/ASME Transactions on Mechatronics. https://doi.org/10.1109/tmech.2019.2899365
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.