{"title":"基于政策迭代的未知动态合作线性二次微分博弈","authors":"Jingbo Zhao, Zihao Zhao, Haiyi Yang, Chenchen Peng","doi":"10.1016/j.jfranklin.2024.107301","DOIUrl":null,"url":null,"abstract":"<div><div>This article investigates the Pareto optimality of infinite horizon cooperative linear quadratic (LQ) differential games by policy iteration technique where the system dynamics are partially or completely unknown. Firstly, the policy iteration algorithm for the approximate solutions of the corresponding algebraic Riccati equation (ARE) without any prior knowledge of the matrix parameters of the dynamic system is derived by collecting the input and state information of each player. Secondly, when the presented specific rank condition is satisfied, the convergence of the proposed algorithm is rigorously demonstrated by recursion. Moreover, the weighting approach is employed to obtain the Pareto optimal strategy and the Pareto optimal solutions on the basis of the convex optimization theory. Finally, simulation results are reported to verify the feasibility and correctness of the proposed theoretical results.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"361 18","pages":"Article 107301"},"PeriodicalIF":3.7000,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Policy iteration based cooperative linear quadratic differential games with unknown dynamics\",\"authors\":\"Jingbo Zhao, Zihao Zhao, Haiyi Yang, Chenchen Peng\",\"doi\":\"10.1016/j.jfranklin.2024.107301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This article investigates the Pareto optimality of infinite horizon cooperative linear quadratic (LQ) differential games by policy iteration technique where the system dynamics are partially or completely unknown. Firstly, the policy iteration algorithm for the approximate solutions of the corresponding algebraic Riccati equation (ARE) without any prior knowledge of the matrix parameters of the dynamic system is derived by collecting the input and state information of each player. Secondly, when the presented specific rank condition is satisfied, the convergence of the proposed algorithm is rigorously demonstrated by recursion. Moreover, the weighting approach is employed to obtain the Pareto optimal strategy and the Pareto optimal solutions on the basis of the convex optimization theory. Finally, simulation results are reported to verify the feasibility and correctness of the proposed theoretical results.</div></div>\",\"PeriodicalId\":17283,\"journal\":{\"name\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"volume\":\"361 18\",\"pages\":\"Article 107301\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0016003224007221\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Franklin Institute-engineering and Applied Mathematics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0016003224007221","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Policy iteration based cooperative linear quadratic differential games with unknown dynamics
This article investigates the Pareto optimality of infinite horizon cooperative linear quadratic (LQ) differential games by policy iteration technique where the system dynamics are partially or completely unknown. Firstly, the policy iteration algorithm for the approximate solutions of the corresponding algebraic Riccati equation (ARE) without any prior knowledge of the matrix parameters of the dynamic system is derived by collecting the input and state information of each player. Secondly, when the presented specific rank condition is satisfied, the convergence of the proposed algorithm is rigorously demonstrated by recursion. Moreover, the weighting approach is employed to obtain the Pareto optimal strategy and the Pareto optimal solutions on the basis of the convex optimization theory. Finally, simulation results are reported to verify the feasibility and correctness of the proposed theoretical results.
期刊介绍:
The Journal of The Franklin Institute has an established reputation for publishing high-quality papers in the field of engineering and applied mathematics. Its current focus is on control systems, complex networks and dynamic systems, signal processing and communications and their applications. All submitted papers are peer-reviewed. The Journal will publish original research papers and research review papers of substance. Papers and special focus issues are judged upon possible lasting value, which has been and continues to be the strength of the Journal of The Franklin Institute.