Complexity

Volume 2019, Article ID 8481060, 6 pages

https://doi.org/10.1155/2019/8481060

## Formation Control of Multi-Agent Systems with Region Constraint

Correspondence should be addressed to Zhengquan Yang; moc.361@gnaynauqz

Received 12 April 2019; Revised 20 July 2019; Accepted 10 August 2019; Published 4 December 2019

Academic Editor: Dan Selişteanu

Copyright © 2019 Zhengquan Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

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.

#### 1. Introduction

In recent years, more and more researchers have discussed the formation control of multi-agent systems (MASs). The formation of MASs is widely used in load transportation, satellite formation flying, and unmanned aerial vehicle formation [1]. The purpose of multi-agent formation control is to control all agents to realize and maintain a prespecified geometric shape.

Many control strategies have been used for formation control, such as distance-based, displacement-based, and position-based strategies [2, 3]. The consensus theory has also been widely used to solve the formation control [4–7]. Lin et al. [8] studied the time-varying formation having shape constraints, which lie in the null space of a complex Laplacian. The necessary conditions for the formation of a multi-agent under fixed and undirected graphs are given in Ref. [9]. The leader-following formation control problem of second-order MASs with time-varying delay and nonlinear dynamics was investigated [10]. Xiao et al. [11] developed a new control framework to solve the finite-time formation of MASs. Sun et al. [12] gave a modified gradient control algorithm which can achieve finite time formation stabilization of first-order MASs. Lee and Ahn [13] proposed a formation control method which includes a combination of global orientation estimation and formation control law. In Ref. [14], adaptive formation control of MASs is proposed, which has an unknown leader. The time-varying formation problem was researched in previous studies [15–17]. Xia et al. [18] proposed an optimal formation control strategy using the estimated position information. In Ref. [19], a combination of attractive-repulsive artificial potential field and a control term related to the angular information between robots was used to reduce undesired local minima. In Ref. [20], an adaptive control approach was developed to solve such a problem by using the volume condition constraints. Inspired by distance rigidity theory and bearing rigidity theory, Jing [21] developed an angle rigidity theory to study whether the shape of a planar graph can be uniquely determined by angles only.

The above research into formation control relies on formation maintenance or stabilization. Recently, formation control with constraints has been studied by some researchers. Ref. [22] designed a space constrained controller based on neural network, which provides a tool for tracking control or path planning in nonomniscient constrained space. Hernandez-Martinez et al. [23] considered the desired formation specification with signed area constraints, and designed a tracking control strategy using distance and area terms. A leader-follower formation control method for under-actuated autonomous underwater vehicles with line-of-sight and angle constraints is proposed in Ref. [24]. Liu [25] proposed a formation control algorithm which uses distance and signed area information to ensure convergence to the required formation shape.

To the best of our knowledge, there has not been a formal article to systematically address the formation protocols in the presence of region constraints. But in real control systems, we need to control agents to the desired area. That is, to consider situations where the only concern of the final state is a constraint rather than some specific geometry. We focus on the formation control problem of second-order MASs with region constraints. We know that the leader-following formation can solve this problem by imposing that one robot (leader) converges to the goal position in the plane (within a desired area). However, the main advantages of this scheme are that: the controller does not depend on the leader, and has good robustness; the agent can converge to the constraint region quickly; all agents can enter the constrained area accurately. Compared with previous results, the features of this paper are as follows: First, we propose a new control law with region constraints, which has the sum of a formation part and a projection part. Second, an asymptotic convergence is proved via a common Lyapunov function method.

The remainder of this paper is organized as follows: Section 2 introduces the basic principles and problem statement of graph theory. In Section 3, a formation protocol with region constraint is presented. In Section 4, numerical examples are given. Section 5 contains the conclusion.

#### 2. Preliminaries

*Notations*. denotes the Euclidean norm of the vector . The 1-norm of the vector is denoted by . denotes the projection of the vector onto the closed convex set .

In this paper, an undirected graph is considered with node set and edges set . is called a neighbor of node if . The neighbors of vertex are given by . The adjacency matrix of the graph is which is denoted as , if , otherwise .

In this paper, a system that is made up of agents (indexed by ) is considered. The state of agent is denoted by . The dynamics of each agent is described by the integrators

where is the velocity vector, and is the control input acting on agent .

A framework is defined as a pair where . Ordering edges of in some way, the rigidity function associated with the framework is defined as:

*Definition 2.1. *(see [26]) A framework is rigid if there exists a neighborhood of such that , where is the complete graph on -vertices.

In this paper, we consider the region constraint on the formation control of multi-agents. That is, all agents are given a region constraint , which limits all multi-agents to enter the constraint area while reaching formation. To do that, give a point such that is infinitesimally rigid, the target formation is defined asThat is, is the set of all formations congruent with .

Lemma 1. *(see [27] Given a closed convex set , it has: *

*Problem 2.1. *For the system (1), design the control for each agent in terms of , such that converges to , and as .

#### 3. Main Results

In this section, we propose a new controller to make multi-agent realize asymptotic formation. The controller has a projection part and the sum of the formation part. The new distributed formation controller is as follows:

where and are two constants, .

We now propose the important result of this paper.

Theorem 1. *For all , and , for the system (1) with the control algorithm (5), all agents achieve the asymptotical convergence of the formation shape, and as .*

*Proof. *Consider the Lyapunov function of system (1) asIts derivative along the system (1) isBecause , we haveEquation (7) can be rewritten asTherefore, based on Lasalle’s invariance principle, we have, ,It then follows from (1) and (5) that for all ,Then, we getThus, we haveMoreover, it follows thatThis implies that Equation (7) can be written as follows:By using the inequality , we getThis showsTherefore, we get , , that is, all agents achieve the asymptotical convergence of the formation shape, and as .

#### 4. Simulation Results

In this section, we present two instances to illustrate the effectiveness of the method presented in this paper.

*Example 1. *Simulation is performed with six agents moving in a 2D plane. In simulation, the parameters in algorithm (4) are . We assume the adjacency matrix as follows:The constraint area is a circle, which is . The target formation shape is a regular hexagon which is shown in Figure 1. In the simulation, the projection is implemented as follows: Find the shortest distance from to the constraint set , and the point satisfying is the projection onto .

The initial positions and velocities of all multi-agents are shown in Figure 2. The initial positions are set randomly, and the initial velocities are chosen randomly in the unit square. Figure 3 shows the motion trajectory of the multi-agent. Figure 4 depicts the final formation shape of the multi-agent. The convergence of the errors of the position and the region constraint are plotted in Figure 5. So we can see that the six-agent group moves into the constraint set and then achieves the desired formation shape. The errors converge to zero, but they jump to other values in a discontinuous manner. So, the convergence of the errors is asymptotic. The control inputs of the simulation are plotted in Figure 6. We can see that the control input converges to zero asymptotically.