Abstract
This paper studies the formation control of high-order multi-agent systems, where the dynamics of agents are <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -order integrators. Different from existing results, this paper investigates the problem from the viewpoint of aggregative games. An interesting discovery is that the Nash equilibrium of a quadratic aggregative game constitutes the desired formation. Moreover, a distributed algorithm is designed for these high-order agents to form the desired formation by seeking the Nash equilibrium, where every agent estimates the aggregate of the game. Furthermore, the convergence of the algorithm is analyzed via Lyapunov stability theory. In contrast with existing formation protocols, the high-order agents with the proposed algorithm exponentially converge to the desired formation without using the (relative) positions and velocities of formation neighbors. Finally, two examples illustrate the algorithm.
Published Version
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 call