返回
Revisiting Approximate Dynamic Programming and its Convergence
DOI:10.1109/TCYB.2014.2314612.png)
摘要
En 中文
Value iteration-based approximate/adaptive dynamic programming (ADP) as an approximate solution to infinite-horizon optimal control problems with deterministic dynamics and continuous state and action spaces is investigated. The learning iterations are decomposed into an outer loop and an inner loop. A relatively simple proof for the convergence of the outer-loop iterations to the optimal solution is provided using a novel idea with some new features. It presents an analogy between the value function during the iterations and the value function of a fixed-final-time optimal control problem. The inner loop is utilized to avoid the need for solving a set of nonlinear equations or a nonlinear optimization problem numerically, at each iteration of ADP for the policy update. Sufficient conditions for the uniqueness of the solution to the policy update equation and for the convergence of the inner-loop iterations to the solution are obtained. Afterwards, the results are formed as a learning algorithm for training a neurocontroller or creating a look-up table to be used for optimal control of nonlinear systems with different initial conditions. Finally, some of the features of the investigated method are numerically analyzed.
Keyword:
Approximate dynamic programming
nonlinear control systems
optimal control
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Adaptive optimal control for continuous-time linear systems based on policy iteration基于策略迭代的连续时间线性系统自适应最优控制
AUTOMATICA
IF5.9
Optimal control of unknown nonaffine nonlinear discrete-time systems based on adaptive dynamic programming基于自适应动态规划的未知非仿射非线性离散系统最优控制
AUTOMATICA
IF5.9

