Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

Automatica Pub Date : 2024-09-27 DOI:10.1016/j.automatica.2024.111925

Dong Wang, Jiaxun Liu, Jie Lian, Wei Wang

{"title":"Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs","authors":"Dong Wang, Jiaxun Liu, Jie Lian, Wei Wang","doi":"10.1016/j.automatica.2024.111925","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies the design of accelerated distributed algorithms for seeking the Nash Equilibrium (NE) of multiple cluster games over time-varying unbalanced digraphs, where players in the same cluster cooperatively minimize the summation of the local cost function and do not concern the interest of other clusters. In this game, the players have limited access to others’ decisions, while they can communicate with others over the inter-cluster and intra-cluster topologies. Accelerated distributed algorithms are proposed based on the decision estimation, Nesterov acceleration, and pseudo gradient estimation to seek the NE of multiple cluster games. We prove that the proposed algorithm linearly converges to the NE using the multistep contraction and linear systems of inequalities. Moreover, three variants of the proposed algorithm are also given for dealing with cases where only partial communication topologies are time-varying and gossip-type. Lastly, the effectiveness of proposed algorithms and the acceleration effect are verified by solving the intrusion–interception confrontation problem of Unmanned Vehicle (UV) swarms in simulations.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111925"},"PeriodicalIF":4.8000,"publicationDate":"2024-09-27","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/S0005109824004199","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

This paper studies the design of accelerated distributed algorithms for seeking the Nash Equilibrium (NE) of multiple cluster games over time-varying unbalanced digraphs, where players in the same cluster cooperatively minimize the summation of the local cost function and do not concern the interest of other clusters. In this game, the players have limited access to others’ decisions, while they can communicate with others over the inter-cluster and intra-cluster topologies. Accelerated distributed algorithms are proposed based on the decision estimation, Nesterov acceleration, and pseudo gradient estimation to seek the NE of multiple cluster games. We prove that the proposed algorithm linearly converges to the NE using the multistep contraction and linear systems of inequalities. Moreover, three variants of the proposed algorithm are also given for dealing with cases where only partial communication topologies are time-varying and gossip-type. Lastly, the effectiveness of proposed algorithms and the acceleration effect are verified by solving the intrusion–interception confrontation problem of Unmanned Vehicle (UV) swarms in simulations.

查看原文本刊更多论文

基于梯度跟踪的分布式内斯特罗夫加速算法，用于时变不平衡数字图上的多群组博弈

本文研究了在时变不平衡数字图上寻求多集群博弈纳什均衡（NE）的加速分布式算法设计，在这种博弈中，同一集群中的博弈者合作最小化局部成本函数的求和，而不关心其他集群的利益。在这种博弈中，博弈者对他人决策的了解有限，但他们可以通过簇间拓扑和簇内拓扑与他人交流。我们提出了基于决策估计、涅斯捷罗夫加速和伪梯度估计的加速分布式算法来寻求多簇博弈的近边界。我们利用多步收缩和线性不等式系统证明了所提算法可线性收敛到近边界。此外，我们还给出了所提算法的三种变体，用于处理只有部分通信拓扑是时变的和流言型的情况。最后，通过模拟解决无人飞行器（UV）群的入侵-拦截对抗问题，验证了所提算法的有效性和加速效果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Automatica 工程技术-工程：电子与电气

CiteScore

10.70

自引率

7.80%

发文量

617

审稿时长

5 months

期刊介绍： 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.