.png){kind=icon}
返回
Invariant Adaptive Dynamic Programming for Discrete-Time Optimal Control
.png){kind=icon}
OA
AI
DOI：10.1109/TSMC.2019.2911900.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For systems that can only be locally stabilized, control laws and their effective regions are both important. In this paper, invariant policy iteration is proposed to solve the optimal control of discrete-time systems. At each iteration, a given policy is evaluated in its invariantly admissible region, and a new policy and a new region are updated for the next iteration. Theoretical analysis shows the method is regionally convergent to the optimal value and the optimal policy. Combined with sum-of-squares polynomials, the method is able to achieve the near-optimal control of a class of discrete-time systems. An invariant adaptive dynamic programming algorithm is developed to extend the method to scenarios where system dynamics is not available. Online data are utilized to learn the near-optimal policy and the invariantly admissible region. Simulated experiments verify the effectiveness of our method.
Keyword:
Optimal control
Discrete-time systems
Heuristic algorithms
Dynamic programming
Convergence
Artificial intelligence
Nonlinear systems
Adaptive dynamic programming
discrete-time systems
invariant admissibility
optimal control
policy iteration
sum of squares
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Policy Iteration for H∞ Optimal Control of Polynomial Nonlinear Systems via Sum of Squares Programming基于平方和规划的多项式非线性系统h ∞ 最优控制的策略迭代
PREAI
分享收藏Convergence Proof of Approximate Policy Iteration for Undiscounted Optimal Control of Discrete-Time Systems离散时间系统无折扣最优控制近似策略迭代的收敛性证明
PREAI
分享收藏Reinforcement Learning and Adaptive Dynamic Programming for Feedback Control用于反馈控制的强化学习和自适应动态规划
PREAI
分享收藏
查看更多内容