Extended mean field game theoretical optimal distributed control for large scale multi-agent systems: An efficiency-complexity tradeoff

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shawon Dey, Hao Xu
{"title":"Extended mean field game theoretical optimal distributed control for large scale multi-agent systems: An efficiency-complexity tradeoff","authors":"Shawon Dey,&nbsp;Hao Xu","doi":"10.1016/j.ins.2025.122432","DOIUrl":null,"url":null,"abstract":"<div><div>This paper investigates the tradeoff between optimal efficiency and computational complexity in the emerging mean-field game (MFG) theory and further develops a novel reconfigurable decomposition approach that can balance the efficiency-complexity of MFG theoretical optimal distributed control for large-scale multi-agent systems (LS-MAS). Generally, the MFG has the potential to overcome the “Curse of Dimensionality” in LS-MAS control by simplifying all agents' interactions into ones between individual agents and the collective average effects captured by the group's probability density function (PDF). However, the social cost associated with MFG Nash equilibria is generally inefficient compared to the centralized optimal cost associated with the McKean-Vlasov control problem. To enhance the efficiency of MFG theoretical control without significantly increasing complexity, a novel extended MFG (EMFG) is developed to efficiently balance the MFG efficiency and computational complexity through a decomposed mean field PDF term. Specifically, LS-MAS is divided into multiple groups based on desired terminal PDF constraints. Then, an actor-critic-decomposed mass (ACDM) algorithm is developed to attain the optimal control for LS-MAS by solving the coupled MFG forward-backward partial differential equation (PDE) system. While the PDF decomposition expands the neural network structure, it escalates computational complexity. However, the developed algorithm evaluates and balances LS-MAS optimal control efficiency and complexity. In addition, an induction-based proof is provided to demonstrate the reduction of the inefficiency bound between the optimal cost associated with McKean-Vlasov control and the social cost associated with the extended MFG equilibrium. After that, the Lyapunov stability analysis is presented to illustrate the convergence of the ACDM algorithm. Eventually, numerical simulations are provided to validate the proposed approach.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"719 ","pages":"Article 122432"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002002552500564X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates the tradeoff between optimal efficiency and computational complexity in the emerging mean-field game (MFG) theory and further develops a novel reconfigurable decomposition approach that can balance the efficiency-complexity of MFG theoretical optimal distributed control for large-scale multi-agent systems (LS-MAS). Generally, the MFG has the potential to overcome the “Curse of Dimensionality” in LS-MAS control by simplifying all agents' interactions into ones between individual agents and the collective average effects captured by the group's probability density function (PDF). However, the social cost associated with MFG Nash equilibria is generally inefficient compared to the centralized optimal cost associated with the McKean-Vlasov control problem. To enhance the efficiency of MFG theoretical control without significantly increasing complexity, a novel extended MFG (EMFG) is developed to efficiently balance the MFG efficiency and computational complexity through a decomposed mean field PDF term. Specifically, LS-MAS is divided into multiple groups based on desired terminal PDF constraints. Then, an actor-critic-decomposed mass (ACDM) algorithm is developed to attain the optimal control for LS-MAS by solving the coupled MFG forward-backward partial differential equation (PDE) system. While the PDF decomposition expands the neural network structure, it escalates computational complexity. However, the developed algorithm evaluates and balances LS-MAS optimal control efficiency and complexity. In addition, an induction-based proof is provided to demonstrate the reduction of the inefficiency bound between the optimal cost associated with McKean-Vlasov control and the social cost associated with the extended MFG equilibrium. After that, the Lyapunov stability analysis is presented to illustrate the convergence of the ACDM algorithm. Eventually, numerical simulations are provided to validate the proposed approach.
大规模多智能体系统的扩展平均场博弈理论最优分布式控制:效率-复杂性权衡
本文研究了新兴的平均场博弈(MFG)理论中最优效率和计算复杂性之间的权衡,并进一步开发了一种新的可重构分解方法,该方法可以平衡大规模多智能体系统(LS-MAS)的MFG理论最优分布式控制的效率-复杂性。一般来说,MFG有潜力克服LS-MAS控制中的“维度诅咒”,它将所有代理的相互作用简化为个体代理之间的相互作用和由群体概率密度函数捕获的集体平均效应(PDF)。然而,与McKean-Vlasov控制问题相关的集中最优成本相比,与MFG纳什均衡相关的社会成本通常是低效的。为了提高MFG理论控制的效率而不显著增加复杂性,提出了一种新的扩展MFG (EMFG),通过分解平均场PDF项来有效地平衡MFG的效率和计算复杂度。具体而言,LS-MAS根据所需的终端PDF约束分为多个组。然后,通过求解耦合MFG正反向偏微分方程(PDE)系统,提出了一种actor- critical - decomposition mass (ACDM)算法来实现LS-MAS的最优控制。PDF分解在扩展神经网络结构的同时,也增加了计算复杂度。然而,所开发的算法对LS-MAS最优控制效率和复杂度进行了评估和平衡。此外,还提供了一个基于归纳法的证明,以证明与McKean-Vlasov控制相关的最优成本与与扩展MFG均衡相关的社会成本之间的无效率界限的减小。然后,通过Lyapunov稳定性分析来说明ACDM算法的收敛性。最后,通过数值仿真验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信