A Game-Theoretical Approach for a Finite-Time Consensus of Second-Order Multi-Agent System
The second-order consensus problem depends on not only the topology condition but also the coupling strength of the relative positions and velocities between neighboring agents. This paper seeks to solve the finite-time consensus problem of second-order multi-agent systems by games with special structures. Potential game and weakly acyclic game were applied for modeling the second-order consensus problem with different topologies. Furthermore, this paper introduces the event-triggered asynchronous cellular learning automata algorithm for optimizing the decision making process of the agents, which facilitates a convergence with the Nash equilibrium. Finally, numerical examples illustrate the effectiveness of the models.
L. Xue et al., "A Game-Theoretical Approach for a Finite-Time Consensus of Second-Order Multi-Agent System," International Journal of Control, Automation and Systems, vol. 17, no. 5, pp. 1071 - 1083, Institute of Control, Robotics and Systems (ICROS), May 2019.
The definitive version is available at https://doi.org/10.1007/s12555-017-0716-8
Electrical and Computer Engineering
Center for High Performance Computing Research
Keywords and Phrases
Event-Triggered Asynchronous Cellular Learning Automata; Finite-Time Second-Order Consensus; Graphical Games; Multi-Agent System; Potential Game; Weakly Acyclic Game
International Standard Serial Number (ISSN)
Article - Journal
© 2019 Institute of Control, Robotics and Systems (ICROS), All rights reserved.
01 May 2019