# Sliding Mode Reference Coordination of Constrained Feedback Systems

Authors: Alejandro Vignoni; Fabricio Garelli; Jesús Picó
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

This paper addresses the problem of coordinating dynamical systems with possibly different dynamics (e.g., linear and nonlinear, different orders, constraints, etc.) to achieve some desired collective behavior under the constraints and capabilities of each system. To this end, we develop a new methodology based on reference conditioning techniques using geometric set invariance and sliding mode control: the sliding mode reference coordination (SMRCoord). The main idea is to coordinate the systems references. Starting from a general framework, we propose two approaches: a local one through direct interactions between the different systems by sharing and conditioning their own references and a global centralized one, where a central node makes decisions using information coming from the systems references. In particular, in this work we focus in implementation on multivariable systems like unmanned aerial vehicles (UAVs) and robustness to external perturbations. To show the applicability of the approach, the problem of coordinating UAVs with input constraints is addressed as a particular case of multivariable reference coordination with both global and local configuration.


---

## Body

## 1. Introduction

Coordination of multiagents and, in particular, formation control of multiple unmanned aerial vehicles (UAVs) is a very up-to-date topic, and it supports many practical applications, such as surveillance, weather forecasting, damage assessment, and search and rescue [1–3].Recently, the consensus problem was addressed using algebraic graph theory and properties of the Laplacian Matrix for single integrators (see [1, 4] and references therein). This approach was extended to a chain of integrators in [5], and to nonlinear multiagent systems in [6].Sliding mode control is an important topic in nonlinear systems. Research in nonlinear systems goes from stability analysis (e.g., with fuzzy polynomial models and sum of squares tools [7]) to estimation (e.g., with second order sliding mode observers for kinetic rates [8]) to control (e.g., with bounded L2 gain performance of Markovian jump singular time-delay systems [9]).The use of sliding mode (SM) techniques is generally used for control of swarms and multi-agent systems to achieve consensus. In those situations, a master-slave or leader-follower configuration is implemented, and the discontinuous action is a control signal. In [10], higher-order sliding mode controllers are used in such configuration to maintain the formation shape. In [11], finite-time sliding mode estimators are used to achieve consensus in decentralized formation control with virtual leader. Also in [12], a discontinuous control input is chosen to be proportional to the gradient of a positive semidefinite disagreement function defined by the graph Laplacian matrix, leading to a sliding mode consensus algorithm. Recently in [13], consensus is achieved in connected and also in fully connected swarms of idealized and identical first-order dynamic systems enforced by sliding modes. Also in [14], finite-time consensus algorithms for a swarm of self-propelling agents based on sliding mode control and graph algebraic theories are developed. In [15], an LMI approach to multiagent systems control is performed under time delay and uncertainties. Finally, in [16], exact formation control is achieved with binary information of the position of the other agents.In a recent proposal from one of the coauthors, sliding mode control has been used in a nontraditional way: the sliding mode reference conditioning (SMRC) technique [17]. This technique combines reference conditioning and sliding mode ideas and has been used in the beginning to bound cross-coupling interactions in multivariable linear systems [18, 19] and for set-point seeking in nonlinear systems with state dependent constraints [20]. In [21], an SMRC auxiliary loop has been implemented to reduce hypoglycemia in a closed-loop glucose control for DM type 1 patients. Also in [22], a geometric invariance and sliding mode ideas have been proposed for redundancy resolution in robotic systems. And in [23], an integrated solution based on the same ideas has been proposed for robotic trajectory tracking, path planning and speed autoregulation.In the previous work [24–27], the authors use sliding mode reference conditioning to enforce coordination in multi-agent systems. In [24], sliding mode reference coordination in SISO systems is imposed with a global supervisory approach and two layers of SMRC in a hierarchical structure. In [25], the coordination arises from the local interaction between the systems, and the information flows in only one level, as the swarm is assumed to have no leader. In [26], the authors make a multivariable reference coordination for ideal unconstrained systems. A preliminary unifying work is done in [27] with focus on SISO systems. The present work is a unified approach of the sliding mode reference coordination (SMRCoord) integrating both local and global approaches with focus on implementation of multivariable systems and robustness of perturbation to the coordination goals.The rest of the paper is organized as follows. Next section presents the problem of coordination in a general form. Then in Section3, some previous results in set invariance and reference conditioning used thereafter to propose coordination strategy are described. In Section 4, a decentralized version is proposed to solve the coordination problem with only one hierarchical level and no leader. Meanwhile in Section 5, the supervised global coordination method is proposed. In Section 6, the proposed strategies are used to coordinate UAVs showing the result obtained by simulations. Finally, in Section 7, some conclusions are presented and open issues for future study are considered.


## 2. Problem Statement

In this section, a general form of the coordination problem is presented, together with definitions and assumptions regarding constrained systems and systems coordination.ConsiderN stable closed-loop systems with different dynamic behaviour, constraints, and performance. In the context of constrained systems, the following feasible reference concept arises [28]: the fastest reference a system can follow without violating its constraints while beiing in closed loop. In the case of a system with actuator saturation as a constraint, a feasible reference will never lead the actuators out of their operation range; otherwise it may open the loop, leaving the control system without feedback and leading to a windup effect.Hereafter, coordination will be understood as the action needed in order to obtain a collective behaviour in a set of considered systems. In this work, the coordination problem is approached by acting on the systems references.Among the possible collective behaviours, one can count(i)
keeping a function of the local references (χ) close to the global reference,(ii)
maintaining a fixed distance between the systems local references, one to one, or between flock centroids,(iii)
obtaining generalized synchronization, as a limit case of the previous cases.Note the function χ may be some function of the local references, like the mean, mode, max, or min. As a consequence of this, the resulting definition of coordination is rather general and broad, depending on the selected χ function.


### 2.1. Information Exchange

Information exchange is one of the key elements when coordinating a set of systems. Depending on the level on which this information is exchanged as in the following architectures may arise Figure1:Local Topology when information flows in the same level among neighbours systems;Global Topology when information exchange occurs in a higher hierarchical level, to a supervisory node.Network topology of the different architectures implemented in quadrotors. (a) Local distributed topology. (b) Supervised global topology.
(a)
(b)Information exchange still is one of the main bottlenecks of a centralized topology: the data collection time depends on the number of systems involved unlike the decentralized one which depends only on the network radius. Moreover, the global topology presents the common issues of vulnerability and fragility. If the central node has a communication problem or if it is under attack, all the network gets compromised.


### 2.2. Constrained Systems

When working with constrained systems, if the constrained variables take different value from the desired ones, inadequate values of the state variablesx can destroy control performance. In order to restore the state adequacy, auxiliary inputs rf(x), called feasible references, are used [28].Definition 1.
The feasible referencerf(x) of a closed-loop system is the closest input to the original reference r such that if rf(x) had been applied to the controller instead of r, the system constraints would have not been violated; that is, the trajectories of the system and in particular the constrained variables would remain inside (or in the boundary of) a given set Φ, defined by the system constraints.


### 2.3. Assumptions and Definitions

Using the following assumptionAssumption 2.
Each system has a stabilizing control loop and can follow a feasible reference.The coordination is defined as follows.Definition 3.
The systems are said to be coordinated as long as their references belong to the invariant setΦc(x,ρ), by modifying each system feasible reference. The set Φc(x,ρ) is defined as
(1)Φc(x,ρ)={x∈X:ϕc(x,ρ)=∥r(x)-ρ∥-δ≤0},
where x∈X∈ℝn are the system states, r(x) is a feasible reference function of the states x, ρ is a function depending on the information coming from the other systems, and δ is a predefined value. The norm ∥·∥ can be any norm defined in ℝn. However, hereafter we will use the Euclidean norm for simplicity.


## 2.1. Information Exchange

Information exchange is one of the key elements when coordinating a set of systems. Depending on the level on which this information is exchanged as in the following architectures may arise Figure1:Local Topology when information flows in the same level among neighbours systems;Global Topology when information exchange occurs in a higher hierarchical level, to a supervisory node.Network topology of the different architectures implemented in quadrotors. (a) Local distributed topology. (b) Supervised global topology.
(a)
(b)Information exchange still is one of the main bottlenecks of a centralized topology: the data collection time depends on the number of systems involved unlike the decentralized one which depends only on the network radius. Moreover, the global topology presents the common issues of vulnerability and fragility. If the central node has a communication problem or if it is under attack, all the network gets compromised.


## 2.2. Constrained Systems

When working with constrained systems, if the constrained variables take different value from the desired ones, inadequate values of the state variablesx can destroy control performance. In order to restore the state adequacy, auxiliary inputs rf(x), called feasible references, are used [28].Definition 1.
The feasible referencerf(x) of a closed-loop system is the closest input to the original reference r such that if rf(x) had been applied to the controller instead of r, the system constraints would have not been violated; that is, the trajectories of the system and in particular the constrained variables would remain inside (or in the boundary of) a given set Φ, defined by the system constraints.


## 2.3. Assumptions and Definitions

Using the following assumptionAssumption 2.
Each system has a stabilizing control loop and can follow a feasible reference.The coordination is defined as follows.Definition 3.
The systems are said to be coordinated as long as their references belong to the invariant setΦc(x,ρ), by modifying each system feasible reference. The set Φc(x,ρ) is defined as
(1)Φc(x,ρ)={x∈X:ϕc(x,ρ)=∥r(x)-ρ∥-δ≤0},
where x∈X∈ℝn are the system states, r(x) is a feasible reference function of the states x, ρ is a function depending on the information coming from the other systems, and δ is a predefined value. The norm ∥·∥ can be any norm defined in ℝn. However, hereafter we will use the Euclidean norm for simplicity.


## 3. Geometric Set Invariance and Sliding Mode Reference Conditioning

In this section, the methodology used in this paper to achieve the coordination of feasible references is described. It is based on concepts of geometric set invariance and sliding mode reference conditioning.


### 3.1. Geometric Set Invariance

Consider the following dynamical system:(2)Σ:{x˙=f(x)+g(x)u,y=h(x),
where x∈X⊂ℝn is the state vector, u∈U⊂ℝm is a control input (possibly discontinuous), f:ℝn→ℝn and g:ℝn→ℝn are vector fields, and h:ℝn→ℝb is scalar fields; all of them are defined in X.The variabley denotes the system output vector, which has to be bounded so as to fulfill j=1,…,N user-specified system constraints ϕi. The corresponding bounds on y are given by the set:
(3)Φ={x∈X∣ϕi(y)≤0},i=1,…,N.
From a geometrical point of view, the goal is to find a control input u such that the region Φ becomes invariant (i.e., trajectories originating in Φ remain in Φ for all times t), while y is driven as close as possible to its desired value r.To ensure the invariance ofΦ, the control input u must guarantee that the right hand side of the first equation in (2) points to the interior of Φ at all points on the boundary layer of Φ, denoted by ∂Φ, defined as
(4)∂Φ=⋃i=1N‍∂Φi,∂Φi={x∈Φ∣ϕi(y)=0}.
The following assumption will be needed for later development and will allow us to compute the gradient vector ∇ϕj of the functions ϕi.Assumption 4.
All theϕi functions are assumed to be differentiable in the boundary ∂Φi.Mathematically, the invariance ofΦ may be ensured by an input u, such that, for all i,ϕ˙i≤0, when ϕi(y)=0. This condition can be expressed as
(5)ϕ˙i(x,d,u)=∇ϕi⊤x˙=∥∇ϕi∥∥f+gu∥cosθ=∇ϕ⊤f+∇ϕ⊤gu=Lfϕi+Lgϕiu,∀x∈∂Φi,j=1,…,N,
which constitute in standard form the implicit invariance condition [29, 30]:
(6)infu{ϕ˙i(x,d,u)≤0,∀x∈∂Φi},j=1,…,N.Solving (6) for u results in the explicit invariance condition for system (2) and a particular constraint ϕi. The set 𝒰i of feasible solutions is obtained:
(7)𝒰i(x,d)={u∈{U∣Lfϕi+Lgϕiu≤0}:x∈∂Φi∧Lgϕi≠0m′⊤empty:x∈∂Φi∧Lgϕi=0m′⊤∧Lfϕi>0u=free:x∈∂Φi∧Lgϕi=0m′⊤∧Lfϕi≤0u=free:x∈Φ∖∂Φ,
where 0m⊤ denotes the m-dimensional null column vector, and the first set corresponding to Lgϕi≠0m⊤ is always nonempty.Note that the controlu in the interior of Φ can be freely assigned. Particularly, u=0m⊤ could be taken so that the system evolves autonomously throughout the interior of Φ. Then, the control action becomes active only when some constraint becomes active, that is, when the state trajectory reaches the boundary ∂Φ trying to leave the set Φ. The invariance condition will hold if the intersection ⋂i𝒰i(x) for all constraints of the solution sets 𝒰i(x) is not empty.


### 3.2. Sliding Mode Reference Conditioning

Now, in order to find the necessaryu to achieve the invariance of some set Φ(y) (3), with the system Σ (2), consider the following implementation (Figure 2).Figure 2
SM reference conditioning general scheme.A discontinuous decision block will drive the search to findu∈𝒰i(x) so as to fulfill the constraint Φ(y) and make rf remain as close as possible to the external signal r. Also, a filter F is incorporated. Its purpose is to filter out the conditioned signal rf in order to feed the system Σ with a smooth signal.The filterF is implemented as the first-order filter
(8)r˙f=-Λ(rf+u-r),
where u∈U⊂ℝm is the discontinuous control action, r,rf∈ℝm are the input and the conditioned input signals, and Λ∈ℝm×m is a diagonal matrix, a design parameter of the filter.The discontinuous decision block is implemented by means of the variable structure control law:(9)u={0ifmaxi{ϕi(y)}≤0uSMotherwise,
where ϕi(y) are the constraints defined previously, that is, the boundaries of the set Φ, and uSM is such that u∈⋂i𝒰i(x).Notice that the blockΣ in Figure 2 represents the entire dynamics from the constrained variables (y) to the input signal u. Then system (2) becomes
(10)x˙=f(x,d)+g(x)rf,r˙f=-Λ(rf+u-r),y=h(x).In the case of a control system, (2) is the plant dynamic together with a control loop, in which case rf is the reference, and x in (2) is the extended state comprising the plant and controller.The choice ofuSM depends on whether there is only one active constraint or more than one. For a single active constraint, the analysis is very similar to that of an SMRC in an SISO system [17, 24, 25] and is the approach we will use hereafter. The case of several active constraints (see [22]) is not analyzed in this work since we are defining only one constraint per system in the formation control problem.


## 3.1. Geometric Set Invariance

Consider the following dynamical system:(2)Σ:{x˙=f(x)+g(x)u,y=h(x),
where x∈X⊂ℝn is the state vector, u∈U⊂ℝm is a control input (possibly discontinuous), f:ℝn→ℝn and g:ℝn→ℝn are vector fields, and h:ℝn→ℝb is scalar fields; all of them are defined in X.The variabley denotes the system output vector, which has to be bounded so as to fulfill j=1,…,N user-specified system constraints ϕi. The corresponding bounds on y are given by the set:
(3)Φ={x∈X∣ϕi(y)≤0},i=1,…,N.
From a geometrical point of view, the goal is to find a control input u such that the region Φ becomes invariant (i.e., trajectories originating in Φ remain in Φ for all times t), while y is driven as close as possible to its desired value r.To ensure the invariance ofΦ, the control input u must guarantee that the right hand side of the first equation in (2) points to the interior of Φ at all points on the boundary layer of Φ, denoted by ∂Φ, defined as
(4)∂Φ=⋃i=1N‍∂Φi,∂Φi={x∈Φ∣ϕi(y)=0}.
The following assumption will be needed for later development and will allow us to compute the gradient vector ∇ϕj of the functions ϕi.Assumption 4.
All theϕi functions are assumed to be differentiable in the boundary ∂Φi.Mathematically, the invariance ofΦ may be ensured by an input u, such that, for all i,ϕ˙i≤0, when ϕi(y)=0. This condition can be expressed as
(5)ϕ˙i(x,d,u)=∇ϕi⊤x˙=∥∇ϕi∥∥f+gu∥cosθ=∇ϕ⊤f+∇ϕ⊤gu=Lfϕi+Lgϕiu,∀x∈∂Φi,j=1,…,N,
which constitute in standard form the implicit invariance condition [29, 30]:
(6)infu{ϕ˙i(x,d,u)≤0,∀x∈∂Φi},j=1,…,N.Solving (6) for u results in the explicit invariance condition for system (2) and a particular constraint ϕi. The set 𝒰i of feasible solutions is obtained:
(7)𝒰i(x,d)={u∈{U∣Lfϕi+Lgϕiu≤0}:x∈∂Φi∧Lgϕi≠0m′⊤empty:x∈∂Φi∧Lgϕi=0m′⊤∧Lfϕi>0u=free:x∈∂Φi∧Lgϕi=0m′⊤∧Lfϕi≤0u=free:x∈Φ∖∂Φ,
where 0m⊤ denotes the m-dimensional null column vector, and the first set corresponding to Lgϕi≠0m⊤ is always nonempty.Note that the controlu in the interior of Φ can be freely assigned. Particularly, u=0m⊤ could be taken so that the system evolves autonomously throughout the interior of Φ. Then, the control action becomes active only when some constraint becomes active, that is, when the state trajectory reaches the boundary ∂Φ trying to leave the set Φ. The invariance condition will hold if the intersection ⋂i𝒰i(x) for all constraints of the solution sets 𝒰i(x) is not empty.


## 3.2. Sliding Mode Reference Conditioning

Now, in order to find the necessaryu to achieve the invariance of some set Φ(y) (3), with the system Σ (2), consider the following implementation (Figure 2).Figure 2
SM reference conditioning general scheme.A discontinuous decision block will drive the search to findu∈𝒰i(x) so as to fulfill the constraint Φ(y) and make rf remain as close as possible to the external signal r. Also, a filter F is incorporated. Its purpose is to filter out the conditioned signal rf in order to feed the system Σ with a smooth signal.The filterF is implemented as the first-order filter
(8)r˙f=-Λ(rf+u-r),
where u∈U⊂ℝm is the discontinuous control action, r,rf∈ℝm are the input and the conditioned input signals, and Λ∈ℝm×m is a diagonal matrix, a design parameter of the filter.The discontinuous decision block is implemented by means of the variable structure control law:(9)u={0ifmaxi{ϕi(y)}≤0uSMotherwise,
where ϕi(y) are the constraints defined previously, that is, the boundaries of the set Φ, and uSM is such that u∈⋂i𝒰i(x).Notice that the blockΣ in Figure 2 represents the entire dynamics from the constrained variables (y) to the input signal u. Then system (2) becomes
(10)x˙=f(x,d)+g(x)rf,r˙f=-Λ(rf+u-r),y=h(x).In the case of a control system, (2) is the plant dynamic together with a control loop, in which case rf is the reference, and x in (2) is the extended state comprising the plant and controller.The choice ofuSM depends on whether there is only one active constraint or more than one. For a single active constraint, the analysis is very similar to that of an SMRC in an SISO system [17, 24, 25] and is the approach we will use hereafter. The case of several active constraints (see [22]) is not analyzed in this work since we are defining only one constraint per system in the formation control problem.


## 4. Reference Coordination under Local Topology

In this section, the local topology scheme for systems coordination is presented. The coordination problem approached is the second one described in Section2. To this end, Definition 3 is rewritten in the following way.Definition 5.
The local objective between two connected systems is to bound the distance between their references by a predefined valueδij. The set Φij is defined by. 							(11)Φij(x,rfk)={x∈X,rfk∈ℝ,k=1,2:ϕij=|rfi-rfj|-δij≤0},
where x∈X∈ℝn are the systems states and rfi∈ℝ, rfj∈ℝ are the conditioned references of systems i and j, respectively.Moreover, the systems are connected by the following assumption.Assumption 6.
The topology of the connection network is fixed, in the sense of which system can communicate with each other. This network can be represented by a directed graph with adjacency matrixA=[aij], with aij=1, when ith system can communicate with jth one. Otherwise aij=0. This graph is assumed to be connected [4].Then, the setΦ is defined as the union of the Φij, when they are connected (aij=1), for all the systems in the group:
(12)Φ=⋃i=1,j=1,i≠jN‍aijΦij.
The coordination objective is to make the set Φ a controlled invariant set. To this end, the following local coordination scheme is proposed.


### 4.1. Proposed Coordination Scheme

Consider a swarm ofN systems, with N≥2 satisfying Assumption 2, connected in a network topology as in Assumption 6, with a sliding mode reference conditioning auxiliary loop, like in Section 3.2. This loop allows us to handle the local constraints of each system by commanding a feasible reference to each system closed loop. Also, the feasible reference provides information to the other systems. The systems will have a goal for every connected neighbor systems as in Definition 5. Then, it is possible to enforce coordination as in Section 2 among the system references using the following scheme incorporating the local goal into each system SMRC loop.In Figure3, an implementation of the proposed scheme is depicted, with two systems for the sake of demonstration. The ith system Σi incorporates the plant and a biproper controller:
(13)Σi:{x˙i=fi(xi)+gi(xi)viyi=hi(xi)x˙ci=Acixci+bcieivi=ccixci+dciei,
where xci and ei are the state of the controller and the error signal of the control loop defined as ei=rfi-yi. Aci, bci, cci, and dci are the parameters of the ith system controller.Figure 3
Local SMRCoord: local goal incorporation into the SMRC scheme.The local goal, incorporated in the SMRC, together with the actuator saturation constraint, leads to the following structure for the filterFi:
(14)Fi:r˙fi=-αi(rfi-r+w~i)
with the combination function w~i. This will combine the discontinuous actions from the physical constraints (wi) and from the virtual coordination constraints (wij), defined as follows:
(15)w~i=wi+∑j=1,j≠iN‍aijwij.
The discontinuous action wi is defined as in [18]:
(16)wi={Miifϕi+=vi-vip+>0-Miifϕi-=vi-vip-<00otherwise,
with Mi being the amplitude of the discontinuous action. And the discontinuous action wij is defined according to the virtual constraint ϕij:
(17)wij={Mijsign(rfi-rfj)ifϕij(rfi,rfj)≥00ifϕij(rfi,rfj)<0,
with Mij being the amplitude of the discontinuous action. Finally the physical and vitrual coordination constraints are:
(18)ϕi±=vi-vip±(19)ϕij=|rfi-rfj|-δij,
with vip+ and vip- being the upper and lower limits of the actuator saturation and δij being a preestablished value for the references difference, and (19) being defined according to (11).In AppendixB, the corresponding analysis is done to prove the invariance of the set Φij, obtaining the following bound:
(20)Mij>-αirfi-αjrfjαi+αj-αi-αjαi+αjr,(21)Mi>∑i≠jMij-b-civip±+A-cixcibi-ρi.


## 4.1. Proposed Coordination Scheme

Consider a swarm ofN systems, with N≥2 satisfying Assumption 2, connected in a network topology as in Assumption 6, with a sliding mode reference conditioning auxiliary loop, like in Section 3.2. This loop allows us to handle the local constraints of each system by commanding a feasible reference to each system closed loop. Also, the feasible reference provides information to the other systems. The systems will have a goal for every connected neighbor systems as in Definition 5. Then, it is possible to enforce coordination as in Section 2 among the system references using the following scheme incorporating the local goal into each system SMRC loop.In Figure3, an implementation of the proposed scheme is depicted, with two systems for the sake of demonstration. The ith system Σi incorporates the plant and a biproper controller:
(13)Σi:{x˙i=fi(xi)+gi(xi)viyi=hi(xi)x˙ci=Acixci+bcieivi=ccixci+dciei,
where xci and ei are the state of the controller and the error signal of the control loop defined as ei=rfi-yi. Aci, bci, cci, and dci are the parameters of the ith system controller.Figure 3
Local SMRCoord: local goal incorporation into the SMRC scheme.The local goal, incorporated in the SMRC, together with the actuator saturation constraint, leads to the following structure for the filterFi:
(14)Fi:r˙fi=-αi(rfi-r+w~i)
with the combination function w~i. This will combine the discontinuous actions from the physical constraints (wi) and from the virtual coordination constraints (wij), defined as follows:
(15)w~i=wi+∑j=1,j≠iN‍aijwij.
The discontinuous action wi is defined as in [18]:
(16)wi={Miifϕi+=vi-vip+>0-Miifϕi-=vi-vip-<00otherwise,
with Mi being the amplitude of the discontinuous action. And the discontinuous action wij is defined according to the virtual constraint ϕij:
(17)wij={Mijsign(rfi-rfj)ifϕij(rfi,rfj)≥00ifϕij(rfi,rfj)<0,
with Mij being the amplitude of the discontinuous action. Finally the physical and vitrual coordination constraints are:
(18)ϕi±=vi-vip±(19)ϕij=|rfi-rfj|-δij,
with vip+ and vip- being the upper and lower limits of the actuator saturation and δij being a preestablished value for the references difference, and (19) being defined according to (11).In AppendixB, the corresponding analysis is done to prove the invariance of the set Φij, obtaining the following bound:
(20)Mij>-αirfi-αjrfjαi+αj-αi-αjαi+αjr,(21)Mi>∑i≠jMij-b-civip±+A-cixcibi-ρi.


## 5. Reference Coordination under Global Topology

To address the coordination problem under the global topology, Definition3 is rewritten as follows.Definition 7.
The coordination objective can be defined in terms of a setΦχ, which by changing r becomes an invariant set. The set Φχ is defined by
(22)Φχ(x,rfi)={|r-χ(rfi)|x∈X,rfi∈ℝN:ϕχ(rfi)=|r-χ(rfi)|-Δ≤0},
where x∈X∈ℝn are the systems states, r∈ℝ is the global conditioned references, and χ(rfi) is a function of each system’s reference. Finally, Δ is a fix predetermined value, the width of the allowed band around r.Thus, the coordination objective is to makeΦχ become an invariant set. To this end, the following coordination scheme is proposed.


### 5.1. Proposed Coordination Scheme

Consider a set ofN dynamical systems. Assumption 2 holds for each system. Defining the coordination objective as in Definition 7, it follows that coordination understood as in Section 2 is enforced using the following scheme and incorporating the coordination objective (Definition 7) in a global reference conditioning loop.The proposed coordination scheme is shown in Figure4. Each agent i has a local reference conditioning loop (ϕi, wi, and Fi like in Figure 2) to generate the feasible reference rfi from the global reference r.Figure 4
Coordination scheme for the global topology.In a higher hierarchical level, there is another reference conditioning loop, in this case to generate the global referencer. This loop comprises the switching function ϕχ, the function χ of the local references, and the discontinuous action (wg) to create a smooth global reference r from the global target signal cg.


#### 5.1.1. Coordination Filter

The coordination filter (Fg) smooths the global discontinuous action (wg) with the following dynamics:
(23)r˙=-λ(r-cg-kwg),
where wg is the discontinuous action and k is a weight to define the strength of the coordination.


#### 5.1.2. Definition of the Switching Surfaceϕχ

First we define the boundaries of the setΦχ as constraints in the following way:
(24)ϕχ+=r-χ(rfi)-Δ,ϕχ-=r-χ(rfi)+Δ.
The discontinuous action to force the system remain in the set Φχ when the system dynamics make the trajectories go outside of the set is
(25)wg={wg+ifϕχ+>0wg-ifϕχ-<00otherwise.
To ensure the invariance of the set Φχ (7), we must choose wg-≤-wg⋆ and wg+≥wg⋆, where wg⋆ is the bound obtained in Appendix A.


## 5.1. Proposed Coordination Scheme

Consider a set ofN dynamical systems. Assumption 2 holds for each system. Defining the coordination objective as in Definition 7, it follows that coordination understood as in Section 2 is enforced using the following scheme and incorporating the coordination objective (Definition 7) in a global reference conditioning loop.The proposed coordination scheme is shown in Figure4. Each agent i has a local reference conditioning loop (ϕi, wi, and Fi like in Figure 2) to generate the feasible reference rfi from the global reference r.Figure 4
Coordination scheme for the global topology.In a higher hierarchical level, there is another reference conditioning loop, in this case to generate the global referencer. This loop comprises the switching function ϕχ, the function χ of the local references, and the discontinuous action (wg) to create a smooth global reference r from the global target signal cg.


### 5.1.1. Coordination Filter

The coordination filter (Fg) smooths the global discontinuous action (wg) with the following dynamics:
(23)r˙=-λ(r-cg-kwg),
where wg is the discontinuous action and k is a weight to define the strength of the coordination.


### 5.1.2. Definition of the Switching Surfaceϕχ

First we define the boundaries of the setΦχ as constraints in the following way:
(24)ϕχ+=r-χ(rfi)-Δ,ϕχ-=r-χ(rfi)+Δ.
The discontinuous action to force the system remain in the set Φχ when the system dynamics make the trajectories go outside of the set is
(25)wg={wg+ifϕχ+>0wg-ifϕχ-<00otherwise.
To ensure the invariance of the set Φχ (7), we must choose wg-≤-wg⋆ and wg+≥wg⋆, where wg⋆ is the bound obtained in Appendix A.


## 5.1.1. Coordination Filter

The coordination filter (Fg) smooths the global discontinuous action (wg) with the following dynamics:
(23)r˙=-λ(r-cg-kwg),
where wg is the discontinuous action and k is a weight to define the strength of the coordination.


## 5.1.2. Definition of the Switching Surfaceϕχ

First we define the boundaries of the setΦχ as constraints in the following way:
(24)ϕχ+=r-χ(rfi)-Δ,ϕχ-=r-χ(rfi)+Δ.
The discontinuous action to force the system remain in the set Φχ when the system dynamics make the trajectories go outside of the set is
(25)wg={wg+ifϕχ+>0wg-ifϕχ-<00otherwise.
To ensure the invariance of the set Φχ (7), we must choose wg-≤-wg⋆ and wg+≥wg⋆, where wg⋆ is the bound obtained in Appendix A.


## 6. Simulation

In this section, the main features of the sliding mode reference coordination (SMRCoord) and formation control developed in Sections5 and 4 are illustrated for quadrotors with cartesian control through simulation results obtained using MATLAB and using non-linear identified models from [31]. A simplified version of the Parrot AR-Drone quadrotor models and software for development and implementation of control and navigation strategies can be found in [32]. Note the strategy is straightforward to implement in MIMO systems, as soon as they are decoupled. This is the case of the quadrotors in cartesian configuration.


### 6.1. Quadrotors and Controllers

In this example we considered three quadrotors. The kind of motion considered is cartesian (planar motion). Each one has its own local reference conditioning scheme as in Section3.2. Each agent i sends and receives information from the other agents under the local topology and to the supervisor under the global topology and incorporates them as constraints (Definition 5) in the SMRC as proposed in Section 4.


### 6.2. Information Exchange in SMRCoord

The way the information exchange is considered in this work is a key contribution. The main idea is that each system sends key information regarding its local constraints to the other systems by sending its feasible reference. In any of the two topologies, the individual systems hide their states and output to only share the feasible reference with the other systems and thus minimizing the information exchange. The feasible reference contains information of the system and its state regarding the local constraints.


### 6.3. Simulation Results

#### 6.3.1. UAV Formation with SMRCoord under Local Topology

First we implement a triangle-shape formation with three drones using the SMRCoord under a local topology. The time evolution of the three agents references (rfi) together with the resulting discontinuous actions (w) is shown in Figure 5.Local topology: conditioned references and discontinuous actions of the individual systems.
(a)
(b)
(c)
(d)
(e)It can be seen that the references are coordinated and follow the target trajectory taking into account the saturation in the drones actuators.In the resulting discontinuous action (plots 3 to 5 in Figure5), it is possible to see that the amplitude in each component is varying with time, as the constraints ϕ also change, depending on the relative positions of the agent between them. Also the amplitude of the discontinuous action is enough to make (21) hold, so that the SM is established in the boundary ∂ϕ.In Figure6, it is possible to see how, despite the dynamical difference among the systems and their local controllers parameters, coordination is also achieved in the output of the systems.Local topology: drones trajectories in time and cartesian projection. The trajectories are winding along the conditioned references.
(a)
(b)


#### 6.3.2. Formation Perturbation Rejection with SMRCoord under Local Topology

Simulation results in order to test the formation perturbation rejection properties of the SMRCoorc under local topology can be seen in Figure7. The perturbation consisted in manually stopping the movement of Drone 1 (red line) in the coordinate x and has been incorporated after 20 sec and after 50 sec. It appears as a flattop in the reference (surrounded by a black ellipse in the plot). The strategy rejects the perturbation as the other two drones wait; that is, they stop moving as well in order to keep the formation. As a drawback, comparing with the first plot of Figure 5, the time it takes to finish the desired trajectory is longer because the drones had to wait until the perturbation was gone.Target and conditioned references forx and y components under perturbations in the formation. The black ellipses show the intervals where the perturbation was introduced to Drone 1 (red), and it is possible to see how the other two conditioned references wait for the reference of Drone 1 until the perturbation vanishes, and then the normal course continues.
(a)
(b)


## 6.1. Quadrotors and Controllers

In this example we considered three quadrotors. The kind of motion considered is cartesian (planar motion). Each one has its own local reference conditioning scheme as in Section3.2. Each agent i sends and receives information from the other agents under the local topology and to the supervisor under the global topology and incorporates them as constraints (Definition 5) in the SMRC as proposed in Section 4.


## 6.2. Information Exchange in SMRCoord

The way the information exchange is considered in this work is a key contribution. The main idea is that each system sends key information regarding its local constraints to the other systems by sending its feasible reference. In any of the two topologies, the individual systems hide their states and output to only share the feasible reference with the other systems and thus minimizing the information exchange. The feasible reference contains information of the system and its state regarding the local constraints.


## 6.3. Simulation Results

### 6.3.1. UAV Formation with SMRCoord under Local Topology

First we implement a triangle-shape formation with three drones using the SMRCoord under a local topology. The time evolution of the three agents references (rfi) together with the resulting discontinuous actions (w) is shown in Figure 5.Local topology: conditioned references and discontinuous actions of the individual systems.
(a)
(b)
(c)
(d)
(e)It can be seen that the references are coordinated and follow the target trajectory taking into account the saturation in the drones actuators.In the resulting discontinuous action (plots 3 to 5 in Figure5), it is possible to see that the amplitude in each component is varying with time, as the constraints ϕ also change, depending on the relative positions of the agent between them. Also the amplitude of the discontinuous action is enough to make (21) hold, so that the SM is established in the boundary ∂ϕ.In Figure6, it is possible to see how, despite the dynamical difference among the systems and their local controllers parameters, coordination is also achieved in the output of the systems.Local topology: drones trajectories in time and cartesian projection. The trajectories are winding along the conditioned references.
(a)
(b)


### 6.3.2. Formation Perturbation Rejection with SMRCoord under Local Topology

Simulation results in order to test the formation perturbation rejection properties of the SMRCoorc under local topology can be seen in Figure7. The perturbation consisted in manually stopping the movement of Drone 1 (red line) in the coordinate x and has been incorporated after 20 sec and after 50 sec. It appears as a flattop in the reference (surrounded by a black ellipse in the plot). The strategy rejects the perturbation as the other two drones wait; that is, they stop moving as well in order to keep the formation. As a drawback, comparing with the first plot of Figure 5, the time it takes to finish the desired trajectory is longer because the drones had to wait until the perturbation was gone.Target and conditioned references forx and y components under perturbations in the formation. The black ellipses show the intervals where the perturbation was introduced to Drone 1 (red), and it is possible to see how the other two conditioned references wait for the reference of Drone 1 until the perturbation vanishes, and then the normal course continues.
(a)
(b)


## 6.3.1. UAV Formation with SMRCoord under Local Topology

First we implement a triangle-shape formation with three drones using the SMRCoord under a local topology. The time evolution of the three agents references (rfi) together with the resulting discontinuous actions (w) is shown in Figure 5.Local topology: conditioned references and discontinuous actions of the individual systems.
(a)
(b)
(c)
(d)
(e)It can be seen that the references are coordinated and follow the target trajectory taking into account the saturation in the drones actuators.In the resulting discontinuous action (plots 3 to 5 in Figure5), it is possible to see that the amplitude in each component is varying with time, as the constraints ϕ also change, depending on the relative positions of the agent between them. Also the amplitude of the discontinuous action is enough to make (21) hold, so that the SM is established in the boundary ∂ϕ.In Figure6, it is possible to see how, despite the dynamical difference among the systems and their local controllers parameters, coordination is also achieved in the output of the systems.Local topology: drones trajectories in time and cartesian projection. The trajectories are winding along the conditioned references.
(a)
(b)


## 6.3.2. Formation Perturbation Rejection with SMRCoord under Local Topology

Simulation results in order to test the formation perturbation rejection properties of the SMRCoorc under local topology can be seen in Figure7. The perturbation consisted in manually stopping the movement of Drone 1 (red line) in the coordinate x and has been incorporated after 20 sec and after 50 sec. It appears as a flattop in the reference (surrounded by a black ellipse in the plot). The strategy rejects the perturbation as the other two drones wait; that is, they stop moving as well in order to keep the formation. As a drawback, comparing with the first plot of Figure 5, the time it takes to finish the desired trajectory is longer because the drones had to wait until the perturbation was gone.Target and conditioned references forx and y components under perturbations in the formation. The black ellipses show the intervals where the perturbation was introduced to Drone 1 (red), and it is possible to see how the other two conditioned references wait for the reference of Drone 1 until the perturbation vanishes, and then the normal course continues.
(a)
(b)


## 7. Conclusion

A novel strategy using ideas of set invariance and sliding mode reference conditioning is developed to deal with the coordination of multi-agents and formation control problem. The proposed methodology has an interesting potential to be expanded in order to overcome more general coordination problems. This is inherent to its definition; that is, the coordination goals are reflected in the design of the sliding manifolds.The fact that the individual systems dynamics arehidden to the coordination system, while only the necessary information about the subsystems constraints is communicated to it, makes the proposed methodology transparent and allows dealing with a broad kind of systems to be coordinated, as soon as they can be reference conditioned.Additionally, the features of the SMRC and the SM itself are inherited by the proposal, such as robustness properties of SM control but not the usual problems of SM like chattering, because the technique is implemented as a part of a numeric algorithm in a digital environment.Practical applications of the proposed algorithm, for example, in AR-Drone quadrotors flying in a controlled formation, can be implemented as auxiliary supervisory loops to the trajectory planning algorithm for the virtual leader and stabilizing controllers of the individual agents. The research group is working towards this implementation.In the theoretical side, an interesting future research line on which we are working is on the extensions of the proposed methodology to deal with multiple constraints per system, in which case the problem is how to decide the direction of the control action. Also we are working on the case of constrained systems and how to incorporate these constraints into the coordination in order to have a formation control which also takes care of the individual systems constraint, resulting in a robust formation control against disturbances coming from individual limitations in the multi-agent systems.



---

*Source: 764348-2013-12-29.xml*