Wanjiku A. Makumi , Omkar Sudhir Patil , Warren E. Dixon
{"title":"基于lyapunov的深度系统自适应近似动态规划辨识","authors":"Wanjiku A. Makumi , Omkar Sudhir Patil , Warren E. Dixon","doi":"10.1016/j.automatica.2025.112462","DOIUrl":null,"url":null,"abstract":"<div><div>Recent developments in approximate dynamic programming (ADP) use deep neural network (DNN)-based system identifiers to solve the infinite horizon state regulation problem; however, the DNN weights do not continually adjust for all layers. In this paper, ADP is performed using a Lyapunov-based DNN (Lb-DNN) adaptive identifier that involves online weight updates. Provided the Jacobian of the Lb-DNN satisfies the persistence of excitation condition, the Lb-DNN weights exponentially converge to a residual approximation error, and the corresponding control policy converges to a neighborhood of the optimal policy. Simulation results show that the Lb-DNN yields 49.85% improved root mean squared (RMS) function approximation error in comparison to a baseline ADP DNN result and faster convergence of the RMS regulation error, RMS controller error, and RMS function approximation error.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"180 ","pages":"Article 112462"},"PeriodicalIF":4.8000,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lyapunov-based adaptive deep system identification for approximate dynamic programming\",\"authors\":\"Wanjiku A. Makumi , Omkar Sudhir Patil , Warren E. Dixon\",\"doi\":\"10.1016/j.automatica.2025.112462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recent developments in approximate dynamic programming (ADP) use deep neural network (DNN)-based system identifiers to solve the infinite horizon state regulation problem; however, the DNN weights do not continually adjust for all layers. In this paper, ADP is performed using a Lyapunov-based DNN (Lb-DNN) adaptive identifier that involves online weight updates. Provided the Jacobian of the Lb-DNN satisfies the persistence of excitation condition, the Lb-DNN weights exponentially converge to a residual approximation error, and the corresponding control policy converges to a neighborhood of the optimal policy. Simulation results show that the Lb-DNN yields 49.85% improved root mean squared (RMS) function approximation error in comparison to a baseline ADP DNN result and faster convergence of the RMS regulation error, RMS controller error, and RMS function approximation error.</div></div>\",\"PeriodicalId\":55413,\"journal\":{\"name\":\"Automatica\",\"volume\":\"180 \",\"pages\":\"Article 112462\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0005109825003565\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109825003565","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Lyapunov-based adaptive deep system identification for approximate dynamic programming
Recent developments in approximate dynamic programming (ADP) use deep neural network (DNN)-based system identifiers to solve the infinite horizon state regulation problem; however, the DNN weights do not continually adjust for all layers. In this paper, ADP is performed using a Lyapunov-based DNN (Lb-DNN) adaptive identifier that involves online weight updates. Provided the Jacobian of the Lb-DNN satisfies the persistence of excitation condition, the Lb-DNN weights exponentially converge to a residual approximation error, and the corresponding control policy converges to a neighborhood of the optimal policy. Simulation results show that the Lb-DNN yields 49.85% improved root mean squared (RMS) function approximation error in comparison to a baseline ADP DNN result and faster convergence of the RMS regulation error, RMS controller error, and RMS function approximation error.
期刊介绍:
Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field.
After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience.
Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.