This study addresses a fixed-time generalized noncooperative game involving multiple autonomous aerial vehicles (AAVs) that encounter challenges such as discontinuous communication and external disturbances. Each AAV, motivated by self-interest, seeks to optimize its performance function by adjusting its actions within shared equality and inequality constraints. To facilitate this, a fixed-time generalized Nash equilibrium (GNE) seeking algorithm is proposed for games with shared equality constraints, incorporating an internal dynamic system to ensure compliance with these constraints. By employing penalty methods, an auxiliary performance function is developed to manage games with mixed constraints. Furthermore, an error decomposition method and a fixed-time observer are introduced to address the issues of discontinuous communication and external disturbances. The study establishes sufficient conditions for the convergence of the fixed-time GNE seeking algorithm and provides an explicit upper bound on the settling time based on Lyapunov stability theory. The effectiveness of the proposed algorithms is demonstrated through various simulation examples.
Optimizing Fixed-Time Generalized Nash Equilibrium Seeking in Multi-Autonomous Aerial Vehicle Games
IEEE Transactions on Aerospace and Electronic Systems ; 61 , 3 ; 6339-6353
01.06.2025
2156757 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Distributed Nash Equilibrium Seeking for Non-Cooperative Games with a Coupled Inequality Constraint
Springer Verlag | 2021
|Ε-Nash Equilibrium Seeking for Two Order Multi-agent with Disturbance Rejection
British Library Conference Proceedings | 2022
|The Robust Nash equilibrium and equilibrium selection in 2x2 coordination games
BASE | 2012
|Formation Control of Multiple UAVs Based on Distributed Nash Equilibrium Seeking Algorithm
Springer Verlag | 2025
|