Next Article in Journal
Distributed Gradient Descent Framework for Real-Time Task Offloading in Heterogeneous Satellite Networks
Next Article in Special Issue
Adaptive Approximate Predefined-Time Guaranteed Performance Control of Uncertain Spacecraft
Previous Article in Journal
Improved Mixture Cure Model Using Machine Learning Approaches
Previous Article in Special Issue
Zero-Sum-Game-Based Fixed-Time Event-Triggered Optimal Consensus Control of Multi-Agent Systems Under FDI Attacks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Distributed Observer-Based Adaptive Formation-Containment Tracking for Multi-Agent Systems on Directed Graphs

School of Electrical Engineering and Automation, Hubei Normal University, Huangshi 435002, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(4), 558; https://doi.org/10.3390/math13040558
Submission received: 10 January 2025 / Revised: 5 February 2025 / Accepted: 6 February 2025 / Published: 8 February 2025
(This article belongs to the Special Issue Finite-Time/Fixed-Time Stability and Control of Dynamical Systems)

Abstract

:
This article investigates the issue of observer-based adaptive time-varying formation-containment tracking (TVFCT) for multi-agent systems (MASs) with bounded unknown input in directed graphs. By applying estimated statuses of neighboring agents, two observer-based adaptive TVFCT control algorithms are deployed for MASs with multiple tracking leaders and one tracking leader, respectively. Notably, the proposed control algorithms remain independent and do not rely on the comprehensive global information of the entire communication network. Furthermore, the algebraic Riccati inequalities and the Lyapunov theorem provide the bases for assessing the achievement of TVFCT in MASs within directed graphs. Lastly, simulation results are provided to validate the theoretical conclusions.

1. Introduction

Over the preceding two decades, the topic of coordinated control strategies has attracted widespread attention from scholars in such various fields as mathematics, engineering, and science [1,2,3]. This research topic finds applications in many fields, for instance collaborative sensor networks [4], distributed optimization [5], and spacecraft formation [6], among others. Presently, there are many academic works dealing with coordination control problems of multi-agent systems (MASs), including consensus control [7,8], formation control [9,10], and containment control [11,12], among others.
Formation control is one of the most vital issues within the subject of cooperative control, and there exist a number of correlation results that have seen discussion [13,14,15,16,17]. A dynamic protocol was developed in [13] which reduces the communication consumption while solving the time-varying formation tracking control (TVFTC) problem. To address the formation tracking challenge in nonlinear multi-agent systems (MASs) subject to disturbances, a distributed control approach incorporating obstacle avoidance was introduced in [14]. The stability of the considered system was then demonstrated using Lyapunov stability theory. To tackle the TVFTC problem for second-order MASs, a distributed predictive method was devised in [15]. The problem of TVFTC for second-order MASs with external disturbances was analyzed in [16], and the effect of perturbation compensation on the formation center function was considered as well, while [17] suggested a novel fixed-time control algorithm and focused on the TVFTC problem with contact-uncertain nonlinear MASs.
Furthermore, as agents form the desired formation, it is natural for them to join or leave the group, leading to alterations in the associated Laplacian matrix. At this stage, developing more resilient and dependable control algorithms to guarantee the achievement of the intended formation is a pivotal research issue. Adaptive control strategies can be taken into account to allow for the acquisition of control parameters, thereby enhancing the stability of the protocol. In [18], a protocol incorporating adaptive formation was devised to ensure the achievement of collision avoidance while minimizing the state error. Additionally, Ref. [19] introduced an adaptive optimal control protocol to solve the optimal TVFTC problem in the presence of unknown leader control and external disturbances. The problem of formation control under multiple factors of noise influence was addressed in [20] by introducing a distributed adaptive TVFTC. In [21], a novel adaptive observer was introduced to evaluate the state, which then was used to supply conditions to secure fixed-time convergence of the tracking error by analyzing the Lyapunov stability. However, the adaptive control protocols mentioned above are all appropriate only for the case of undirected communications topologies. To establish the TVFTC with coupled gain in a directed graph is challenging, as the Laplace matrix which matches the structure of the directed graph is often asymmetric.
In light of the foregoing discussion regarding previous formation control works, the research on containment control provokes further consideration. Consequently, a more interesting and complicated topic is introduced for exploration, namely, the analysis of time-varying formation-containment tracking (TVFCT) control, in which formation leaders (FLs) need to achieve the desired formation shape while followers need to converge into the convex hull enclosed by the FLs. In [22], the authors devised a category of algorithms for determining the parameters of control algorithms that provides for the implementation of the group TVFCT problem via the Laplacian matrix properties. With the aim of improved availability of communication resources, a class of time-triggered mechanisms was deployed in [23] to enable the handling of the TVFCT problem under dynamic event-triggered schemes. The control algorithm with edge-state observers was suggested in [24], and the sufficient requirements for the realization of TVFCT were formulated on the basis of Lyapunov’s theorem. Despite the results of the above mentioned studies [22,23,24] dedicated to the study of formation containment problems, all of them focused on one or no target/tracking leader scenarios. However, in numerous practical industrial operations the formation shape for MASs varies with the situation, and is not applicable to cooperative transport or interaction problems for a single target; therefore, further focus on TVFCT problems with multiple tracking leaders has meaningful research value.
Inspired by the aforementioned contributions, this article addresses the observer-based adaptive TVFCT issue for MASs with tracking leaders and directed graphs. The contributions of this research are summarized as follows.
(i)
In comparison with the formation topics in [13,14,15,16,17], which focused on time-varying formation control, this paper analyzes the more complex case, namely, the problem of TVFCT with bounded unknown input.
(ii)
In contrast to the adaptive control algorithm developed in [18,19,20] under undirected graphs, in this paper we design the observer-based adaptive TVFCT control algorithm in the topology of directed communication, considering the case of directed communication topology and the fact that the state of most agents in real life is unknown.
(iii)
Unlike [22,23,24], which only considered the case of one tracking leader, we separately discuss the TVFCT problem for cases with multiple tracking leaders and with only one tracking leader.

2. Preliminaries

2.1. Graph Theory

Consider a communication network comprising N FLs, L followers and M tracking leaders, where N , L , M are positive integers. This network is represented by a digraph G = { V , E , A } which delineates the relationships among the N + L + M agents. Here, V = 1 , 2 , , M + N + L denotes the set of nodes, E V × V represents the set of edges, and A = w i j R M + N + L × M + N + L stands for the adjacency matrix. An edge i , j E exists if the i-th agent can acquire information from the j-th one, in which case w i j > 0 ; otherwise, w i j = 0 . The Laplacian matrix L associated with the graph G can be partitioned as follows:
L = 0 M × M 0 M × N 0 M × L L N × M T L N × N F 0 N × L 0 L × M L C L L × L f
where L C R L × N .

2.2. Description of the Problem

The dynamics of each follower and formation leader are defined as
x ˙ i t = A x i t + B u i t , y i t = C x i t , i F E = 1 , , N + L ,
where F = 1 , , N , E = N + 1 , , N + L , u i t R p , x i t R q and y i t R n correspondingly denote the control input, state, and output of the i-th agent.
The closed-loop dynamics of each tracking leader are provided by
x ˙ k t = A x k t + B u k t , y k t = C x k t , k T = 1 + N + L , , M + N + L ,
where u k t R p , x k t R q and y k t R n respectively stand for the control input, state, and output of the k-th tracking leader.
The formation leaders need to achieve the desired formation shape, while the followers need to converge into the convex hull enclosed by the formation leaders. The problems to be solved are described by the two definitions below.
Definition 1.
It is said that dynamic systems (1) and (2) implement time-varying formation tracking (TVFT) if and only if the following equation is respected:
lim t x i t f i t k = N + 1 N + M w i k w i , N + 1 + + w i , N + M x 0 k t = 0 , i F
where f i ( t ) is the formation offset for the i-th agent and x 0 k ( t ) denotes the k-th tracking leader.
Definition 2.
If there exist non-negative constants β k i satisfying k = 1 N β k i   = 1 such that
lim t x i t k = 1 N β k i x k t = 0 , i E ,
 then systems (1) and (2) are said to accomplish containment.
We define a variable δ i t to indicate the formation tracking local error for the i-th formation leader:
δ i t = j = 1 N w i j x i t f i t x j t + f j t + k = N + 1 N + M w i k x i t f i t x k t .
As affected by the FLs and their neighboring followers, the expression for the local error of the containment can be expanded and written in the following form:
ξ i t = j = 1 N + L w i j x i t x j t .
To comply with the calculations, the corresponding sets are defined as x T t = x 1 + N + L T t , , x M + N + L T t T for the tracking leaders, x F t = x 1 T t , , x N T t T for the FLs, and x f t = x N + 1 T t , , x N + L T t T for the followers. This allows us to analyze the compact form indicated below:
δ t = L F I q x F t f F t + L T I q x T t ,
ξ t = L f I q x f t + L C I q x F t ,
where I q R q × q is the identity matrix, f F t = f 1 T t , , f N T t T , δ t = δ 1 T t , , δ N T t T , and ξ t = ξ 1 T t , , ξ L T t T . In order to implement the TVFCT with unknown control inputs for multiple tracking leaders, the following control algorithms are presented:
u i t = η i ( t ) + ω i ( t ) K u δ i t + r i t ρ 1 g δ i t , η ˙ i t = δ i T t Γ ^ δ i t , i F ,
u i t = σ i ( t ) + υ i ( t ) K u ξ i t ρ 2 g ξ i t , σ ˙ i t = ξ i T t Γ ^ ξ i t , i E ,
where ω i t and υ i t stand for the time-varying coupling gain with ω i t > 0 and υ i t > 0 , ρ 1 and ρ 2 are the constants of the subsequent design, Γ ^ R q × q is a positive matrix, and r i ( t ) R p is introduced to compensate the input signal. The nonlinear function g · is defined as
g χ t = B T P χ t B T P χ t , B T P χ t 0 0 , B T P χ t = 0 ,
where ‖‖ is the Euclidean norm. We define η = Δ d i a g η 1 , η 2 , , η N ,   ω = Δ d i a g ω 1 , ω 2 , , ω N ,   r t = r 1 T , r 2 T , , r N T T ,   σ = Δ d i a g σ 1 , σ 2 , , σ L ,   G δ t = g T δ 1 t , , g T δ N t T , G ξ t = g T ξ 1 t , ,   g T ξ L t T ; further, υ = Δ d i a g υ 1 , υ 2 , , υ L represent some shorthand. Substituting Equations (9) and (10) into (1) and (2), respectively, the compact form of the time derivative is generated as follows:
x ˙ F t = I N A x F t + η + ω B K u δ t + I N B r t ρ 1 I N B G δ t = I N A + L F η + ω B K u x F t L F η + ω B K u f F t + L T η + ω B K u x T t + I N B r t ρ 1 I N B G δ t ,
x ˙ f t = I L A x f t + σ + υ B K u ξ t ρ 2 I L B G ξ t = I L A + L f σ + υ B K u x f t + L C σ + υ B K u x F t   ρ 2 I L B G ξ t .
Defining θ i = x i t f i t , i F and correspondingly substituting the above control algorithms (9) and (10) into the closed-loop systems in (1) and (2), the following compact formal formulas are yielded:
θ ˙ t = I N A θ t + I N A f t + η + ω B K u δ t I N I q f ˙ t ρ 1 I N B G δ t + I N B r t ,
δ ˙ t = L F I q θ ˙ F t + L T I q x ˙ T t = L F A θ F t + L F A f F t + L F η + ω B K u δ t ρ 1 L F B G δ t + L F B r t + L T A x T t + L T B S t
ξ ˙ t = L f I q x ˙ f t + L C I q x ˙ f t = L f A x f t ρ 2 L f B G δ t + L f σ t + υ t B K w ξ t + L C A x F t + L C η + ω B K u δ t ρ 1 L C B G δ t + L C B S t = I L A + L f σ t + υ t B K w ξ t + L C η + ω B K u δ t + L C B S t ρ 2 L f B G δ t ρ 1 L C B G δ t ,
where S t = u 1 T t , , u M T t T R M p .
The following assumptions and lemmas are provided for the demonstration in the next section.
Assumption 1.
There is at least one formation leader for every follower, along with a directed path.
Assumption 2.
The directed graph G L among the tracking leader and formation leader has a spanning tree with the tracking leader as the root node.
Assumption 3.
The pair A , B is stabilizable, and A , C is observable.
Lemma 1
([25]). With regard to Assumptions 1∼2, all eigenvalues of L F and L f process positive real parts.
Lemma 2
([26]). According to Assumption 1, each element of L f L C is non-negative; additionally, the sum of each row in L f L C equals one.
Lemma 3
([27]). Under on Assumption 2, for L F 1 L T , each row is equal to
1 N b N + 1 , b N + 2 , , b N + M 1 N b N + 1 , b N + 2 , , b N + M k = N + 1 N + M b k / k = N + 1 N + M b k ,
where 1 N is the N-dimensional vector with all elements being 1, b k = w i k .
Lemma 4
([28]). There are real diagonal matrices Δ F , Δ L , Θ, and Ξ that may be employed to demonstrate Δ F Θ L F + L F T Δ F Θ > 0 and Δ f Ξ L f + L f T Δ f Ξ > 0 .
Lemma 5
([29]). If c and d are non-negative real numbers and both m and n are positive real numbers that result in 1 m + 1 n = 1 , then c d c m m + d n n holds if and only if c m = d n .
Lemma 6
([30]). For any k , y R q and M , Z R q × q , the following inequality holds:
2 k T M Z y k T Z Z T k + y T M M T y .

3. Main Results

This section addresses the TVFCT issue with directed graphs and proposes two observer-based adaptive TVFCT control algorithms for the cases with multiple tracking leaders and one tracking leader.

3.1. The Case with Multiple Tracking Leaders

As the state of most agents in the real environment is inaccessible to measure, a novel distributed observer that estimates the state of each agent is introduced, as illustrated below:
x ^ ˙ i t = A x ^ i t F y i t C x ^ i t + B u i t , i F E x ^ ˙ k t = A x ^ k t F y k t C x ^ k t + B u k t , k T .
The TVFTC law with observer-based adaptive designed for each formation leader is shown below:
u i t = η ^ i t + ω i t K u δ ^ i t + r i t ρ 1 g δ ^ i t , η ^ ˙ i t = δ ^ i T t Γ ^ δ ^ i t , δ ^ i 0 = δ ^ i 0 , i F
where δ ^ i t = j = 1 N w i j x ^ i t f i t x ^ j t + f j t + k = N + 1 N + M w i k x ^ i t f i t x ^ k t with x ^ i t and x ^ k t , which are respectively employed to estimate the state of each formation leader and each tracking leader. The time-varying coupling gain is expressed by the η ^ i t symbol.
Assumption 4.
The tracking leaders’ control inputs are bounded, i.e., u k t τ , where τ is a positive constant.
For each follower, the adaptive observer-based TVFCT control law is devised with
u i t = σ ^ i t + υ i t K w ξ ^ i t ρ 2 g ξ ^ i t , σ ^ ˙ i t = ξ ^ i T t Γ ^ ξ ^ i t , σ ^ i 0 = σ ^ i 0 , i E ,
where ξ ^ i t = j = 1 N + L w i j x ^ i t x ^ j t .
Let ψ i t = δ i t δ ^ i t ; then, the following compact form arises:
ψ t = δ t δ ^ t = L F I q x F t x ^ F t + L T I q x T t x ^ T t
where I q R q × q is the identity matrix.
Based on Equations (14)–(17), the time derivative of δ ^ ( t ) can be derived as follows:
δ ^ ˙ t = I N A δ ^ t + L F A f t I N F C ψ t L F I q f ˙ t L F η ^ t + ω t B K u δ ^ t + L F B r t + L T B S t ρ 1 L F B G δ ^ t = I N A + L F η ^ t + ω t B K u δ ^ t I N F C ψ t + L F A f t + L F B r t + L T B S t L F I q f ˙ t ρ 1 L F B G δ ^ t ,
ψ ˙ t = δ ˙ t δ ^ ˙ t = I N A + F C ψ t ,
where G δ ^ t = g T δ ^ 1 t , g T δ ^ 2 t , g T δ ^ N t T .
Theorem 1.
Under Assumptions 1–4, the systems in (1) and (2) with unknown inputs of multiple tracking leaders can achieve observer-based adaptive TVFCT under directed graphs by employing the nonlinear and fully distributed control protocols in (15) and (16) with parameters K u = B T H ,   Γ = H B B T H , ω i t = δ ^ i T t H δ ^ i t , and υ i t = ξ ^ i T t H ξ ^ i t for the given design if the viability requirements listed below are met:
(i) 
The compensation for the input signal r i t is provided by the formula
lim t A f i t f ˙ i t + B r i t = 0 , i = 1 , , N .
(ii) 
The unequal relationship is fulfilled by selecting τ and κ so as to ensure that
ρ 1 τ , κ λ + ε ,
where λ = Δ max r i t , i F , and ρ 1 = τ + ε , with ε being a given arbitrarily small positive number.
(iii) 
For any given matrices H , Q > 0 , the matrices H and Q are solutions to the algebraic Riccati inequalities listed below:
H A + A T H 2 H B B T H + I q 0 ,
Q A + F C + A + F C T Q + I q 0 .
Proof of Theorem 1.
In accordance with the aforementioned preparations, the Lyapunov function is taken into regard as follows: V 1 t = V o b t + V e 1 t , with
V o b t = i = 1 N 1 2 φ i 2 η ^ i + ω i ω i + 1 2 i = 1 N φ i η ^ i α 2
and
V e 1 t = ι 1 ψ T t I N Q ψ t ,
where φ i > 0 is a positive number, Δ F Θ = d i a g φ 1 , φ 2 , , φ N is a postive definite matrix such that Δ F Θ L F + L F T Δ F Θ > 0 , α is a positive constant of a subsequent design, and ι 1 is the normal number discussed below. The time derivative of V o b t defined in (23) along the trajectory of (18) is derived as follows:
V ˙ o b t = i = 1 N φ i η ^ i + 1 2 ω ˙ i ω i + i = 1 N 1 2 φ i 2 η ^ i + ω i ω ˙ i + i = 1 N φ i η ^ i α η ^ ˙ i = 2 i = 1 N φ i η ^ i + ω i δ ^ i T t P δ ^ ˙ i t + i = 1 N φ i η ^ i + ω i α η ^ ˙ i .
Then, (15) and (18) yield the following equations:
i = 1 N φ i η ^ i + ω i α η ^ ˙ i t = δ ^ T t η ^ + ω α I Δ F Θ Γ δ ^ t ,
i = 1 N 2 φ i η ^ i + ω i δ ^ i T t H 1 δ ^ ˙ i t = i = 1 N 2 δ ^ i T t Δ F Θ η ^ i + ω i H δ ^ ˙ i t = δ ^ T t η ^ + ω Δ F Θ H A + A T H + η ^ + ω 2 Δ F Θ L F + L F T Δ F Θ H B K δ ^ t + 2 δ ^ T t η ^ + ω Δ F Θ L F H A f F t 2 δ ^ T t η ^ + ω Δ F Θ L F H f ˙ F t 2 ρ 1 δ ^ T t η ^ + ω Δ F Θ L F H B G δ ^ t + 2 δ ^ T t η ^ + ω Δ F Θ L F H B r t 2 δ ^ T t η ^ + ω Δ F Θ H F C ψ t + 2 δ ^ T t η ^ + ω Δ F Θ L T H B S t .
By applying the set of nonlinear function from (11), we obtain
2 ρ 1 δ ^ T t η ^ + ω Δ F Θ L F H B G δ ^ t = 2 ρ 1 i = 1 N η ^ i + ω i φ i δ ^ i T t H B j = 1 N w i j g δ ^ i t δ ^ j t + k = 1 M w i k g δ ^ i t 2 τ + ε i = 1 N η ^ i + ω i φ i k = 1 M w i k B T H δ ^ i t ,
where ρ 1 is designed as ρ 1 = τ + ε , with ε selected to be an arbitrarily small positive constant. As a result of Assumption 4, it follows that
2 δ ^ T t η ^ + ω Δ F Θ L T H B S t = 2 i = 1 N η ^ i + ω i φ i k = 1 M w i k B T H δ ^ i t u k t 2 τ i = 1 N η ^ i + ω i φ i k = 1 M w i k B T H δ ^ i t .
Equations (26)–(29) are reorganized and substituted into (26) to arrive at the following:
V ˙ o b t δ ^ T t η ^ + ω Δ F Θ H A + A T H + Γ + η ^ + ω 2 Δ F Θ L F + L F T Δ F Θ H B K u δ ^ t + 2 δ ^ T t η ^ + ω Δ F Θ L F H A f F t 2 δ ^ T t η ^ + ω Δ F Θ L F H f ˙ F t + 2 δ ^ T t η ^ + ω Δ F Θ L F H B r t 2 δ ^ T t η ^ + ω Δ F Θ H F C ψ t δ ^ T t α Δ F Θ Γ δ ^ t .
The minimal eigenvalue of Δ F Θ L F + L F T Δ F Θ > 0 is expressed as λ 1 f . Then, Equation (30) is represented as
V ˙ o b t δ ^ T t η ^ + ω Δ F Θ H A + A T H + Γ λ 1 f η ^ + ω 2 + α Δ F Θ Γ δ ^ t + 2 δ ^ T t η ^ + ω Δ F Θ L F H A f F t 2 δ ^ T t η ^ + ω Δ F Θ L F H f ˙ F t + 2 δ ^ T t η ^ + ω Δ F Θ L F H B r t 2 δ ^ T t η ^ + ω Δ F Θ H F C ψ t .
With respect to Lemma 6, it can be inferred that the following inequality exists:
2 δ ^ T t η ^ + ω Δ F Θ H F C ψ t λ 1 f 2 δ ^ T t η ^ + ω 2 H B B T H δ ^ t + ψ T t 2 Π 2 λ m a x H F C C T F T H λ 1 f λ min Γ ψ t ,
where Π = max φ 1 , , φ N is a constant and where λ m i n ( · ) and λ m a x ( · ) respectively denote the minimum and the maximum eigenvalues of a matrix. According to Lemma 6 and the above Equation (32), substitution into (31) leads to
V ˙ o b t δ ^ T t η ^ + ω Δ F Θ H A + A T H + Γ λ 1 f 2 η ^ + ω 2 + α Δ F Θ Γ δ ^ t + 2 δ ^ T t η ^ + ω Δ F Θ L F H A f F t 2 δ ^ T t η ^ + ω Δ F Θ L F H f ˙ F t + 2 δ ^ T t η ^ + ω Δ F Θ L F H B r t + ψ T t 2 Π 2 λ m a x H F C C T F T H λ 1 f λ min Γ ψ t ,
δ ^ T t η ^ + ω Δ F Θ L F H A f F t δ ^ T t η ^ + ω Δ F Θ L F H f ˙ F t + δ ^ T t η ^ + ω Δ F Θ L F H B r t = δ ^ T t η ^ + ω Δ F Θ L F H I N A f F t I N I q f ˙ F t + I N B r t .
Letting h t = δ ^ T t η ^ + ω Δ F Θ L F H I N A f F t I N I q f ˙ F t + I N B r t , per the feasible condition that Equation (20) is satisfied, we acquire lim t h t = 0 . It is evident from Lemma 5 that
δ ^ T t λ 1 f 2 η ^ + ω 2 + α Δ F Θ Γ δ ^ t 2 δ ^ T t λ 1 f 2 α Δ F Θ η ^ + ω Γ δ ^ t .
By choosing α 9 Π 2 λ 1 f and substituting Equation (34) into Equation (33), we obtain
V ˙ o b t δ ^ T t η ^ + ω Δ F Θ M δ ^ t + 2 Π 2 λ m a x H F C C T F T H λ 1 f λ min Γ ψ T t ψ t ,
where M = Δ H A + A T H 2 Γ . The derivative of V e 1 t defined in (24) along with (19) is listed as
V ˙ e 1 t = 2 ι 1 ψ T t I N Q ψ ˙ t ψ T t I N Z ψ t 2 Π 2 λ m a x H F C C T F T H λ 1 f λ min Γ ψ T t ψ t ,
where ι 1 = 1 + 2 Π 2 λ m a x H F C C T F T H λ 1 f λ min Γ and Z = Δ Q A + F C + A + F C T Q .
The derivative of the Lyapunov function V 1 t can be derived from Formulas (35) and (36) as follows:
V ˙ 1 t = V ˙ o b t + V ˙ e 1 t ψ T t I N Z ψ t δ ^ T t η ^ + ω Δ F Θ M δ ^ t .
Defining a variable Ω t such that Ω t = η ^ + ω Δ F Θ I δ ^ t , Equation (37) can then be simplified to
V ˙ 1 t = V ˙ o b t + V ˙ e 1 t ψ T t I N Z ψ t Ω T t I N M Ω t .
In light of the algebraic Riccati inequalities in (21) and (22), this means that V 1 0 . From the above inequality (38), it can be proved that the closed-loop system as applied to the control law in (15) is asymptotically stable. As a result of LaSalle’s invariance principle [31], it is inferred that both V 1 t and η ^ i t are bounded. Thus, it is clear that lim t x ^ F t f F t L F 1 L T I q x ^ T t = 0 . Consequently, the FLs can both realize the expected TVFT designated by f t and simultaneously trace the state trajectory of the tracking leaders. Letting ς i t = ξ i t ξ ^ i t , its compact form can be written as
ς t = ξ t ξ ^ t = L f I q x f t x ^ f t + L C I q x F t x ^ F t .
Employing (14), (15), (16), and (39), the ensuing time derivation of the equations can be calculated as follows:
ς ˙ t = I N A + F C ς t ,
ξ ^ ˙ t = L f I q x ^ ˙ f t + L C I q x ^ ˙ F t = I L A + L f σ ^ + υ B K u ξ ^ t ρ 2 L f B G ξ ^ t + L C η ^ + ω B K u δ ^ t + L C B r t ρ 1 G δ ^ t I N F C ξ t ξ ^ t ,
where G ξ ^ t = g T ξ ^ 1 t , g T ξ ^ 2 t , g T ξ ^ L t T and ρ 2 = τ + κ . To prove that followers can converge into a convex hull composed of FLs, the following candidate Lyapunov function is designed for analysis: V 2 t = V o b 1 t + V e 2 t , with
V o b 1 t = i = 1 L 1 2 q i 2 σ ^ i + υ i υ i + 1 2 i = 1 L q i σ ^ i β 2
and
V e 2 t = ι 2 ς T t I N Q ς t ,
where ι 2 is the is the constant of the subsequent design and Δ f Ξ = d i a g q 1 , q 2 , , q L . Then, the time derivative of V o b 1 t along the trajectory of (41) is yielded as
V o b 1 t = i = 1 L q i σ ^ ˙ i + 1 2 υ ˙ i υ i + i = 1 L 1 2 q i 2 σ ^ i + υ i υ ˙ i + i = 1 L q i σ ^ i β σ ^ ˙ i = i = 1 L q i σ ^ i + υ i υ ˙ i + i = 1 L q i υ i + σ ^ i β σ ^ ˙ i .
Based on (14) and (41), this results in
i = 1 L g i υ i + σ ^ i β σ ^ ˙ i = ξ ^ T t υ + σ ^ β I Δ f Ξ Γ ξ ^ t ,
i = 1 L q i σ ^ i + υ i υ ˙ i = 2 i = 1 L q i σ ^ i + υ i ξ ^ i T t H ξ ^ ˙ i t = ξ ^ T t Δ f Ξ σ ^ + υ H A + A T H ξ ^ t + ξ ^ T t σ ^ + υ Δ f Ξ L f + L f T Δ f Ξ σ ^ + υ H B K u ξ ^ t 2 ξ ^ T t σ ^ + υ Δ f Ξ H F C ς t + 2 ξ ^ T t σ ^ + υ Δ f Ξ L C H B r t ρ 1 G δ ^ t + 2 ξ ^ T t σ ^ + υ Δ f Ξ L C H B K u δ ^ t 2 ξ ^ T t σ ^ + υ Δ f Ξ L f H B ρ 2 G ξ ^ t .
To facilitate the representation, we define ϖ i t = r i t τ + ε g δ ^ i t . According to Equation (11), it can be deduced that λ = Δ max r i t with λ = Δ max r i t . By similar steps as the foregoing, the following inequalities can be derived:
2 ξ ^ T t σ ^ + υ Δ f Ξ L C H B r t ρ 1 G δ ^ t 2 i = 1 L q i ξ ^ T t H B σ ^ i + υ i i = 1 N w i j r t + τ + ε G δ ^ t 2 λ + τ + ε i = 1 L q i ξ ^ T t H B σ ^ i + υ i i = 1 N w i j 2 ϖ i = 1 L σ ^ i + υ i g i B T H ξ ^ i T t k = 1 N w i k .
2 ρ 2 ξ ^ T t σ ^ + υ Δ f Ξ L f H B G δ ^ t = 2 ρ 2 i = 1 L ξ ^ i T t H B j = 1 L w i j g ξ ^ i t g ξ ^ j t + k = 1 N w i k g ξ ^ i t 2 τ + κ i = 1 L B T H ξ ^ i t k = 1 N w i k .
Lemma 6 leads to the result that
2 ξ ^ T t σ ^ + υ Δ f Ξ H F C ς t λ 1 c 2 ξ ^ T t σ ^ + υ 2 H F C ξ ^ t + 2 Π ^ 2 λ max H F C T H F C λ 1 c λ min Γ ς T t ς t ,
where λ 1 c is the minimum eigenvalue of Δ f Ξ L f + L f T Δ f Ξ and Π ^ = max q 1 , q 2 , , q L . By relying on the previous part of the proof, the expected TVFT problem is realized, which leads to the conclusion that lim t δ ^ t = 0 . Substituting (45)–(48) into (44) yields
V o b 1 t ξ ^ T t Δ f Ξ σ ^ + υ H A + A T H + Γ ξ ^ t ξ ^ T t λ 1 c 2 σ ^ + υ 2 + β I Δ f Ξ Γ ξ ^ t + 2 Π ^ 2 λ max H F C T H F C λ 1 c λ min Γ ς T t ς t 2 τ + ε + κ i = 1 L B T H ξ ^ T t k = 1 N w i k ,
where κ is chosen to satisfy κ λ + ε . From Lemma 5, we obtain
ξ ^ T t λ 1 c 2 σ ^ + υ 2 + β I Δ f Ξ Γ ξ ^ t 2 ξ ^ T t λ 1 c 2 β I Δ f Ξ σ ^ + υ Γ ξ ^ t .
Then, placing the inequality in (50) into (49) provides
V o b 1 t ξ ^ T t Δ f Ξ σ ^ + υ H A + A T H 2 Γ ξ ^ t + 2 Π ^ 2 λ max H F C T H F C λ 1 c λ min Γ ς T t ς t .
The time derivative of V e 2 can be obtained from the trajectory of Equation (40) as follows:
V ˙ e 2 t = 2 ι 2 ς T t I N Q ς ˙ t ι 2 ς T t Z ς t .
Let Φ t = Δ f Ξ σ ^ + υ I ξ ^ t ; then, the time derivative from Equations (51) and (52) is provided as follows:
V ˙ 2 t V o b 1 t + V e 2 t ι 2 ς T t I L Z ς t + 2 Π ^ 2 λ max H F C T H F C λ 1 c λ min Γ ς T t ς t Φ T t I L M Φ t ς T t I L Z ς t Φ T t I L M Φ t ,
where ι 2 1 + 2 Π ^ 2 λ max H F C T H F C λ 1 c λ min Γ . Using (53) and Lemma 2, it can be inferred that lim t ς t = 0 and lim t ξ ^ t = 0 ; hence, the closed-loop system is implemented under the control protocols (15) and (16) for the TVFCT problem. The demonstration of Theorem 1 is currently complete. □

3.2. The Case with One Tracking Leader

This part deals with the TVFCT issue for MASs with a tracking leader and bounded unknown input in directed graphs.
With the above analysis, the case of a tracking leader is further considered. Then, the Laplace matrix which matches the topology of the system can be presented as follows:
L 1 = 0 0 1 × N 0 1 × L L N × 1 T L N × N F 0 N × L 0 L × 1 L C L L × L f .
We consider the dynamics of the tracking leader as
x ˙ 0 t = A x 0 t + B u 0 t , y 0 t = C x 0 t ,
where x 0 t R q ,   y 0 t R n and u 0 t R p respectively denote the state, output, and control input of the tracking leader.
Assumption 5.
One tracking leader’s control input is variable in time and bounded, i.e., u 0 t τ ¯ and τ ¯ is a positive constant.
For the estimate of each agent state, the observer is portrayed as
x ^ ˙ i t = A x ^ i t F y i t C x ^ i t + B u i t , i F E x ^ ˙ 0 t = A x ^ 0 t F y 0 t C x ^ 0 t + B u 0 t ,
where x ^ 0 t R q . The formation leader’s control law is then envisioned as
u i t = η ^ 1 i t + ω ¯ i t K u ϕ ^ i t + r i t ρ 3 g ϕ ^ i t , η ^ ˙ 1 i t = ϕ ^ i T t Γ ^ ϕ ^ i t , η ^ 1 i 0 = η ^ 1 i 0 , i F
where ϕ ^ t = j = 1 N w i j x ^ i t f i t x ^ j t + f j t + w i 0 x ^ i t f i t x ^ 0 t . Then, the compact form of the time derivative of ϕ ^ t is described as
ϕ ^ ˙ t = L F I q x ^ ˙ F t 1 N x ^ ˙ 0 t + f ˙ F t = I N A + η ^ 1 + ω ¯ B K u ϕ ^ t + L F A f F t + L F B r t ρ 1 L F η ^ 1 + ω ¯ B G ϕ ^ t L F B 1 N u 0 t L F I q f ˙ F t I N F C ϕ t ϕ ^ t ,
where ϕ ^ t = ϕ ^ 1 T t , ϕ ^ 2 T t , , ϕ ^ N T t T .
For each follower, the control law with the adaptive observer is organized as follows:
u i t = σ ^ 1 i t + υ ¯ i t K w ζ ^ i t ρ 2 g ζ ^ i t , σ ^ ˙ 1 i t = ζ ^ i T t Γ ^ ζ ^ i t , σ ^ 1 i 0 = σ ^ 1 i 0 , i E ,
where ζ ^ i t = j = 1 N + L w i j x ^ i t x ^ j t and K w R q × q is a positive matrix.
Theorem 2.
Under Assumptions 1, 2, 3, and 5, the systems in (1) and (2) with unknown input of one tracking leader can achieve observer-based adaptive TVFCT under directed graphs by adopting the nonlinear and fully distributed control protocols in (15) and (16) with parameters K u = B T H ,   Γ = H B B T H ,   ω ¯ i t = ϕ ^ i T t H ϕ ^ i t and υ ¯ i t = ζ ^ i T t H ζ ^ i t for the given design if the viability requirements listed below are met:
(i) 
The compensation for the input signal r i t is provided by the formula
lim t A f i t f ˙ i t + B r i t = 0 , i = 1 , , N .
(ii) 
The inequality relation is fulfilled by choosing τ 1 and κ such that
ρ 3 τ 1 ,
κ λ + ε ,
where λ = Δ max r i t , i F and ρ 3 = τ 1 + ε , with ε being a given arbitrarily small positive number.
(iii) 
For any given matrices H , Q > 0 , the matrices H and Q are solutions of the following algebraic Riccati inequalities:
H A + A T H 2 H B B T H + I q 0 , Q A + F C + A + F C T Q + I q 0 .
Proof of Theorem 2.
Let ϕ t = j = 1 N w i j x i t f i t x j t + f j t + w i 0 x i t f i t     x 0 t and ψ ¯ i t = ϕ i t ϕ ^ i t ; then, the compact form of their time derivative can be expressed as
ϕ ˙ t = I N A + η ^ 1 + ω ¯ B K u ϕ t + L F B r t ρ 1 L F B G ϕ t + L F A f F t L F B u 0 t L F I q f ˙ F t ,
ψ ¯ ˙ i t = I N A + F C ψ ¯ t .
The Lyapunov function is established by the same principle as in Theorem 1, as follows:
V 3 t = i = 1 N 1 2 ϕ ^ i t 2 η ^ 1 i + ω ¯ i ω ¯ i + 1 2 i = 1 N ϕ ^ i t η ^ 1 i α 2 + ι 3 ψ ¯ T t I N Q ψ ¯ t .
Then, according to (55), (56), and (59), similar to the proof process of Theorem 1, the time derivative of V 3 t can be deduced as follows:
V ˙ 3 t ϕ ^ T t η ^ 1 + ω ¯ Δ F Θ H A + A T H 2 Γ ϕ ^ t 2 ρ 3 τ 1 i = 1 N η ^ 1 i + ω ¯ i φ i w i 0 B T H ϕ ^ i ψ ¯ T t I N Q A + F C + A + F C T Q ψ ¯ t ,
where we choose ρ 3 τ 1 . It can be inferred that the system enables solving the TVFT problem such that V ˙ 3 t < 0 , with V 3 , η ^ i ,   ϕ and Ψ ¯ all being bounded. To further consider the containment problem, we construct the Lyapunov function V 4 t such that V 4 t = i = 1 L 1 2 q i 2 σ ^ 1 i + υ ¯ i υ ¯ i + 1 2 i = 1 L q i σ ^ 1 i β 2 + ι 2 ς T t I N Q ς t . The subsequent proof procedure is identical to the steps in Theorem 1, and as such is omitted. Finally, it is not difficult to conclude that the system realizes the TVFCT problem with a tracking leader under the control protocols in (55) and (57). □
Remark 1.
This subsection investigates the TVFCT problem with one tracking leader. Compared to the control protocols designed in [14,15,16,17], which are based on the case where the states of the agents are measurable, in practical scenarios some of the states of the agents will be unknown because the state of each agent cannot be completely measurable. Therefore, this paper introduces an observer to observe the state of each agent as means of solving the above problem.

4. Simulations

With the help of Matlab 2020b software, this section aims to deal with the formation containment issue in three dimensions. To confirm the feasibility of the theoretical results, two numerical simulation samples for MASs are provided: one dealing with multiple tracking leaders, and another dealing with a single tracking leader.

4.1. The Case with Multiple Tracking Leaders

In this case, a network topology composed of eight formation leaders, eight followers, and three tracking leaders is considered in sequence, labeled 1 to 19, as shown in Figure 1. Here, w i j is equal to 1 if ( i , j ) E . The dynamics of each agent are provided by (14), where x i t = x i 1 t , x i 2 t , x i 3 t T i = 1 , 2 , , 19 , A = 0 1 1 1 2 1 2 1 2 ,   B = 0 1 1 0 0 0 ,   C = 0 1 0 , and F = 0 2 0 . The desired formation vector f i t = f 1 t , f 2 t , f 3 t T is provided as follows: f i t = h sin t + i 1 π i 1 π 4 4 h cos t + i 1 π i 1 π 4 4 2 h cos t + i 1 π i 1 π 4 4 , i = 1 , 2 , , 8 , with h = 6 . It can be seen from Figure 2 that the time-varying coupling gains η ^ i t and σ ^ i t eventually converge to finite values with the devised control laws in (15) and (16).
The state observer error for each agent is defined as e t = e i 1 T t , e i 2 T t , e i 3 T t T , where e i t = x i t x ^ i t , i = 1 , 2 , , 19 . Based on the desired formation vector f i t above, if the desired TVFCT is attained, then the states of the eight FLs will form a parallel octagon, with eight followers entering into the convex hull formed by the FLs and rotating continuously around the states of the three tracking leaders. Figure 3 shows snapshots of the state trajectories of each agent at t = 0 s, t = 87 s, t = 130 s, and t = 146 s, where the symbol ∗ denotes the follower, the pentagram denotes the tracking leader, and the remaining symbols in the figure represent each formation leader. Depending on the state observer error variable of the agent defined above, the trajectory curve of its error can be observed from Figure 4.
In accordance with the formation tracking error variable and containment error variable defined in Theorem 1, we let δ ^ i t = δ ^ i 1 t , δ ^ i 2 t , δ ^ i 3 t T and ξ ^ i t = ξ ^ i 1 t , ξ ^ i 2 t , ξ ^ i 3 t T . The formation tracking errors and containment errors eventually converge to zero over time, as illustrated in Figure 5 and Figure 6, respectively. Figure 3, Figure 4, Figure 5 and Figure 6 establish that the formation tracking and containment errors are eventually bounded throughout time. Thus, utilizing the developed control laws in (15) and (16), the TVFCT is achieved for MASs with multiple tracking leaders under directed graphs.

4.2. The Case with One Tracking Leader

In this case, a network topology of seventeen agents is considered, in which there are eight FLs, eight followers and one tracking leader, sequentially labeled 1–17 as presented in Figure 7. Here, w i j is equal to 1 if ( i , j ) E . If TVFCT is implemented for MASs with the tracking leader, all FLs will form an octagon with the given time-varying regulation and trace the tracking leader’s state trajectory; simultaneously, the state trajectories of the eight followers will converge to the convex hull formed by the FLs. It is clear from Figure 8 that the coupling weight gains η ^ i 1 t and σ ^ i 1 t are eventually uniformly bounded throughout time. Figure 9 depicts snapshots of each agent’s state trajectories at various points in time.
It can be inferred from Figure 10 and Figure 11 that the containment errors and formation tracking errors eventually tend to be zero. Establishing the state of the observer error variable as e ¯ i t = x i t x ^ i t , i = 1 , 2 , , 17 , we let e ¯ i t = e ¯ i 1 t , e ¯ i 2 t , e ¯ i 3 t T . As can be seen from the Figure 12, the errors of the state observer for the seventeen agents tend to 0. Consequently, the TVFCT of a tracking leader under a directed graph is achieved with the developed control protocols in (55) and (57).

5. Conclusions

This research tackles the problem of observer-based adaptive TVFCT on directed graphs. Two novel observer-based adaptive TVFCT control laws have been designed and applied to two different cases, namely, multiple tracking leaders and a single tracking leader. In addition, the stability analysis of the established algorithm is justified with the help of the Lyapunov theorem and algebraic Riccati inequalities. Finally, simulations are employed to confirm the theoretical results. In future research, the finite-time control method will be combined with the control algorithm proposed in this paper to increase its application range.

Author Contributions

Conceptualization, T.H.; formal analysis, Q.Z. and T.H.; writing—original draft preparation, Q.Z. and K.-X.Y.; funding acquisition, B.X. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Hubei Provincial Education Department Science and Technology Research Program for Young Talents under Grant Q20232502.

Data Availability Statement

All data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
TVFCTTime-Varying Formation-Containment Tracking
MASsMulti-Agent Systems
FLsFormation Leaders

References

  1. He, S.; Dong, C.; Dai, S.-L.; Zou, T. Cooperative deterministic learning and formation control for underactuated USVs with prescribed performance. Int. J. Robust Nonlinear Control 2022, 32, 2902–2924. [Google Scholar] [CrossRef]
  2. Han, T.; Guan, Z.-H.; Zhan, X.-S.; Yan, H.; Chen, J. Observer-based bipartite consensus of descriptor multi-agent systems. Control Theory Appl. 2023, 40, 32–38. [Google Scholar]
  3. Han, T.; Zheng, W.X. Bipartite output consensus for heterogeneous multi-agent systems via output regulation approach. IEEE Trans. Circuits Syst. II Exp. Briefs 2021, 68, 281–285. [Google Scholar] [CrossRef]
  4. Zhao, L.; Yang, G. Cooperative adaptive fault-tolerant control for multi-agent systems with deception attacks. J. Frankl. Inst. 2020, 357, 3419–3433. [Google Scholar] [CrossRef]
  5. Cui, J.; Pan, Y.; Tan, L. Simplified optimized finite-time containment control for a class of multi-agent systems with actuator faults. Nonlinear Dyn. 2022, 109, 2799–2816. [Google Scholar] [CrossRef]
  6. Zhang, L.; Xia, Y.; Shen, G.; Cui, B. Fixed-time attitude tracking control for spacecraft based on a fixed-time extended state observer. Sci. China Inf. Sci. 2021, 64, 212201. [Google Scholar] [CrossRef]
  7. Han, T.; Guan, Z.-H.; Xiao, B.; Yan, H. Bipartite average tracking for multi-agent systems with disturbances: Finite-time and fixed-time convergence. IEEE Trans. Circuits Syst. I Regul. Pap. 2021, 68, 4393–4402. [Google Scholar] [CrossRef]
  8. Yan, K.-X.; Han, T.; Xiao, B.; Yan, H. Adaptive guaranteed-performance consensus for high-order nonlinear multi-agent systems with switching topologies. Int. J. Adapt. Control Signal Process. 2023, 37, 1135–1150. [Google Scholar] [CrossRef]
  9. Zhao, X.-F.; Han, T.; Xiao, B.; Yan, H.; Ge, M.-F.; Liang, C.-D. Task-space time-varying formation tracking for heterogeneous Euler-Lagrange systems via hierarchical predefined-time control approach. Nonlinear Dyn. 2022, 109, 2675–2692. [Google Scholar] [CrossRef]
  10. Xi, J.; Wang, X.; Li, H.; Zhang, Q.; Han, X. Energy-constraint output formation for swarm systems with dynamic output feedback control protocols. ISA Trans. 2022, 120, 235–246. [Google Scholar] [CrossRef]
  11. Chen, Y.; Zhao, Q.; Zheng, Y.; Zhu, Y. Containment control of hybridmulti-agent systems. Int. J. Robust Nonlinear Control 2022, 32, 1355–1373. [Google Scholar] [CrossRef]
  12. Gu, N.; Wang, D.; Peng, Z.; Li, T.; Tong, S. Model-free containment control of underactuated surface vessels under switching topologies based on guiding vector fields and data-driven neural predictors. IEEE Trans. Cybern. 2022, 52, 10843–10854. [Google Scholar] [CrossRef]
  13. Liu, C.; Wan, X.; Lu¨, J. Time-varying output formation tracking of heterogeneous linear multi-agent systems with dynamical controllers. Neurocomputing 2021, 441, 36–43. [Google Scholar] [CrossRef]
  14. Yang, S.; Bai, W.; Li, T.; Shi, Q.; Yang, Y.; Wu, Y.; Philip Chen, C.L. Neural-network-based formation control with collision, obstacle avoidance and connectivity maintenance for a class of second-order nonlinear multi-agent systems. Neurocomputing 2021, 439, 243–255. [Google Scholar] [CrossRef]
  15. Zheng, C.-B.; Peng, Z.-H.; Sun, J.; Liu, G.-P.; Han, Q.-L. Time-varying formation predictive control of second-order networked multi-agent systems with three-channel random communication constraints. IEEE Trans. Circuits Syst. II Exp. Briefs 2023, 71, 2119–2123. [Google Scholar] [CrossRef]
  16. Wang, L.; Xi, J.; He, M.; Liu, G. Robust time-varying formation design for multiagent systems with disturbances: Extended-state-observer method. Int. J. Robust Nonlinear Control 2020, 30, 2796–2808. [Google Scholar] [CrossRef]
  17. Yang, H.; Ye, D. Time-varying formation tracking control for high-order nonlinear multi-agent systems in fixed-time framework. Appl. Math. Comput. 2020, 377, 125119. [Google Scholar] [CrossRef]
  18. Li, Q.; Wei, Q.; Guo, Q.; Niu, Z. Distributed adaptive fixed-time formation control for second-order multi-agent systems with collision avoidance. Inf. Sci. 2021, 564, 27–44. [Google Scholar] [CrossRef]
  19. Yu, J.; Dong, X.; Li, Q.; Lü, J.; Ren, Z. Adaptive Practical optimal time-varying formation tracking control for disturbed high-order multi-agent systems. IEEE Trans. Circuits Syst. I Regul. Pap. 2022, 69, 2567–2578. [Google Scholar] [CrossRef]
  20. Liu, Y.; Liu, Z. Distributed adaptive formation control of multi-agent systems with measurement noises. Automatica 2023, 150, 110857. [Google Scholar] [CrossRef]
  21. Xiong, T.; Gu, Z. Observer-based adaptive fixed-time formation control for multi-agent systems with unknown uncertainties. Neurocomputing 2021, 423, 506–517. [Google Scholar] [CrossRef]
  22. Lu, Y.; Dong, X.; Li, Q.; Lü, J.; Ren, Z. Time-varying group formation-containment tracking control for general linear multiagent systems with unknown inputs. IEEE Trans. Cybern. 2022, 52, 11055–11067. [Google Scholar] [CrossRef] [PubMed]
  23. Chen, W.; Wang, Z.; Ding, D.; Ghinea, G.; Liu, H. Distributed formation-containment control for discrete-time multiagent systems under dynamic event-triggered transmission scheme. IEEE Trans. Syst. Man Cybern. Syst. 2023, 53, 1308–1319. [Google Scholar] [CrossRef]
  24. Zhou, S.; Dong, Y.; Hua, Y.; Yu, J.; Ren, Z. Predefined formation-containment control of high-order multi-agent systems under communication delays and switching topologies. IET Control Theory Appl. 2021, 15, 1661–1672. [Google Scholar] [CrossRef]
  25. Ren, W.; Beard, R.W. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans. Autom. Control 2005, 50, 655–661. [Google Scholar] [CrossRef]
  26. Meng, Z.Y.; Ren, W.; You, Z. Distributed finite-time attitude containment control for multiple rigid bodies. Automatica 2010, 46, 2092–2099. [Google Scholar] [CrossRef]
  27. Dong, X.; Tan, Q.; Li, Q.; Ren, Z. Necessary and sufficient conditions for average formation tracking of second-order multi-agent systems with multiple leaders. J. Frankl. Inst. 2017, 354, 611–626. [Google Scholar] [CrossRef]
  28. Zhang, H.; Lewis, F.L.; Qu, Z. Lyapunov, adaptive, and optimal design techniques for cooperative systems on directed communication graphs. IEEE Trans. Ind. Electron. 2012, 59, 3026–3041. [Google Scholar] [CrossRef]
  29. Sain, M.K. Matrix mathematics: Theory, facts, and formulas with application to linear systems theory [Book review; D.S. Berstein]. IEEE Trans. Autom. Control 2007, 52, 1539–1540. [Google Scholar] [CrossRef]
  30. Sorine, M.; Winternitz, P. Superposition laws for solutions of differential matrix Riccati equations arising in control theory. IEEE Trans. Autom. Control 1985, 30, 266–272. [Google Scholar] [CrossRef]
  31. Lang, Z.Q.; Billings, S.A. Output frequency characteristics of nonlinear systems. Int. J. Control 1995, 64, 1049–1067. [Google Scholar] [CrossRef]
Figure 1. The directed network topology for the case with multiple tracking leaders.
Figure 1. The directed network topology for the case with multiple tracking leaders.
Mathematics 13 00558 g001
Figure 2. The values of the coupling gains η ^ i t and σ ^ i t .
Figure 2. The values of the coupling gains η ^ i t and σ ^ i t .
Mathematics 13 00558 g002
Figure 3. Snapshots of the state trajectories of the nineteen agents at various moments.
Figure 3. Snapshots of the state trajectories of the nineteen agents at various moments.
Mathematics 13 00558 g003
Figure 4. TErrors of the state observer for the nineteen agents.
Figure 4. TErrors of the state observer for the nineteen agents.
Mathematics 13 00558 g004
Figure 5. Curves of the containment errors for the case with multiple tracking leaders.
Figure 5. Curves of the containment errors for the case with multiple tracking leaders.
Mathematics 13 00558 g005
Figure 6. Curves of the containment errors for the case with multiple tracking leaders.
Figure 6. Curves of the containment errors for the case with multiple tracking leaders.
Mathematics 13 00558 g006
Figure 7. The directed network topology for the case with one tracking leader.
Figure 7. The directed network topology for the case with one tracking leader.
Mathematics 13 00558 g007
Figure 8. The values of the coupling gains η ^ i 1 t and σ ^ i 1 t .
Figure 8. The values of the coupling gains η ^ i 1 t and σ ^ i 1 t .
Mathematics 13 00558 g008
Figure 9. Snapshots of the state trajectories of the seventeen agents at various moments.
Figure 9. Snapshots of the state trajectories of the seventeen agents at various moments.
Mathematics 13 00558 g009
Figure 10. Curves of the formation tracking errors for the case with one tracking leader.
Figure 10. Curves of the formation tracking errors for the case with one tracking leader.
Mathematics 13 00558 g010
Figure 11. Curves of the formation tracking errors for the case with one tracking leader.
Figure 11. Curves of the formation tracking errors for the case with one tracking leader.
Mathematics 13 00558 g011
Figure 12. Errors of the state observer for the seventeen agents.
Figure 12. Errors of the state observer for the seventeen agents.
Mathematics 13 00558 g012
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, Q.; Yan, K.-X.; Xiao, B.; Han, T. Distributed Observer-Based Adaptive Formation-Containment Tracking for Multi-Agent Systems on Directed Graphs. Mathematics 2025, 13, 558. https://doi.org/10.3390/math13040558

AMA Style

Zhang Q, Yan K-X, Xiao B, Han T. Distributed Observer-Based Adaptive Formation-Containment Tracking for Multi-Agent Systems on Directed Graphs. Mathematics. 2025; 13(4):558. https://doi.org/10.3390/math13040558

Chicago/Turabian Style

Zhang, Qi, Ke-Xing Yan, Bo Xiao, and Tao Han. 2025. "Distributed Observer-Based Adaptive Formation-Containment Tracking for Multi-Agent Systems on Directed Graphs" Mathematics 13, no. 4: 558. https://doi.org/10.3390/math13040558

APA Style

Zhang, Q., Yan, K.-X., Xiao, B., & Han, T. (2025). Distributed Observer-Based Adaptive Formation-Containment Tracking for Multi-Agent Systems on Directed Graphs. Mathematics, 13(4), 558. https://doi.org/10.3390/math13040558

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop