基于增强自适应策略迭代的不确定网络智能体强化学习最优二部队形跟踪

IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhai Peiyu, Qin Kaiyu, Yue Jiangfeng, Lin Boxian, Li Weihao, Shi Mengji
{"title":"基于增强自适应策略迭代的不确定网络智能体强化学习最优二部队形跟踪","authors":"Zhai Peiyu,&nbsp;Qin Kaiyu,&nbsp;Yue Jiangfeng,&nbsp;Lin Boxian,&nbsp;Li Weihao,&nbsp;Shi Mengji","doi":"10.1007/s10489-025-06913-4","DOIUrl":null,"url":null,"abstract":"<div><p>Optimal bipartite formation tracking of uncertain networked agent systems (NASs) is a hotspot with extensive applications in many fields, and there is an urgent demand for strategies that optimize system performance while ensuring efficiency and stability. With this in mind, this paper proposes a reinforcement learning-based optimal control scheme using an Enhanced Adaptive Policy Iteration (EAPI) algorithm with an adaptive termination mechanism. This scheme enables follower agents to achieve bipartite formation tracking of the leader while optimizing the performance index. Firstly, the definition of the optimal bipartite formation tracking control problem is presented, and the Bellman form of the optimal value function and control law is derived based on the coupled Hamilton-Jacobi-Bellman (HJB) equations. Then, an EAPI algorithm with an adaptive termination mechanism is introduced, which could avoid repeated iterations by setting a termination threshold, thus reducing the computational cost and decreasing the running time without reducing the control performance. Furthermore, the stability, convergence, and optimality of EAPI algorithm are analyzed. Moreover, the optimal control law is approximated and solved through the reinforcement learning framework. Finally, numerical results are conducted to verify the effectiveness of the proposed EAPI-based optimal bipartite formation tracking scheme for NASs.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 15","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reinforcement learning-based optimal bipartite formation tracking for uncertain networked agents via enhanced adaptive policy iteration\",\"authors\":\"Zhai Peiyu,&nbsp;Qin Kaiyu,&nbsp;Yue Jiangfeng,&nbsp;Lin Boxian,&nbsp;Li Weihao,&nbsp;Shi Mengji\",\"doi\":\"10.1007/s10489-025-06913-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Optimal bipartite formation tracking of uncertain networked agent systems (NASs) is a hotspot with extensive applications in many fields, and there is an urgent demand for strategies that optimize system performance while ensuring efficiency and stability. With this in mind, this paper proposes a reinforcement learning-based optimal control scheme using an Enhanced Adaptive Policy Iteration (EAPI) algorithm with an adaptive termination mechanism. This scheme enables follower agents to achieve bipartite formation tracking of the leader while optimizing the performance index. Firstly, the definition of the optimal bipartite formation tracking control problem is presented, and the Bellman form of the optimal value function and control law is derived based on the coupled Hamilton-Jacobi-Bellman (HJB) equations. Then, an EAPI algorithm with an adaptive termination mechanism is introduced, which could avoid repeated iterations by setting a termination threshold, thus reducing the computational cost and decreasing the running time without reducing the control performance. Furthermore, the stability, convergence, and optimality of EAPI algorithm are analyzed. Moreover, the optimal control law is approximated and solved through the reinforcement learning framework. Finally, numerical results are conducted to verify the effectiveness of the proposed EAPI-based optimal bipartite formation tracking scheme for NASs.</p></div>\",\"PeriodicalId\":8041,\"journal\":{\"name\":\"Applied Intelligence\",\"volume\":\"55 15\",\"pages\":\"\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2025-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10489-025-06913-4\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06913-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

不确定网络智能体系统(NASs)的最优二部队形跟踪是一个在许多领域都有广泛应用的热点问题,迫切需要在保证效率和稳定性的同时优化系统性能的策略。考虑到这一点,本文提出了一种基于强化学习的最优控制方案,该方案使用带有自适应终止机制的增强自适应策略迭代(EAPI)算法。该方案使follower agent在优化性能指标的同时,能够实现对leader的二部队形跟踪。首先,给出了最优二部队形跟踪控制问题的定义,并基于Hamilton-Jacobi-Bellman (HJB)耦合方程导出了最优值函数和控制律的Bellman形式。然后,引入了一种具有自适应终止机制的EAPI算法,该算法通过设置终止阈值来避免重复迭代,从而在不降低控制性能的前提下减少了计算成本和运行时间。进一步分析了EAPI算法的稳定性、收敛性和最优性。通过强化学习框架对最优控制律进行逼近和求解。最后,通过数值实验验证了所提出的基于eapi的NASs最优二部队形跟踪方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reinforcement learning-based optimal bipartite formation tracking for uncertain networked agents via enhanced adaptive policy iteration

Optimal bipartite formation tracking of uncertain networked agent systems (NASs) is a hotspot with extensive applications in many fields, and there is an urgent demand for strategies that optimize system performance while ensuring efficiency and stability. With this in mind, this paper proposes a reinforcement learning-based optimal control scheme using an Enhanced Adaptive Policy Iteration (EAPI) algorithm with an adaptive termination mechanism. This scheme enables follower agents to achieve bipartite formation tracking of the leader while optimizing the performance index. Firstly, the definition of the optimal bipartite formation tracking control problem is presented, and the Bellman form of the optimal value function and control law is derived based on the coupled Hamilton-Jacobi-Bellman (HJB) equations. Then, an EAPI algorithm with an adaptive termination mechanism is introduced, which could avoid repeated iterations by setting a termination threshold, thus reducing the computational cost and decreasing the running time without reducing the control performance. Furthermore, the stability, convergence, and optimality of EAPI algorithm are analyzed. Moreover, the optimal control law is approximated and solved through the reinforcement learning framework. Finally, numerical results are conducted to verify the effectiveness of the proposed EAPI-based optimal bipartite formation tracking scheme for NASs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信