基于自适应动态规划的非线性系统离散时间最优零和对策

Qinglai Wei, Ruizhuo Song, Yancai Xu, Derong Liu, Qiao Lin
{"title":"基于自适应动态规划的非线性系统离散时间最优零和对策","authors":"Qinglai Wei, Ruizhuo Song, Yancai Xu, Derong Liu, Qiao Lin","doi":"10.1109/DDCLS.2017.8068097","DOIUrl":null,"url":null,"abstract":"In this paper, a novel discrete-time iterative zero-sum adaptive dynamic programming (ADP) algorithm is developed for solving the optimal control problems of nonlinear systems. Two iteration processes, which are lower and upper iterations, are employed to solve the lower and upper value functions, respectively. Arbitrary positive semi-definite functions are acceptable to initialize the upper and lower iterations of the iterative zero-sum ADP algorithm. It is proven that the upper and lower value functions converge to the optimal performance index function if the optimal performance index function exists, where the existence criterion of the optimal performance index function is unnecessary. Simulation examples are given to illustrate the effective performance of the present method.","PeriodicalId":419114,"journal":{"name":"2017 6th Data Driven Control and Learning Systems (DDCLS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Discrete-time optimal zero-sum games for nonlinear systems via adaptive dynamic programming\",\"authors\":\"Qinglai Wei, Ruizhuo Song, Yancai Xu, Derong Liu, Qiao Lin\",\"doi\":\"10.1109/DDCLS.2017.8068097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel discrete-time iterative zero-sum adaptive dynamic programming (ADP) algorithm is developed for solving the optimal control problems of nonlinear systems. Two iteration processes, which are lower and upper iterations, are employed to solve the lower and upper value functions, respectively. Arbitrary positive semi-definite functions are acceptable to initialize the upper and lower iterations of the iterative zero-sum ADP algorithm. It is proven that the upper and lower value functions converge to the optimal performance index function if the optimal performance index function exists, where the existence criterion of the optimal performance index function is unnecessary. Simulation examples are given to illustrate the effective performance of the present method.\",\"PeriodicalId\":419114,\"journal\":{\"name\":\"2017 6th Data Driven Control and Learning Systems (DDCLS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 6th Data Driven Control and Learning Systems (DDCLS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DDCLS.2017.8068097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th Data Driven Control and Learning Systems (DDCLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DDCLS.2017.8068097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对非线性系统的最优控制问题,提出了一种新的离散迭代零和自适应动态规划(ADP)算法。采用下迭代和上迭代两个迭代过程分别求解下值函数和上值函数。迭代零和ADP算法的上下迭代初始化可接受任意正半定函数。证明了当最优性能指标函数存在时,上下值函数收敛于最优性能指标函数,且不需要最优性能指标函数的存在准则。仿真算例说明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Discrete-time optimal zero-sum games for nonlinear systems via adaptive dynamic programming
In this paper, a novel discrete-time iterative zero-sum adaptive dynamic programming (ADP) algorithm is developed for solving the optimal control problems of nonlinear systems. Two iteration processes, which are lower and upper iterations, are employed to solve the lower and upper value functions, respectively. Arbitrary positive semi-definite functions are acceptable to initialize the upper and lower iterations of the iterative zero-sum ADP algorithm. It is proven that the upper and lower value functions converge to the optimal performance index function if the optimal performance index function exists, where the existence criterion of the optimal performance index function is unnecessary. Simulation examples are given to illustrate the effective performance of the present method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信