paper-with-me

Papers

Distributed Nash Equilibrium Seeking in Coalition Games for Uncertain Euler-Lagrange Systems With Application to USV Swarm Confrontation

2025-04-06 · Cheng Yuwen, Guanghui Wen, Jialing Zhou, Meng Luan, TingWen Huang

In this paper, a coalition game with local and coupling constraints is studied for uncertain Euler-Lagrange (EL) systems subject to disturbances with unknown bounds. In the coalition game, each agent collaborates with other agents within the same coalition to optimize its coalition's cost function while simultaneously competing against agents in other coalitions. Under a distributed framework where each agent has access only to its own action, cost function, and constraint parameters, a distributed strategy is proposed to seek the Nash equilibrium (NE). By combining adaptive methods and sign functions, model uncertainties and disturbances with unknown bounds in the EL system are compensated and suppressed, respectively. Furthermore, an integration of adaptive methods and consensus protocols is employed to update the Lagrange multipliers of both local and coupling constraints. A dynamic average consensus is employed to estimate the gradient of coalition function, while the leader-following protocol is adopted to estimate the actions of other agents. By leveraging Lyapunov theory, the NE is proven to be asymptotically stable. Moreover, an unmanned surface vehicle swarm confrontation is meticulously modeled and analyzed in the coalition game framework. A diverse array of tasks, including formation, encirclement, and interception, are systematically formulated. A numerical example demonstrates the effectiveness of the proposed algorithm.

📄 PDF Abstract BibTeX arXiv:2504.04475

Code (1)

Sapagens/IS 공식 구현

Similar Papers 제목 키워드 기반

Distributed Nash Equilibrium Seeking for Noncooperative Games of High-Order Nonlinear Multi-Agent Systems Over Weight-Unbalanced Digraphs

2021-12-16 · Zhenhua Deng, Jin Luo

In this paper, we investigate the noncooperative games of multi-agent systems. Different from existing noncooperative games, our formulation involves the high-order nonlinear dynamics of players, and the communication to…

Distributed Nash Equilibrium Seeking Algorithm in Aggregative Games for Heterogeneous Multi-Robot Systems

2025-09-19 · Yi Dong, Zhongguo Li, Sarvapali D. Ramchurn, Xiaowei Huang arxiv

This paper develops a distributed Nash Equilibrium seeking algorithm for heterogeneous multi-robot systems. The algorithm utilises distributed optimisation and output control to achieve the Nash equilibrium by leveraging…

Tracking-based distributed equilibrium seeking for aggregative games

2022-10-26 · Guido Carnevale, Filippo Fabiani, Filiberto Fele, Kostas Margellos 외

We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent…

Distributed Nash Equilibrium Seeking Algorithm Design for Multi-Cluster Games with High-Order Players

2021-06-25 · Zhenhua Deng, Yangyang Liu

In this paper, a multi-cluster game with high-order players is investigated. Different from the well-known multi-cluster games, the dynamics of players are taken into account in our problem. Due to the high-order dynamic…

Implementations of Cooperative Games Under Non-Cooperative Solution Concepts

2024-02-22 · Justin Chan

Cooperative games can be distinguished as non-cooperative games in which players can freely sign binding agreements to form coalitions. These coalitions inherit a joint strategy set and seek to maximize collective payoff…

AllForm