Dynamic Formation Control of Multi-Agent Systems Using Rigid Graphs

Author(s):  
Xiaoyu Cai ◽  
Marcio de Queiroz

In this paper, we consider the problem of formation control of multi-agent systems where the desired formation is dynamic. This is motivated by applications, such as obstacle avoidance, where the formation size and/or geometric shape needs to vary in time. Using a single-integrator model and rigid graph theory, we propose a new control law that exponentially stabilizes the origin of the nonlinear, inter-agent distance error dynamics and ensures tracking of the desired formation. The extension to the formation maneuvering problem is also discussed. Simulation results for a five-agent formation demonstrate the control in action.

Author(s):  
Pengpeng Zhang ◽  
Marcio de Queiroz ◽  
Xiaoyu Cai

In this paper, we consider the problem of formation control of multi-agent systems in three-dimensional (3D) space, where the desired formation is dynamic. This is motivated by applications where the formation size and/or geometric shape needs to vary in time. Using a single-integrator model and rigid graph theory, we propose a new control law that exponentially stabilizes the origin of the nonlinear, interagent distance error dynamics and ensures tracking of the desired, 3D time-varying formation. Extensions to the formation maneuvering problem and double-integrator model are also discussed. The formation control is illustrated with a simulation of eight agents forming a dynamic cube.


Author(s):  
Xiaoyu Cai ◽  
Marcio de Queiroz

This paper is concerned with the decentralized formation control of multi-agent systems moving in the plane using rigid graph theory. Using a double-integrator agent model (as opposed to the simpler, single-integrator model), we propose a new control law to asymptotically stabilize the interagent distance error dynamics. Our approach uses simple backstepping and Lyapunov arguments. The control, which is explicitly dependent on the rigidity matrix of the undirected graph that models the formation, is derived for a class of potential functions. Specific potential functions are then used as a demonstration inclusive of simulation results.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-6 ◽  
Author(s):  
Zhengquan Yang ◽  
Qing Zhang ◽  
Zengqiang Chen

In this paper, the formation problem for multi-agent systems with region constraint is studied while few researchers consider this problem. The goal is to control all multi-agents to enter the constraint area while reaching formation. Each agent is constrained by a common convex set. A formation control law is presented based on local information of the neighborhood. It is proved that the positions of all the agents would converge to the set constraint while reaching formation. Finally, two numerical examples are presented to illustrate the validity of the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document