.png){kind=icon}
.png){kind=icon}
Return
Value iteration and adaptive dynamic programming for data-driven adaptive optimal control design
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2016.05.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a novel non-model-based, data-driven adaptive optimal controller design for linear continuous-time systems with completely unknown dynamics. Inspired by the stochastic approximation theory, a continuous-time version of the traditional value iteration (VI) algorithm is presented with rigorous convergence analysis. This VI method is crucial for developing new adaptive dynamic programming methods to solve the adaptive optimal control problem and the stochastic robust optimal control problem for linear continuous-time systems. Fundamentally different from existing results, the a priori knowledge of an initial admissible control policy is no longer required. The efficacy of the proposed methodology is illustrated by two examples and a brief comparative study between VI and earlier policy iteration methods. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Value iteration
Adaptive dynamic programming
Optimal control
Adaptive control
Stochastic approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.