Robust Nash equilibrium seeking based on semi-Markov switching topologies
For multi-agent systems requiring robust equilibrium seeking under switching communication topologies and disturbances, this work provides a novel algorithm with theoretical guarantees.
This paper proposes a robust Nash equilibrium seeking algorithm for second-order players with external disturbances and uncertain dynamics under semi-Markov switching topologies, achieving finite-time disturbance rejection and mean-square consensus. The algorithm is validated on a connectivity control game.
This paper investigates a distributed robust Nash Equilibrium (NE) seeking problem for second-order players subject to external disturbances and uncertain dynamics while communicating via semi-Markov switching topologies. To accommodate the above concerns, the following targets require to be reached simultaneously: (1) Disturbances and uncertain dynamics rejection in finite time; (2) NE seeking for the second-order players; (3) Distributed action estimation on non-neighboring players under semi-Markov switching. By combining supertwisting-based Integral Sliding-Mode Control (ISMC) with a leader-follower consensus protocol, a novel robust NE seeking algorithm is constructed. Furthermore, to lessen dispensable information transmission, a sampled-data-based event-triggered mechanism is introduced. Incorporating the advantages of both semi-Markov switching and event-triggered mechanism, another NE seeking algorithm is proposed. Theoretical analysis via a Lyapunov-Krasovskii functional proves the leader-follower consensus can be achieved in the mean-square sense. Finally, a connectivity control game is formulated to validate the algorithms.