Abstract
AbstractA class of aggregative games with coupled constraints is considered in this paper. The problem of seeking generalized Nash equilibrium (GNE) for the game with double‐integrator multi‐agent systems on weight‐balanced directed graphs is studied. To remove the convergence conditions related to the Laplacian matrix of the communication graph, adaptive parameters are introduced in the designed seeking algorithm. Moreover,an event‐triggered broadcasting scheme is designed to reduce communication loads when agents execute the seeking algorithm. It is shown that the designed algorithm can globally asymptotically converge to the GNE of the game and the proposed event‐triggered scheme is free of the Zeno behavior. A numerical example is illustrated to validate the proposed methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
