Coalitional Zero-Sum Games for ${H_{\infty}}$ Leader-Following Consensus Control
Yunxiao Ren, Dingguo Liang, Yuezu Lv, Zhisheng Duan

TL;DR
This paper develops a game-theoretic approach for robust leader-following consensus in multi-agent systems under adversarial attacks, using decentralized algorithms to solve complex Riccati equations.
Contribution
It introduces a novel coalitional zero-sum game framework for $H_$ control, with decentralized methods for high-dimensional Riccati equations.
Findings
The proposed algorithms effectively achieve robust consensus under attacks.
Decentralized computation reduces complexity of high-dimensional Riccati equations.
Numerical simulations validate the control strategy's robustness and effectiveness.
Abstract
This paper investigates the leader-following consensus problem for a class of multi-agent systems subject to adversarial attack-like external inputs. To address this, we formulate the robust leader-following control problem as a global coalitional min-max zero-sum game using differential game theory. Specifically, the agents' control inputs form a coalition to minimize a global cost function, while the attacks form an opposing coalition to maximize it. Notably, when these external adversarial attacks manifest as disturbances, the designed game-theoretic control policy systematically yields a robust control law. Addressing this problem inherently requires solving a high-dimensional generalized algebraic Riccati equation (GARE), which poses significant challenges for distributed computation and controller implementation. To overcome these challenges, we propose a two-fold…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
