Online Adaptive Optimal Control Algorithm Based on Weighted Policy Iteration
In this article, we propose a novel online learning algorithm based on weighted policy iteration (WPI) for addressing optimal control problems of nonlinear systems. WPI is proposed to deal with the influence of the neural network (NN) approximation error on the admissibility of the improved control policy. It is shown that the new iterative method can converge to the optimal solution uniformly. Utilizing NN approximation and experience replaying techniques, a WPI-based online learning algorithm is proposed. The new online algorithm distinguishes from previously known ones in that there can be fewer neurons in the hidden layer, giving rise to significant computational improvement. The assumption that the number of neurons needs to be sufficiently large can be dropped. Besides, instead of a standard persistently excited (PE) condition, only a relaxed PE condition is needed, which is also easier to check. Finally, numerical experiments are conducted to verify the effectiveness of our method.
Authors
- Qiang Ling (ORCID: https://orcid.org/0000-0001-5688-4130)
- Rui Luo (ORCID: https://orcid.org/0000-0002-3571-7461)
- Zhinan Peng (ORCID: https://orcid.org/0000-0003-2239-4920)
- Wanlin Tan
Institutions
- University of Science and Technology of China (CN)
- University of Electronic Science and Technology of China (CN)
- Chengdu University (CN)
Publication Details
- Journal
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/tnnls.2025.3564329
- Citations
- 1
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 1.21
Funders
- National Natural Science Foundation of China
- China Postdoctoral Science Foundation
- Open Fund of Key Laboratory of Sediment Research
- Fundamental Research Funds for the Central Universities