arrow
返回

Finite-Approximation-Error-Based Optimal Control Approach for Discrete-Time Nonlinear Systems

delete2013-04-01
delete264
delete
OA
AI
D
Derong Liu *
Q
Qinglai Wei
DOI:10.1109/TSMCB.2012.2216523delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that makes the iterative performance index function reach the optimum. When the iterative control law and the iterative performance index function in each iteration cannot be accurately obtained, the convergence conditions of the iterative ADP algorithm are obtained. When convergence conditions are satisfied, it is shown that the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some mild assumptions. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
Keyword:
Adaptive dynamic programming (ADP)
approximate dynamic programming
finite approximation errors
neural networks
optimal control
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
引用论文

引用论文

Relaxing dynamic programming
err2006-08-01
err260
PREAI
errLincoln, Bo; Rantzer, Anders
err分享
err收藏
err分享
err收藏
学者 查看更多内容