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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Adaptive Optimal Control Algorithm Based on Weighted Policy Iteration

Qiang Ling, Rui Luo, Zhinan Peng, Wanlin Tan
1 citations
IEEE Transactions on Neural Networks and Learning Systems
Advanced Algorithms and Applications
1.21
article

Online Adaptive Optimal Control Algorithm Based on Weighted Policy Iteration

Qiang Ling, Rui Luo, Zhinan Peng, Wanlin Tan
article en
1 citations

Abstract

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.

IEEE Transactions on Neural Networks and Learning SystemsVol. 36(9)
University of Science and Technology of China (CN), University of Electronic Science and Technology of China (CN), Chengdu University (CN)
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
Openalex Percentile: Top 22%
Advanced Algorithms and Applications
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.