Distributed Nash equilibrium solution for multi-agent game in adversarial environment: A reinforcement learning method
This paper investigates the leader–follower optimal consensus problem for linear multi-agent systems with adversarial inputs from a differential graphical game perspective. For the multi-agent optimal control problem described by differential graphical game, it is equally significant that the control policy is distributed and adheres to Nash equilibrium solution . However, achieving both distributed control and Nash equilibrium simultaneously has proven impossible in most existing game formulations. This paper proposes a new game formulation that can overcome this limitation, enabling each agent to reach a Nash equilibrium under a distributed policy, thereby improving system performance . Furthermore, a partially model-free reinforcement learning method is employed to obtain the optimal policy when the dynamic information is partially unknown, with admissibility condition of the initial policy further relaxed. Finally, two comparative simulations are presented to demonstrate the validity and superiority of the proposed approach.
Authors
- Meng Wang (ORCID: https://orcid.org/0000-0002-5040-5116)
- Kaitian Chen (ORCID: https://orcid.org/0000-0001-9085-7486)
- Huaicheng Yan (ORCID: https://orcid.org/0000-0001-5496-1809)
- Zhichen Li (ORCID: https://orcid.org/0000-0003-3869-643X)
- Qiwei Liu (ORCID: https://orcid.org/0009-0005-9049-5864)
Publication Details
- Journal
- Automatica
- Published
- 2025-05-15
- DOI
- https://doi.org/10.1016/j.automatica.2025.112342
- Citations
- 5
- Primary Topic
- Adaptive Dynamic Programming Control
- Type
- article
- Field-Weighted Citation Impact
- 7.52