This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Safe and Stable Formation Control with Distributed Multi-Agents Using Adaptive Control and Control Barrier Functions

Jose A. Solano-Castellanos1, Peter A. Fisher1, Anuradha Annaswamy1 1 Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. (email: {jsolanoc, pafisher, aanna}@mit.edu). This work was carried out using the support of the Boeing Strategic University Initiative.
Abstract

This manuscript considers the problem of ensuring stability and safety during formation control with distributed multi-agent systems in the presence of parametric uncertainty in the dynamics and limited communication. We propose an integrative approach that combines Control Barrier Functions, Adaptive Control, and connected graphs. A reference model is designed so as to ensure a safe and stable formation control strategy. This is combined with a provably correct adaptive control design that includes the use of a CBF-based safety filter that suitably generates safe reference commands. Numerical examples are provided to support the theoretical derivations.

I Introduction

Multi-agent systems (MAS) have received much attention because of their potential in completing tasks that a single agent could not complete efficiently on their own. Examples include exploration, surveillance, reconnaissance, rescue, and failure-tolerance, which occur in various problems related to motion planning and robotics. Typical problems in the context of MAS include consensus, formation control, coordination, and synchronization. This paper pertains to formation control.

The concept of formation control can be classified into the formation tracking and formation producing. In the former, the agents maintain a desired trajectory while the configuration itself moves through space; this is of interest for problems related to rendezvous in air and space. In the latter, the objective is to converge to a static formation from some initial configuration of the agents, which is useful in tasks of surveillance and more generally sensor deployment. Our paper focuses on the latter. We will focus on a class of dynamic MAS which are subjected to parametric uncertainties, state-space constraints, and limited communication among the agents, and the goal is to achieve a real-time control solution that accomplishes a static formation task.

Several approaches have been reported in the literature to achieve formation control, but with a subset of the above features. The approaches in [1], [2], and [3] have addressed the formation control problem in the presence of parametric uncertainty using adaptive control. No constraints on the state or in the communication among agents are however considered. The solutions in [4], [5], and [6] focus on formation control with limited communication and parametric uncertainties, but do not address obstacles or other state-space constraints. The authors of [7, 8, 9, 10, 11, 12, 13] consider obstacles and formation control with limited communication, but assume full knowledge of the agent dynamics. The authors of [14] and [15] consider obstacles and parametric uncertainty but assume full communication between all agents.

Refer to caption
Figure 1: Graphical representation of the proposed method, where a multi-agent system with limited communication needs to converge to a desired formation while avoiding unsafe regions in the presence of parametric uncertainty in the model.

In contrast to the above papers, the authors of [16, 17, 18] have addressed, as in this paper, formation control for distributed MAS amidst obstacles and parametric uncertainties. However the following distinctions can be made: The results in [16] limit the uncertainty to a constant additive disturbance that is unknown. The solutions in [17] and [18] consider general nonlinear dynamics that is unknown, and employ a neural-network based solution. In this paper, we propose an adaptive control solution for static formation control in the presence of parametric uncertainties, obstacles which introduce safety considerations, and limited communication among agents. The unique features of our proposed solution are (i) the use of a Graph Control Barrier Function that shapes the reference input so as to ensure safety, (ii) the use of a reference model that leverages the communication structure among the distributed MAS, and (iii) an analytically rigorous stability proof that guarantees boundedness of all signals and convergence to the desired formation.

Preliminaries are presented in Section II and the control problem in Section III. The main contribution of this manuscript, the development of an adaptive controller with stability and safety properties, is presented in Section IV. Section V includes numerical simulations. Proofs of the main contributions of the manuscript (Theorems 2 and 3) are presented in the appendix.

II Preliminaries

II-A Graph Theory and Multi-Agent Systems Communication

A graph 𝒢\mathcal{G} is a pair {𝒱,}\{\mathcal{V},\mathcal{E}\} where 𝒱={1,,M}\mathcal{V}=\{1,\cdots,M\} is known as the vertex set which contains the vertices or nodes of the graph (i.e. the agents), and \mathcal{E} is known as the edge set which contains a collection of pairs (i,j)(i,j) denoting the connectivity or communication between vertices ii and jj of the vertex set. The set of neighbors of node ii is denoted as 𝒩i=Δ{j|(i.j)}\mathcal{N}_{i}\overset{\Delta}{=}\{\ j\ |\ (i.j)\in\mathcal{E}\ \}.

A graph is called undirected if node ii communicates with node jj and vice versa, then (i,j)=(j,i)(i,j)=(j,i). Otherwise, the graph is called directed and node ii communicates with node jj but node jj cannot communicate with node ii, i.e. (i,j)(j,i)(i,j)\neq(j,i). A graph is said to be connected if it has a node to which there exists a (directed) path from every other node. For convenience of the following definitions, throughout this manuscript, only undirected graphs are considered.

Definition 1: The degree matrix D(𝒢)M×MD(\mathcal{G})\in\mathbb{R}^{M\times M} of graph 𝒢\mathcal{G} is a diagonal matrix whose diagonal entries diid_{ii} are equal to the number of neighbors of agent ii, i.e. |𝒩i||\mathcal{N}_{i}|111|||\cdot| denotes the cardinality of the set..

Definition 2: The adjacency matrix A(𝒢)M×MA(\mathcal{G})\in\mathbb{R}^{M\times M} of graph 𝒢\mathcal{G} is a matrix whose diagonal entries are zero and the off diagonal entries aija_{ij} are given by

aij={1if(i,j)0if(i,j)a_{ij}=\begin{cases}1&\text{if}\ (i,j)\in\mathcal{E}\\ 0&\text{if}\ (i,j)\notin\mathcal{E}\end{cases} (1)

Definition 3: The Laplacian matrix L(𝒢)M×ML(\mathcal{G})\in\mathbb{R}^{M\times M} of graph 𝒢\mathcal{G} is defined as

L(𝒢)=ΔD(𝒢)A(𝒢)L(\mathcal{G})\overset{\Delta}{=}D(\mathcal{G})-A(\mathcal{G}) (2)

Notice that the sum of the rows and columns of the Laplacian matrix add up to zero, therefore α𝟏M\alpha\mathbf{1}\in\mathbb{R}^{M}, for all α\alpha\in\mathbb{R}, lies on the right and left null space of LL. The Laplacian matrix is a symmetric positive semi-definite matrix (L𝐒+ML\in\mathbf{S}^{M}_{+}). Furthermore, if the graph is connected, the Laplacian has M1M-1 non-zero eigenvalues, i.e. λMλ2>λ1=0\lambda_{M}\geq\cdots\geq\lambda_{2}>\lambda_{1}=0 [19].

II-B Control Barrier Functions

Consider a nonlinear control system that is affine in control

x˙(t)=f(x(t))+g(x(t))u(t)\dot{x}(t)=f(x(t))+g(x(t))u(t) (3)

where x(t)𝒳nx(t)\in\mathcal{X}\subset\mathbb{R}^{n}, f:𝒳nf:\mathcal{X}\rightarrow\mathbb{R}^{n} and g:𝒳ng:\mathcal{X}\rightarrow\mathbb{R}^{n} are locally Lipschitz, and u(t)𝒰mu(t)\in\mathcal{U}\subseteq\mathbb{R}^{m}. Safety can be defined in terms of a continuously differentiable function h:𝒳h:\mathcal{X}\rightarrow\mathbb{R} and a set 𝒮𝒳\mathcal{S}\subset\mathcal{X}, such that

𝒮=Δ{x(t)𝒳|h(x(t))0}\displaystyle\mathcal{S}\overset{\Delta}{=}\{\ x(t)\in\mathcal{X}\ |\ h(x(t))\geq 0\ \} (4a)
𝒮=Δ{x(t)𝒳|h(x(t))=0}\displaystyle\partial\mathcal{S}\overset{\Delta}{=}\{\ x(t)\in\mathcal{X}\ |\ h(x(t))=0\ \} (4b)
int(𝒮)=Δ{x(t)𝒳|h(x(t))>0}\displaystyle\text{int}(\mathcal{S})\overset{\Delta}{=}\{\ x(t)\in\mathcal{X}\ |\ h(x(t))>0\ \} (4c)

The notion of a CBF [20, 21, 22] can be formulated such that its existence allows the system in (3) to be rendered safe with respect to 𝒮\mathcal{S} in the sense that the set is made weakly positively invariant for some input u(t)u(t). The following definition formalizes this notion.

Definition 4 [21]: Let 𝒮𝒳\mathcal{S\subset\mathcal{X}} be the zero-superlevel set of h:𝒳h:\mathcal{X}\rightarrow\mathbb{R}. The function hh is a Zeroing Control Barrier Function (ZCBF) for 𝒮\mathcal{S}, if there exists an extended class kappa function, α(h(x(t)))𝒦\alpha(h(x(t)))\in\mathcal{K_{\infty}}, such that for the system (3) it can be obtained that:

supu𝒰[Lfh(x(t))+Lgh(x(t))u(t)]αh((x(t)))\sup_{u\in\mathcal{U}}\left[L_{f}h(x(t))+L_{g}h(x(t))u(t)\right]\geq-\alpha h((x(t))) (5)

for all x(t)𝒮x(t)\in\mathcal{S}, where LχhL_{\chi}h is the Lie derivative of hh with respect to χ\chi.

For ease of exposition, the time dependency will not be made explicit going forward unless a new variable is introduced or it is relevant to the presented argument.

III The Control Problem

The problem we consider is this paper is the static formation control of distributed MAS consisting of MM agents indexed by i𝒱={1,,M}i\in\mathcal{V}=\{1,\ \cdots,M\}, in the presence of parametric uncertainties and obstacles, with the goal of ensuring stability and safety. The dynamics of agent ii are given by

x˙i=Axi+B[Λui+Ξω]\dot{x}_{i}=Ax_{i}+B\left[\Lambda u_{i}+\Xi\omega\right] (6)

where xi(t)nx_{i}(t)\in\mathbb{R}^{n} is the state of the agent, ui(t)mu_{i}(t)\in\mathbb{R}^{m} is the control input of the agent. An×nA\in\mathbb{R}^{n\times n} is unknown, Λm×m\Lambda\in\mathbb{R}^{m\times m} is an unknown diagonal matrix with known sign, and Bn×mB\in\mathbb{R}^{n\times m} is known and it has full column rank. The term Ξω\Xi\omega corresponds to nonlinearities present in the system where ω(xi,t)p\omega(x_{i},t)\in\mathbb{R}^{p} is known, but Ξm×p\Xi\in\mathbb{R}^{m\times p} is unknown. For ease of exposition, we assume that A,ΛA,\ \Lambda and Ξ\Xi are independent of ii; extensions to the case when they depend on ii are straightforward. We introduce the following assumptions regarding the unknown parameters and nonlinearities in the dynamics:

Assumption 1: The matrix sign(Λ)Λ\text{sign}(\Lambda)\Lambda is diagonal and positive definite, sign(Λ)Λ𝐒++m\text{sign}(\Lambda)\Lambda\in\mathbf{S}_{++}^{m}.

Assumption 2: The nonlinearity ω(xi,t)\omega(x_{i},t) is a bounded signal for all tt0t\geq t_{0}.

Assumption 3: A constant matrix θ1m×n\theta^{\star}_{1}\in\mathbb{R}^{m\times n} exist such that

A+BΛθ1=AmA+B\Lambda\theta^{\star}_{1}=A_{m} (7)

where Amn×nA_{m}\in\mathbb{R}^{n\times n} is a known Hurwitz matrix (Section IV-A1).

In addition to the parametric uncertainties, we assume that the problem has safety considerations in the form of state constraints. We now introduce the following definition that pertains to the safety of MAS.

Definition 5 [12]: A continuously differentiable function h:𝒳Mh:\mathcal{X}^{M}\rightarrow\mathbb{R} is referred as a Graph Control Barrier Function (GCBF) if there exists α(h(𝐱𝒩i(t)))𝒦\alpha(h(\mathbf{x}_{\mathcal{N}_{i}}(t)))\in\mathcal{K}_{\infty} and a control law ki:𝒳M𝒰mk_{i}:\mathcal{X}^{M}\rightarrow\mathcal{U}\subseteq\mathbb{R}^{m} for each agent i𝒱i\in\mathcal{V} of the MAS, such that

h˙(𝐱𝒩i(t))α(h(𝐱𝒩i(t))),i𝒱\dot{h}(\mathbf{x}_{\mathcal{N}_{i}}(t))\geq-\alpha(h(\mathbf{x}_{\mathcal{N}_{i}}(t))),\ \forall i\in\mathcal{V} (8)

where

h˙(𝐱𝒩i(t))=j𝒩i[Lfh(xj(t))+Lgh(xj(t))uj(t)]\dot{h}(\mathbf{x}_{\mathcal{N}_{i}}(t))=\sum_{j\in\mathcal{N}_{i}}\left[L_{f}h(x_{j}(t))+L_{g}h(x_{j}(t))u_{j}(t)\right] (9)

for uj(t)=kj(𝐱𝒩i(t))u_{j}(t)=k_{j}(\mathbf{x}_{\mathcal{N}_{i}}(t)) where 𝐱𝒩i\mathbf{x}_{\mathcal{N}_{i}} is the joint state of the agents in neighbor set 𝒩i\mathcal{N}_{i}.

The state constraints are captured by the safe set SiS_{i} for each agent i𝒱i\in\mathcal{V} which corresponds to the obstacle-free region of the state space. Associated with this safe set is a GCBF h(xi)h(x_{i}), which implies the existence of a uiu_{i} in (6) that guarantees (8). We assume that the GCBF hh satisfies conditions in [23] such that the resulting controller is Lipschitz.

The overall problem statement is therefore the following: given that the initial condition xi(t0)𝒮ix_{i}(t_{0})\in\mathcal{S}_{i} for all i𝒱i\in\mathcal{V} and a desired position in the static formation xi𝒮ix_{i}^{\star}\in\mathcal{S}_{i} for all i𝒱i\in\mathcal{V}, the problem is to find a control policy of the form

ui=ki(xi,xj|j𝒩i)u_{i}=k_{i}(x_{i},x_{j}\ |\ j\in\mathcal{N}_{i}) (10)

that guarantees that xi(t)𝒮ix_{i}(t)\in\mathcal{S}_{i} for all tt0t\geq t_{0}, and xi(t)xix_{i}(t)\rightarrow x_{i}^{\star} in the presence of unknown parameters. In addition, we require that each control policy ki:[n]|𝒩i|+1mk_{i}:[\mathbb{R}^{n}]^{|\mathcal{N}_{i}|+1}\rightarrow\mathbb{R}^{m} of agent ii must depend only on its own state xix_{i} and the state of neighboring agents xjx_{j}, for j𝒩ij\in\mathcal{N}_{i}.

IV A Safe and Stable Adaptive Controller for Static Formation

The controller that we propose includes an adaptive component and a safety filter. In order to guide the adaptive control design, a reference model is suitably chosen. In Section IV-A, we design such a reference model, the corresponding adaptive controller, and show that the adaptive controller can enable the MAS to reach a desired formation. In Section IV-B, we integrate a safety filter into the whole adaptive control design and show that the desired formation can be reached even while ensuring the safety constraints. The corresponding results are stated in Theorem 2, Corollary 1, and Theorem 3.

IV-A Stable Formation Control

IV-A1 Reference Model

The starting point for the adaptive solution to the MAS formation control is the choice of a reference model which specifies the desired trajectory that the MAS should follow. For this purpose, we propose a reference model dynamics similar to that in [24, 25]:

z˙i=Amzi+Bu¯i\displaystyle\dot{z}_{i}=A_{m}z_{i}+B\bar{u}_{i} (11a)
u¯i=Θ[j𝒩i(zjzi)Δi]\displaystyle\bar{u}_{i}=\Theta\left[\sum_{j\in\mathcal{N}_{i}}(z_{j}-z_{i})-\Delta_{i}\right] (11b)

where zi(t)nz_{i}(t)\in\mathbb{R}^{n} is the state of the reference model , Amn×nA_{m}\in\mathbb{R}^{n\times n} is a Hurwitz matrix, Δi(t)n\Delta_{i}(t)\in\mathbb{R}^{n} is the reference input vector, and Θm×n\Theta\in\mathbb{R}^{m\times n} is a constant control gain. The choice of Δi\Delta_{i} is dictated by the static formation that is of interest. The gain Θ\Theta ensures that the closed-loop reference system remains stable, for a given graph 𝒢\mathcal{G}.

The following theorem clarifies the conditions under which the reference model (11a), (11b) leads to the desired formation [25].

Theorem 1 [25]: If the graph that captures the communication among agents (𝒢\mathcal{G}) is connected, i.e. λ2>0\lambda_{2}>0, then a choice of Θ\Theta

Θ=cBTR1\Theta=cB^{T}R^{-1} (12)

where R𝐒++nR\in\mathbf{S}^{n}_{++} is the solution of

AmTR+RAm2BBT+Q0=0\displaystyle A_{m}^{T}R+RA_{m}-2BB^{T}+Q_{0}=0 (13a)
c1/λ2\displaystyle c\geq 1/\lambda_{2} (13b)

for a given Q0𝐒++nQ_{0}\in\mathbf{S}^{n}_{++}, and a choice of the reference input

Δi(t)=j𝒩iδij\Delta_{i}(t)=\sum_{j\in\mathcal{N}_{i}}\delta_{ij}^{\star} (14)

for all tt0t\geq t_{0}, where δij=Δxixj\delta_{ij}^{\star}\overset{\Delta}{=}x_{i}^{\star}-x_{j}^{\star}, ensures that zi(t)z_{i}(t) converges to the desired formation xix_{i}^{\star}, for all i𝒱i\in\mathcal{V}.

Remark 1: The result of Theorem 1 holds if the communication graph (𝒢\mathcal{G}) varies with time as long as it remains connected.

IV-A2 Adaptive Controller

The input uiu_{i} in (6) is determined using an adaptive control approach:

ui=θ^1(i)xi+θ^2(i)[j𝒩i(xjxi)Δi]+θ^3(i)ωu_{i}=\hat{\theta}^{(i)}_{1}x_{i}+\hat{\theta}^{(i)}_{2}\left[\sum_{j\in\mathcal{N}_{i}}(x_{j}-x_{i})-\Delta_{i}\right]+\hat{\theta}^{(i)}_{3}\omega (15)

where θ^k(i)(t)\hat{\theta}^{(i)}_{k}(t) for k={1,2,3}k=\{1,2,3\} are time-varying parameters that are adjusted. Defining the following unknown parameters:

θ2=ΔΛ1Θ\theta_{2}^{\star}\overset{\Delta}{=}-\Lambda^{-1}\Theta (16)
θ3=ΔΛ1Ξ\theta_{3}^{\star}\overset{\Delta}{=}-\Lambda^{-1}\Xi (17)

where θ2m×n\theta^{\star}_{2}\in\mathbb{R}^{m\times n} and θ3m×p\theta^{\star}_{3}\in\mathbb{R}^{m\times p}, we make the following important observations about the controller in (15). First, it satisfies the communication constraints in (10). Second, a choice of θ^k(i)=θk\hat{\theta}_{k}^{(i)}=\theta_{k}^{*}, for all i=𝒱i=\mathcal{V} and k={1,2,3}k=\{1,2,3\}, guarantees that the closed-loop system specified by the plant in (6) and the controller in (15) matches the reference model in (11a)-(11b). The adjustable parameters θ^k(i)\hat{\theta}_{k}^{(i)} are introduced for different purposes: θ^1(i)\hat{\theta}^{(i)}_{1} is utilized for stabilizing the linear dynamics, θ^2(i)\hat{\theta}^{(i)}_{2} is used to enable convergence to the desired formation, while θ^3(i)\hat{\theta}^{(i)}_{3} is used to compensate for the nonlinearities.

We propose the adaptive laws:

θ^˙1(i)=Γ1ΩixiT\displaystyle\dot{\hat{\theta}}^{(i)}_{1}=-\Gamma_{1}\Omega_{i}x_{i}^{T} (18a)
θ^˙2(i)=Γ2Ωi[j𝒩i(xjxi)Δi]T\displaystyle\dot{\hat{\theta}}^{(i)}_{2}=-\Gamma_{2}\Omega_{i}\left[\sum_{j\in\mathcal{N}_{i}}(x_{j}-x_{i})-\Delta_{i}\right]^{T} (18b)
θ^˙3(i)=Γ3ΩiωT\displaystyle\dot{\hat{\theta}}^{(i)}_{3}=-\Gamma_{3}\Omega_{i}\omega^{T} (18c)

where Ωi=Δsign(Λ)BTP(xizi)\Omega_{i}\overset{\Delta}{=}\text{sign}(\Lambda)B^{T}P(x_{i}-z_{i}), Γk𝐒++m\Gamma_{k}\in\mathbf{S}^{m}_{++} for all k={1,2,3}k=\{1,2,3\}, and a Q𝐒++nQ\in\mathbf{S}^{n}_{++} is chosen so that

AmTP+PAm+Q=0\displaystyle A_{m}^{T}P+PA_{m}+Q=0 (19a)
R1BBTP+PBBTR10\displaystyle R^{-1}BB^{T}P+PBB^{T}R^{-1}\succeq 0 (19b)

where RR is given by (13a).

We now state the first main result of the paper, whose proof can be found in the appendix.

Theorem 2: The closed-loop adaptive system defined by the agent dynamics in (6), the control input (15) and the adaptation laws in (18) has globally bounded solutions for any initial conditions xi(t0)x_{i}(t_{0}) and θ^k(i)(t0)\hat{\theta}^{(i)}_{k}(t_{0}), for all i𝒱i\in\mathcal{V} and k={1,2,3}k=\{1,2,3\}. Furthermore xi(t)x_{i}(t) converges to the desired final position xix_{i}^{\star}, for all i𝒱i\in\mathcal{V}, as tt\rightarrow\infty.

Remark 2: The solution for PP in (19a)-(19b) can be obtained using LMI approaches, with QQ and Q0Q_{0} as decision variables.

We now introduce an important property of this adaptive controller which helps us integrate the CBF-filter in to the control design in order to ensure safety constraints on the state. We define the following variables

𝐞(t)=Δ𝐱(t)𝐳(t)\mathbf{e}(t)\overset{\Delta}{=}\mathbf{x}(t)-\mathbf{z}(t) (20)
θ~=Δ[θ~1(1)θ~2(1)θ~3(1)θ~1(m)θ~2(m)θ~3(m)]\tilde{\mathbf{\theta}}\overset{\Delta}{=}\left[\tilde{\theta}_{1}^{(1)}\ \tilde{\theta}_{2}^{(1)}\ \tilde{\theta}_{3}^{(1)}\ \cdots\ \tilde{\theta}_{1}^{(m)}\ \tilde{\theta}_{2}^{(m)}\ \tilde{\theta}_{3}^{(m)}\right] (21)

where 𝐳(t)=Δ[z1T,,zMT]T\mathbf{z}(t)\overset{\Delta}{=}[z_{1}^{T},\ \cdots,z_{M}^{T}]^{T} is the joint state of the reference model, 𝐱=Δ[x1TxMT]T\mathbf{x}\overset{\Delta}{=}[x_{1}^{T}\cdots x_{M}^{T}]^{T} is the joint state of the system, and θ~k(i)(t)=Δθ^k(i)(t)θk\tilde{\theta}^{(i)}_{k}(t)\overset{\Delta}{=}\hat{\theta}^{(i)}_{k}(t)-\theta^{\star}_{k}, for all i𝒱i\in\mathcal{V} and k={1,2,3}k=\{1,2,3\}, are the parameter errors. We then define bounds CθC_{\theta}, CΛC_{\Lambda}, and CeC_{e} given by θ~(t0)FCθ||\tilde{\mathbf{\theta}}(t_{0})||_{F}\leq C_{\theta}, ΛFCΛ||\Lambda||_{F}\leq C_{\Lambda} and 𝐞(t0)Ce||\mathbf{e}(t_{0})||\leq C_{e}. With these bounds, we introduce the following corollary to Theorem 2:

Corollary 1: For any bounded δij\delta_{ij}^{\star}, the following properties of 𝐞(t)\mathbf{e}(t) hold:

  1. i)

    For all tt0t\geq t_{0}, 𝐞(t)E||\mathbf{e}(t)||\leq E where

    E=(λmax(P)Ce2+CΛCθ2γ)1λmin(P)E=\sqrt{\left(\lambda_{max}(P)C_{e}^{2}+C_{\Lambda}\frac{C_{\theta}^{2}}{\gamma}\right)\frac{1}{\lambda_{min}(P)}} (22)

    and γ=Δmax(λmax(Γ1),λmax(Γ2),λmax(Γ3))\gamma\overset{\Delta}{=}\max(\lambda_{max}(\Gamma_{1}),\lambda_{max}(\Gamma_{2}),\lambda_{max}(\Gamma_{3}))

  2. ii)

    There exists a finite time TT such that for any ϵ\epsilon, 𝐞(t)ϵ||\mathbf{e}(t)||\leq\epsilon, for all tt0+Tt\geq t_{0}+T

Remark 3: Both Corollary 1(i) and 1(ii) follow from the stability properties of the adaptive system. Corollary 1(i) states that 𝐞(t)\mathbf{e}(t) is always bounded, while Corollary 1(ii) states that 𝐞(t)\mathbf{e}(t) becomes arbitrarily small after a finite time TT. The corresponding bounds EE and ϵ\epsilon will be directly leveraged in designing the safety-inducing CBF filter introduced in the next section.

Remark 4: We note that the bound EE depends on CθC_{\theta} and CΛC_{\Lambda}, which in turn can be estimated from known upper bounds on the unknown parameters Λ\Lambda and θk(i)\theta^{(i)\star}_{k}, for all i𝒱i\in\mathcal{V} and k{1,2,3}k\in\{1,2,3\}. This in turn implies that a known bound EE can be determined. Such a bound will be utilized in the GCBF introduced in the next section.

IV-B Safe and Stable Formation Control

In order to ensure the safety of the closed-loop dynamics, we first consider safety of the reference dynamics in (11a), (11b). That is, we want to ensure that zi(t)𝒮iz_{i}(t)\in\mathcal{S}_{i} for all tt0t\geq t_{0} if zi(t0)𝒮iz_{i}(t_{0})\in\mathcal{S}_{i}. A choice of a QP-GCBF filter inspired by [22], ensures this safety

argminΔi\displaystyle\operatorname*{argmin}_{\Delta_{i}} ΔiΔi22\displaystyle\quad||\Delta_{i}-\Delta^{\star}_{i}||_{2}^{2} (23)
subjectto\displaystyle\operatorname*{subject\ to} hziTz˙iα0(h(zi)υ)\displaystyle\quad\frac{\partial h}{\partial z_{i}}^{T}\dot{z}_{i}\geq-\alpha_{0}(h(z_{i})-\upsilon)

where

Δi=Δj𝒩iδij\Delta_{i}^{\star}\overset{\Delta}{=}\sum_{j\in\mathcal{N}_{i}}\delta_{ij}^{\star} (24)

α0++\alpha_{0}\in\mathbb{R}_{++}, υ++\upsilon\in\mathbb{R}_{++} is a safety buffer, and hh is a GCBF that is a function of only the state of agent ii and the parameters of the obstacle. We denote the solution of (23),(24) as Δiψ(t)n\Delta_{i}^{\psi}(t)\in\mathbb{R}^{n}.

Remark 5: It is important to note that the QP-GCBF filter above can be solved in a decentralized manner. This is due to the fact the lumped quantity Δi\Delta_{i} is used as the decision variable rather than the relative distances δij\delta_{ij}, and due to the fact that the GCBF hh is a function of only the state of agent ii and the parameters of the obstacle. Together they allow a decentralized solution to the QP-GCBF filter.

We now proceed to address the safety of the actual closed-loop dynamics of (6) with the adaptive controller given by (15)-(19b). For this purpose, we note two points. First, the addition of a safety filter as in (23),(24) produces a new reference Δiψ\Delta_{i}^{\psi} rather than the one in (14). Second, Corollary 1 implies that the adaptive system state xi(t)x_{i}(t) approaches the reference state zi(t)z_{i}(t) and therefore h(xi(t))h(x_{i}(t)) approaches h(zi(t))h(z_{i}(t)) as tt\rightarrow\infty. In order to account for the difference between the system state and the reference state for all time tt0t\geq t_{0}, we modify the QP-GCBF filter from (23),(24) as follows:

argminΔi\displaystyle\operatorname*{argmin}_{\Delta_{i}} ΔiΔi22\displaystyle\quad||\Delta_{i}-\Delta^{\star}_{i}||_{2}^{2} (25)
subjectto\displaystyle\operatorname*{subject\ to} hziTz˙i\displaystyle\quad\frac{\partial h}{\partial z_{i}}^{T}\dot{z}_{i}\geq
{α0(h(zi(t))Eh),t0t<t0+Tα0(h(zi(t))υ),tt0+T\displaystyle\begin{cases}-\alpha_{0}(h(z_{i}(t))-E_{h}),&t_{0}\leq t<t_{0}+T\\ -\alpha_{0}(h(z_{i}(t))-\upsilon),&t\geq t_{0}+T\end{cases}

where υ\upsilon is such that |eh,i(t)|=|h(xi(t))h(zi(t))|υ|e_{h,i}(t)|=|h(x_{i}(t))-h(z_{i}(t))|\leq\upsilon for all i𝒱i\in\mathcal{V} and tt0+Tt\geq t_{0}+T, Eh=ΔκE|eh,i(t)|E_{h}\overset{\Delta}{=}\kappa E\geq|e_{h,i}(t)| for all i𝒱i\in\mathcal{V} and tt0t\geq t_{0}, and α0++\alpha_{0}\in\mathbb{R}_{++} is any finite constant. EE is given by (22) and κ\kappa is the Lipschitz constant of hh. That such finite T,υ,E,T,\upsilon,E, and EhE_{h} exist follows from Theorem 2 and Corollary 1.

The complete integrative safe and stable adaptive controller is given by (15)-(19b), but with (15) and (18b) replaced by a modified control input (26) and a modified adaptive law (27), respectively, which are given by

ui=θ^1(i)xi+θ^2(i)[j𝒩i(xjxi)Δiψ]+θ^3(i)ωu_{i}=\hat{\theta}^{(i)}_{1}x_{i}+\hat{\theta}^{(i)}_{2}\left[\sum_{j\in\mathcal{N}_{i}}(x_{j}-x_{i})-\Delta_{i}^{\psi}\right]+\hat{\theta}^{(i)}_{3}\omega (26)
θ^˙2(i)=Γ2Ωi[j𝒩i(xjxi)Δiψ]T\dot{\hat{\theta}}^{(i)}_{2}=-\Gamma_{2}\Omega_{i}\left[\sum_{j\in\mathcal{N}_{i}}(x_{j}-x_{i})-\Delta_{i}^{\psi}\right]^{T} (27)

and Δiψ\Delta_{i}^{\psi} is the solution of the modified QP-GCBF filter in (25).

The addition of the larger buffer EhE_{h} during the initial transients for t[t0,t0+T]t\in[t_{0},t_{0}+T] guarantees the safety of the adaptive system. This is formally stated in Theorem 3, whose proof can be found in the appendix.

Theorem 3: The closed-loop adaptive system defined by the plant in (6), the reference model (11a), (11b) with Δi\Delta_{i} replaced by Δiψ\Delta_{i}^{\psi}, the solution of the modified QP-GCBF in (25), and the adaptive controller given by (26), (18a), (27), (18c), (19a) and (19b) guarantees that xi(t)𝒮ix_{i}(t)\in\mathcal{S}_{i} for all tt0t\geq t_{0}, if xi(t0)𝒮ix_{i}(t_{0})\in\mathcal{S}_{i} for all i𝒱i\in\mathcal{V}. Further, xi(t)xix_{i}(t)\rightarrow x_{i}^{\star} as tt\rightarrow\infty if xi𝒮ix_{i}^{\star}\in\mathcal{S}_{i} for all i𝒱i\in\mathcal{V}.

V Simulation

The proposed controller is applied to a two-dimensional obstacle avoidance problem. The dynamics of each agent are given by

[x˙iy˙i]=[0.25000.25][xiyi]+[1.5001.5][Λui+Ξω]\left[\begin{matrix}\dot{x}_{i}\\ \dot{y}_{i}\end{matrix}\right]=\left[\begin{matrix}0.25&0\\ 0&0.25\end{matrix}\right]\left[\begin{matrix}x_{i}\\ y_{i}\end{matrix}\right]+\left[\begin{matrix}1.5&0\\ 0&1.5\end{matrix}\right]\left[\Lambda u_{i}+\Xi\omega\right] (28)

such that xix_{i} and yiy_{i} are respectively the horizontal and vertical positions of the agents, actuation has been compromised (Λ=0.7I\Lambda=0.7I) and the nonlinearities are characterized by

Ξ=[0.250.10.10.25]\Xi=\left[\begin{matrix}0.25&-0.1\\ -0.1&0.25\end{matrix}\right] (29)
ω(xi,yi,t)=[sign(xi)cos(5t)sign(yi)sin(5t)]T\omega(x_{i},y_{i},t)=\left[\text{sign}(x_{i})\cos(5t)\ \text{sign}(y_{i})\sin(5t)\right]^{T} (30)

The reference model is defined by

Am=[2002]A_{m}=\left[\begin{matrix}-2&0\\ 0&-2\end{matrix}\right] (31)

and the communication graph shown in Fig. 2. To guarantee the safety of each agent, the following CBF constraint is chosen for each obstacle

hl(xi,yi)=(xix¯l)2+(yiy¯l)2rl20h_{l}(x_{i},y_{i})=(x_{i}-\bar{x}_{l})^{2}+(y_{i}-\bar{y}_{l})^{2}-r_{l}^{2}\geq 0 (32)

where (x¯l,y¯l)(\bar{x}_{l},\bar{y}_{l}) and rlr_{l} are the position and radius of the l-th circular obstacle.

The parameters θ^k(i)\hat{\theta}_{k}^{(i)}, for all i𝒱i\in\mathcal{V} and k={1,2,3}k=\{1,2,3\}, are initialized assuming the agents dynamics are given by

[x˙iy˙i]=A¯[xiyi]+[1.5001.5][Λ¯ui+Ξ¯ω]\left[\begin{matrix}\dot{x}_{i}\\ \dot{y}_{i}\end{matrix}\right]=\bar{A}\left[\begin{matrix}x_{i}\\ y_{i}\end{matrix}\right]+\left[\begin{matrix}1.5&0\\ 0&1.5\end{matrix}\right]\left[\bar{\Lambda}u_{i}+\bar{\Xi}\omega\right] (33)

where A¯=0.16I\bar{A}=0.16I, Λ¯=I\bar{\Lambda}=I, and

Ξ¯=[0.350.150.150.35]\bar{\Xi}=\left[\begin{matrix}0.35&-0.15\\ -0.15&0.35\end{matrix}\right] (34)

Fig. 3 shows the trajectories of the agents using only the adaptive control described in Section IV-A2 without any safety filter. Fig. 4 shows the trajectories of the agents with the modified QP-GCBF filter in (25) but without adaptation. Finally, Fig. 5 shows our proposed integrative adaptive controller with the modified GCBF and the graph-based reference model as in (11). For the last figure, a Eh=0.6E_{h}=0.6, α0=15\alpha_{0}=15 and υ=0.05\upsilon=0.05 were chosen. The superior performance of our proposed controller compared with adaptation but no safety as well as safety but with no adaptation is clear from these figures. When the adaptive controller is employed but without any CBF, agent 2 collides with an obstacle along the trajectory (Fig. 3). Only using the modified GCBF but without adaptation allows the MAS to remain safe, but the agents do not reach the desired formation (Fig. 4). In contrast, with our proposed approach in this paper, agents reach the desired formation without collision (Fig. 5). We refer the reader to aaclab.mit.edu for animations of the results. It was observed that a larger EhE_{h}, that can be determined using known upper bounds on the parametric uncertainties, led to a more conservative performance with the trajectories staying far from the obstacle during the transient phase of the adaptation.

It’s crucial to emphasize that the system successfully accomplishes the task without collisions, despite operating under unstable dynamics and partially known nonlinearities. Furthermore, it manages to do so even when the actuation is compromised in an unknown manner.

Refer to caption
Figure 2: Multi-agent system communication graph for the obstacle avoidance example.
Refer to caption
Figure 3: Trajectory of the multi-agent system in the presence of obstacles, using only the adaptive controller.
Refer to caption
Figure 4: Trajectory of the multi-agent system in the presence of obstacles, using only the safety filter.
Refer to caption
Figure 5: Trajectory of the multi-agent system in the presence of obstacles, using the proposed adaptive controller with control barrier functions.

VI Conclusions

In this paper, we consider the problem of static formation control with distributed MAS in the presence of parametric uncertainties and limited communication. The class of problems considered is nonlinear systems that are feedback linearizable, with states accessible for measurement. The goal is to ensure that the MAS stay inside a safe set with the overall closed-loop system remaining stable while meeting the formation goals. Our approach is a combination of adaptive control and control barrier functions, with the former providing a means for accommodating to parametric uncertainties and the latter providing a safety filter that ensures that the states stay within a safe region and remain forward-invariant. The innovations are the design of a GCBF suitably modified to account for parametric uncertainties and the design of a graph-based reference model which serves as a desired dynamics that ensures a safe formation. Theoretical results are provided that guarantee global boundedness and safety against obstacles in the overall state space, and convergence to the desired formation. Numerical results show the effectiveness of the proposed method.

References

  • [1] E. Lavretsky, N. Hovakimyan, A. Calise, and V. Stepanyan, “Adaptive Vortex Seeking Formation Flight Neurocontrol,” in AIAA Guidance, Navigation, and Control Conference and Exhibit, (Reston, Virigina), American Institute of Aeronautics and Astronautics, 8 2003.
  • [2] Z. T. Dydek, A. M. Annaswamy, and E. Lavretsky, “Adaptive configuration control of multiple UAVs,” Control Engineering Practice, vol. 21, no. 8, pp. 1043–1052, 2013.
  • [3] R. Li, L. Zhang, L. Han, and J. Wang, “Multiple Vehicle Formation Control Based on Robust Adaptive Control Algorithm,” IEEE Intelligent Transportation Systems Magazine, vol. 9, no. 2, pp. 41–51, 2017.
  • [4] X. Cai and M. d. Queiroz, “Adaptive Rigidity-Based Formation Control for Multirobotic Vehicles With Dynamics,” IEEE Transactions on Control Systems Technology, vol. 23, no. 1, pp. 389–396, 2015.
  • [5] N. Xuan-Mung and S. K. Hong, “Robust adaptive formation control of quadcopters based on a leader–follower approach,” International Journal of Advanced Robotic Systems, vol. 16, p. 1729881419862733, 7 2019.
  • [6] W. Wang, J. Huang, C. Wen, and H. Fan, “Distributed adaptive control for consensus tracking with application to formation control of nonholonomic mobile robots,” Automatica, vol. 50, no. 4, pp. 1254–1263, 2014.
  • [7] L. Dai, Q. Cao, Y. Xia, and Y. Gao, “Distributed MPC for formation of multi-agent systems with collision avoidance and obstacle avoidance,” Journal of the Franklin Institute, vol. 354, no. 4, pp. 2068–2085, 2017.
  • [8] A. Wasik, J. N. Pereira, R. Ventura, P. U. Lima, and A. Martinoli, “Graph-based distributed control for adaptive multi-robot patrolling through local formation transformation,” in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1721–1728, 2016.
  • [9] J. F. Flores-Resendiz, D. Avilés, and E. Aranda-Bricaire, “Formation Control for Second-Order Multi-Agent Systems with Collision Avoidance,” Machines, vol. 11, no. 2, 2023.
  • [10] J. Fu, G. Wen, X. Yu, and Z. G. Wu, “Distributed Formation Navigation of Constrained Second-Order Multiagent Systems With Collision Avoidance and Connectivity Maintenance,” IEEE Transactions on Cybernetics, vol. 52, no. 4, pp. 2149–2162, 2022.
  • [11] L. Wang, A. D. Ames, and M. Egerstedt, “Safety Barrier Certificates for Collisions-Free Multirobot Systems,” IEEE Transactions on Robotics, vol. 33, no. 3, pp. 661–674, 2017.
  • [12] S. Zhang, K. Garg, and C. Fan, “Neural Graph Control Barrier Functions Guided Distributed Collision-avoidance Multi-agent Control,” in Conference on Robot Learning, 2023.
  • [13] S. Zhang, O. So, K. Garg, and C. Fan, “GCBF+: A Neural Graph Control Barrier Function Framework for Distributed Safe Multi-Agent Control,” 1 2024.
  • [14] Y. Zhou, F. Lu, G. Pu, X. Ma, R. Sun, H. Y. Chen, and X. Li, “Adaptive Leader-Follower Formation Control and Obstacle Avoidance via Deep Reinforcement Learning,” in 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4273–4280, 2019.
  • [15] A. Parvareh, M. Naderi Soorki, and A. Azizi, “The Robust Adaptive Control of Leader–Follower Formation in Mobile Robots with Dynamic Obstacle Avoidance,” Mathematics, vol. 11, no. 20, 2023.
  • [16] X. Yang and X. Fan, “A Distributed Formation Control Scheme with Obstacle Avoidance for Multiagent Systems,” Mathematical Problems in Engineering, vol. 2019, p. 3252303, 2019.
  • [17] X. Ge, Q. L. Han, J. Wang, and X. M. Zhang, “A Scalable Adaptive Approach to Multi-Vehicle Formation Control with Obstacle Avoidance,” IEEE/CAA Journal of Automatica Sinica, vol. 9, no. 6, pp. 990–1004, 2022.
  • [18] Q. Shi, T. Li, J. Li, C. L. P. Chen, Y. Xiao, and Q. Shan, “Adaptive leader-following formation control with collision avoidance for a class of second-order nonlinear multi-agent systems,” Neurocomputing, vol. 350, pp. 282–290, 2019.
  • [19] R. Merris, “Laplacian matrices of graphs: a survey,” Linear Algebra and its Applications, vol. 197-198, pp. 143–176, 1 1994.
  • [20] S. Prajna and A. Jadbabaie, “Safety Verification of Hybrid Systems Using Barrier Certificates,” in Hybrid Systems: Computation and Control (R. Alur and G. J. Pappas, eds.), (Berlin, Heidelberg), pp. 477–492, Springer Berlin Heidelberg, 2004.
  • [21] A. D. Ames, J. W. Grizzle, and P. Tabuada, “Control barrier function based quadratic programs with application to adaptive cruise control,” in 53rd IEEE Conference on Decision and Control, pp. 6271–6278, 2014.
  • [22] J. Autenrieb and A. Annaswamy, “Safe and Stable Adaptive Control for a Class of Dynamic Systems,” in 2023 62nd IEEE Conference on Decision and Control (CDC), pp. 5059–5066, 2023.
  • [23] M. Alyaseen, N. Atanasov, and J. Cortes, “Continuity and Boundedness of Minimum-Norm CBF-Safe Controllers,” 6 2023.
  • [24] R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520–1533, 2004.
  • [25] Z. Li, Z. Duan, G. Chen, and L. Huang, “Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, no. 1, pp. 213–224, 2010.
  • [26] R. Bellman, Introduction to Matrix Analysis, Second Edition. Society for Industrial and Applied Mathematics, second ed., 1997.
  • [27] K. S. Narendra and A. M. Annaswamy, Stable adaptive systems. USA: Prentice-Hall, Inc., 1989.

-A Proof of Theorem 2

We rewrite the reference model in (11a)-(11b) as

𝐳˙=[(IAm)(LBΘ)]𝐳(IBΘ)Δ\displaystyle\mathbf{\dot{z}}=\left[(I\otimes A_{m})-(L\otimes B\Theta)\right]\mathbf{z}-(I\otimes B\Theta)\Delta (35a)
Δ=[Δ1TΔMT]T\displaystyle\Delta=\left[\Delta_{1}^{T}\ \cdots\ \Delta_{M}^{T}\right]^{T} (35b)

where \otimes is the Kronecker product.

The error dynamics can be written as:

𝐞˙=[(IAm)(LBΘ)]𝐞+Ψ1𝐱+Ψ2+Ψ3\mathbf{\dot{e}}=\left[(I\otimes A_{m})-(L\otimes B\Theta)\right]\mathbf{e}+\Psi_{1}\mathbf{x}+\Psi_{2}+\Psi_{3} (36)

where

Ψ1(t)=diag(BΛθ~1(1),,BΛθ~1(M))\Psi_{1}(t)=\text{diag}\left(B\Lambda\tilde{\theta}^{(1)}_{1},\cdots,B\Lambda\tilde{\theta}^{(M)}_{1}\right) (37)
Ψ2(t)=[BΛθ~2(1)[j𝒩1(xjx1)Δ1]BΛθ~2(M)[j𝒩M(xjxM)ΔM]]\Psi_{2}(t)=\left[\begin{matrix}B\Lambda\tilde{\theta}^{(1)}_{2}\left[\sum_{j\in\mathcal{N}_{1}}(x_{j}-x_{1})-\Delta_{1}\right]\\ \vdots\\ B\Lambda\tilde{\theta}^{(M)}_{2}\left[\sum_{j\in\mathcal{N}_{M}}(x_{j}-x_{M})-\Delta_{M}\right]\end{matrix}\right] (38)
Ψ3(t)=[BΛθ~3(1)ω(x1,t)BΛθ~3(M)ω(xM,t)]\Psi_{3}(t)=\left[\begin{matrix}B\Lambda\tilde{\theta}^{(1)}_{3}\omega(x_{1},t)\\ \vdots\\ B\Lambda\tilde{\theta}^{(M)}_{3}\omega(x_{M},t)\end{matrix}\right] (39)

We consider the following Lyapunov function candidate:

V=𝐞T𝐞+k=13i=1MTr(θ~k(i)TΓk|Λ|θ~k(i))V=\mathbf{e}^{T}\mathbb{P}\mathbf{e}+\sum_{k=1}^{3}\sum_{i=1}^{M}\text{Tr}\left(\tilde{\theta}^{(i)T}_{k}\Gamma_{k}|\Lambda|\tilde{\theta}^{(i)}_{k}\right) (40)

where =IP0\mathbb{P}=I\otimes P\succ 0, since P0P\succ 0 and is given by (19). This choice for \mathbb{P} is motivated by the fact that it not only needs to guarantee that the system is stable but also needs to ensure that the adaptive laws are only a function of the state of agent ii and the state of its neighbors j𝒩ij\in\mathcal{N}_{i}.

With this choice of \mathbb{P} and adjusting the control gains as in (18), it can be shown (using the properties of the Kronecker product[26], (19b), and standard adaptive control arguments [27]) that

V˙=𝐞T[(IAmT)+(IAm)(LΘBTP)(IPBTΘ)]𝐞=𝐞T[(IQ)+(LΘBTP)+(IPBTΘ)]𝐞 0\begin{split}\dot{V}=&\ \mathbf{e}^{T}\left[\left(I\otimes A_{m}^{T}\right)\mathbb{P}+\mathbb{P}\left(I\otimes A_{m}\right)-\right.\\ &\ \left.\left(L\otimes\Theta B^{T}P\right)-\left(I\otimes PB^{T}\Theta\right)\right]\mathbf{e}\\ =&\ -\mathbf{e}^{T}\left[\left(I\otimes Q\right)+\left(L\otimes\Theta B^{T}P\right)+\right.\\ &\ \left.\left(I\otimes PB^{T}\Theta\right)\right]\mathbf{e}\\ \leq&\ 0\end{split} (41)

Since VV is positive definite and radially unbounded and V˙\dot{V} is negative semidefinite, then 𝐞\mathbf{e}, θ~k(i)\tilde{\theta}^{(i)}_{k}\in\mathcal{L}_{\infty} for all i=𝒱i=\mathcal{V} and k={1,2,3}k=\{1,2,3\}. Furthermore, because V˙0\dot{V}\leq 0 we have that 𝐞2\mathbf{e}\in\mathcal{L}_{2}, and since 𝐞,𝐞˙\mathbf{e},\mathbf{\dot{e}}\in\mathcal{L}_{\infty}, by Barbalat’s Lemma we are able to conclude that limt𝐞(t)=0\lim_{t\rightarrow\infty}\mathbf{e}(t)=0.

-B Proof of Theorem 3

The construction of the modified QP-GCBF filter implies that its solution Δiψ(t)\Delta_{i}^{\psi}(t) is piecewise continuous and bounded. As a result, the conclusions of Corollary 1(i) and 1(ii) hold.

The QP-GCBF filter also guarantees that the reference model solutions are safe. That is, for any TT, h(zi(t0))Eh(zi(t))Eh(z_{i}(t_{0}))\geq E\implies h(z_{i}(t))\geq E for all t[t0,T]t\in\left[t_{0},T\right]. Also EhE_{h} implies h(zi(t))0h(z_{i}(t))\geq 0 whenever h(zi(t0))=Eh(z_{i}(t_{0}))=E or h(zi(t0))=0h(z_{i}(t_{0}))=0. That in turn implies that h(zi(t))E|eh,i(t)|h(z_{i}(t))\geq E\geq|e_{h,i}(t)| for all i𝒱i\in\mathcal{V} and tt0t\geq t_{0}, which implies that h(xi(t))0h(x_{i}(t))\geq 0 for all i𝒱i\in\mathcal{V} and tt0t\geq t_{0}, proving the theorem.