Adaptive Dynamic Programming Infinite‐Horizon Optimal Tracking Control for Stochastic Linear Discrete‐Time Systems

ABSTRACT This paper investigates stochastic discrete‐time systems with multiplicative state‐dependent and input‐dependent noise via a novel adaptive dynamic programming(ADP) based control method combined with optimal stationary control techniques. Imposing a notably greater difficulty, the tracking control problem without the knowledge of system dynamics and the reference system has been generalized that the system dynamics do not have to be Hurwitz which is more practically relevant. An augmented system has been constructed while a discount factor has been introduced into the cost function. After the discount factor has been brought in to solve the stochastic algebraic Riccati equation(SARE), the linear quadratic tracking(LQT) problem has been proved to be well‐posed. Hence, we develop a second‐order moment formulation to solve the SARE. Based on stochastic adaptive control, a novel on‐policy ADP algorithm has been proposed to solve the LQT problem by only the state and input data. The convergence and stability of the novel ADP algorithm has been rigorously investigated and discussed. Finally, numerical simulations and practical experiments of two distinguished systems are performed to validate the effectiveness and practicability of the proposed ADP methodology.

Authors

Institutions

Publication Details

Journal
International Journal of Adaptive Control and Signal Processing
Published
2025-10-14
DOI
https://doi.org/10.1002/acs.4076
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Dynamic Programming Infinite‐Horizon Optimal Tracking Control for Stochastic Linear Discrete‐Time Systems

Yunjian Peng, Xuantong Liu, Kun Zhang
International Journal of Adaptive Control and Signal Processing
Adaptive Dynamic Programming Control
article

Adaptive Dynamic Programming Infinite‐Horizon Optimal Tracking Control for Stochastic Linear Discrete‐Time Systems

Yunjian Peng, Xuantong Liu, Kun Zhang
article en

Abstract

ABSTRACT This paper investigates stochastic discrete‐time systems with multiplicative state‐dependent and input‐dependent noise via a novel adaptive dynamic programming(ADP) based control method combined with optimal stationary control techniques. Imposing a notably greater difficulty, the tracking control problem without the knowledge of system dynamics and the reference system has been generalized that the system dynamics do not have to be Hurwitz which is more practically relevant. An augmented system has been constructed while a discount factor has been introduced into the cost function. After the discount factor has been brought in to solve the stochastic algebraic Riccati equation(SARE), the linear quadratic tracking(LQT) problem has been proved to be well‐posed. Hence, we develop a second‐order moment formulation to solve the SARE. Based on stochastic adaptive control, a novel on‐policy ADP algorithm has been proposed to solve the LQT problem by only the state and input data. The convergence and stability of the novel ADP algorithm has been rigorously investigated and discussed. Finally, numerical simulations and practical experiments of two distinguished systems are performed to validate the effectiveness and practicability of the proposed ADP methodology.

International Journal of Adaptive Control and Signal ProcessingVol. 40(1)
South China University of Technology (CN)
Openalex Percentile: Top 70%
Adaptive Dynamic Programming Control
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.