Nash Equilibrium Strategies for Multicluster Pursuit–Evasion Game With Disturbances: A Prescribed-Time Convergence Approach
- 1 January 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (9) , 1-11
Abstract
This article investigates the problem of prescribed-time Nash equilibrium (NE) seeking for a multicluster pursuit-evasion game (PEG) subject to external disturbances. To mitigate the impact of disturbances and reach the NE within a user-defined prescribed time, a prescribed-time disturbance observer (PTDO) is devised to estimate and compensate for them. Based on this observation, a novel control algorithm is developed, which facilitates collaboration among multiple pursuers to capture multiple evaders within the prescribed time. It is theoretically demonstrated that the designed algorithm ensures prescribed-time convergence to the NE of the multicluster PEG with disturbances. Finally, numerical simulations are conducted to verify the effectiveness of the algorithm under different initial conditions, further demonstrating the flexibility of the user-specified convergence time.Keywords
Funding Information
- Natural Science Foundation of Jiangsu Province (BK20231417)
- National Natural Science Foundation of China (62273094)
- National Natural Science Foundation of China (62573118)
This publication has 42 references indexed in Scilit:
- Stabilization of complex networks under asynchronously intermittent event-triggered controlAutomatica, 2024
- On inherent limitations in robustness and performance for a class of prescribed-time algorithmsAutomatica, 2023
- Prescribed-time distributed Nash equilibrium seeking for noncooperation gamesAutomatica, 2023
- Dynamic generalized Nash equilibrium seeking for
N
-coalition noncooperative gamesAutomatica, 2022
- Nash equilibrium seeking in -coalition games via a gradient-free methodAutomatica, 2022
- Finite-time stability and stabilization for time-varying systemsChaos, Solitons & Fractals, 2021
- Nash equilibrium seeking for -coalition noncooperative gamesAutomatica, 2018
- Multi-player pursuit–evasion games with one superior evaderAutomatica, 2016
- Distributed Coordination of Multi-agent Networks2011
- Generalized Nash Equilibrium ProblemsAnnals of Operations Research, 2009