Exponentially stable solution of mathematical model based on graph theory of agents dynamics on time scales
Urszula Ostaszewska, Malgorzata Zdanowicz, Ewa Schmeidel

TL;DR
This paper investigates leader-following consensus in agent dynamics on arbitrary time scales, allowing variable step sizes, and provides conditions for stability using Grönwall inequality, supported by illustrative examples.
Contribution
It introduces a leader-following model on arbitrary time scales with variable step sizes and proves stability conditions using Grönwall inequality.
Findings
Established conditions for leader-following consensus on arbitrary time scales
Demonstrated stability results through illustrative examples
Extended graph theory models to non-uniform time scales
Abstract
In this paper an emergence of leader-following model based on graph theory on the arbitrary time scales is investigated. It means that the step size is not necessarily constant but it is a function of time. We propose and prove conditions ensuring a leader-following consensus for any time scales using Gr\"{o}nwall inequality. The presented results are illustrated by examples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Distributed Control Multi-Agent Systems
Exponentially stable solution of mathematical model based on graph theory of agents dynamics on time scales
Urszula Ostaszewska111University of Bialystok, Poland, email: [email protected], Ewa Schmeidel222University of Bialystok, Poland, email: [email protected], Małgorzata Zdanowicz333University of Bialystok, Poland, email: [email protected]
Abstract
In this paper an emergence of leader-following model based on graph theory on the arbitrary time scales is investigated. It means that the step size is not necessarily constant but it is a function of time. We propose and prove conditions ensuring a leader-following consensus for any time scales using Grönwall inequality. The presented results are illustrated by examples.
Keywords Time scales, graph theory, leader-following problem, Grönwall inequality, multi-agent systems.
AMS Subject classification 34N05, 34D20, 93C10.
1 Introduction
The aim of this paper is to propose the conditions ensuring the consensus of multi-agent system over the arbitrary time scale. We consider continuous-time and discrete-time models and also models on time scales consisting of the both kinds of points: right-dense and right-scattered simultaneously. Under some assumptions, we prove that consensus can be achieved exponentially if the graininess function is bounded. All theorems are still true if graininess function approaches zero. Some existing results of discrete-time consensus are special cases of results presented in this paper.
The leader-following problem has been investigated since 1970s. In 1974 [1], DeGroot studied explicitly described model that resulted in the consensus. In 2000, Krause [2, 3] discussed the model of a group of agents who have to make a joint assessment of a certain magnitude. The coordination of groups of mobile autonomous agents based on the nearest neighbor rules was considered by Jadbabaie et al. in [4]. Blondel et al. [5, 6], took into account Krause’s model with state-dependent connectivity. Girejko et al. [7, 8], examined Krause’s model on discrete time scales. In 2007 there were published two important articles written by Cucker and Smale [9, 10]. The authors considered an emergent behavior in flocks. Cucker-Smale model on isolated time scales was in the area of interests of Girejko et al. [8]. Last year, Girejko, Machado, Malinowska and Martins [12] investigated the sufficient conditions for consensus in the Cucker-Smale type model on discrete time scales. In 2015, Wang et al. [11] published some results for the leader-following consensus of discrete time linear multi-agent systems with communication noises.
Presented here results generalize and improve results obtained by the authors in [13] and [14]. In [14] consensus on different types of discrete time scales is considered under assumption that feedback control gain is constant.
The background of time scales theory is given in Bohner and Peterson books [15, 16].
2 Mathematical model of agents dynamics
We consider a multi-agent system consisting of agents and the leader. The leader, labeled as , is an isolated agent with the given trajectory . The dynamics of agents is described by the following equation
[TABLE]
with initial condition . Here is unknown vector which represents the state of agents at time , , is the vector , is the feedback control gain at time , and is the symmetric matrix (for details see [18]). Notice that this model, based on the graph theory, was studied by many authors including Yu, Jiang and Hu [17].
Let us denote by the distance between the leader and the -th agent. If is regressive, then by we denote a solution of initial value problem
[TABLE]
By variation of constants (see [15]), the unique solution of equation (1) is given by
[TABLE]
Definition 1**.**
Function fulfills Lipschitz condition with respect to the second variable if there exists a positive constant such that
[TABLE]
Definition 2**.**
We say that equation (1), where , , is exponentially stable if there exist a positive constants and such that for any rd-continuous solution of equation (1) holds
[TABLE]
For some relevant result for exponential stability in the discrete case see [19] and [20]. In 2005 [21], Peterson and Raffoul investigated the exponential stability of the zero solution to systems of dynamic equations on time scales. The authors defined suitable Lyapunov-type functions and then formulated appropriate inequalities on these functions that guarantee that the zero solution decay to zero exponentially. For the growth of generalized exponential functions on time scales see Bodine and Lutz [22].
3 Main results
Through this paper we assume that
[TABLE]
It implies that . Assume that function satisfies Lipschitz condition with respect to the second variable.
Let , denote the eigenvalues of matrix . By and we mean the set of right-scattered and right-dense points of , respectively. Notice that, since we assumed , at least one of sets or must be unbounded.
Next, we rewrite time scale in the useful way for estimation of norm of solution of initial value problem (1) on a time scale consisting of right-scattered as well as right-dense points. To avoid confusion we underline that any interval throughout this paper is an interval on the time scale, i.e. any interval contains only points of the time scale. Set
[TABLE]
[TABLE]
[TABLE]
for . In case of for some we take (see Example 9). If for some we also take (see Example 6). Analogously, if for some , then . If for some , then we take for and (see Example 7). We see if , then .
Example 1**.**
Let . Here , , , and .
We underline that for any while it is possible for some .
Example 2**.**
Let . Here , , for . We see , , , for .
Example 3**.**
Let . Here , for and and for .
We can write
[TABLE]
wherein and .
In the next lemma, for any , the estimations of the norm of matrices where , and where are presented.
Lemma 1**.**
If for the following conditions are satisfied
[TABLE]
[TABLE]
then there exists a positive real number such that
[TABLE]
[TABLE]
where denotes the spectral norm of considered matrix at the point .
Proof.
Obviously, . We consider two cases:
- (i)
;
- (ii)
.
In case , notice that since matrix is symmetric, then is a symmetric matrix at the point , too. Therefore equals the maximum of the absolute value of eigenvalues of matrix . It means
[TABLE]
for . Because of positivity of on and condition (4), we have . Moreover, by (5), for . We can conclude
[TABLE]
Again by (5), we have
[TABLE]
From above
[TABLE]
where .
Case . Condition (4) implies
for any and for any
or
for any and for any .
If , then
[TABLE]
[TABLE]
for , where .
If , then
[TABLE]
[TABLE]
for , where .
Set . Obviously .
Hence for
and for . ∎
Next, we find the estimations of the norm of matrix in two cases: and .
Lemma 2**.**
If conditions (4)-(5) are satisfied, then
[TABLE]
for , and
[TABLE]
for , where .
Proof.
Let us rewrite function in the following form
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
or
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By submultiplicativity of the norm, for we estimate the norm of matrix
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Analogously, for , we get
[TABLE]
∎
Remark 1**.**
If conditions (4)-(5) are satisfied, then
[TABLE]
Proof.
Since and , thus
[TABLE]
From the above, inequalities (6) and (7) imply
[TABLE]
[TABLE]
where . This is our claim. ∎
The following result concerns of scalar case of exponential function on arbitrary time scale.
Lemma 3**.**
Let . There hold
[TABLE]
for , and
[TABLE]
for , where .
We are now in a position to present the main theorem of this paper.
Theorem 1**.**
If conditions (3)-(5) are satisfied, and for any
[TABLE]
[TABLE]
and
[TABLE]
then equation (1) is exponentially stable.
Proof.
Taking the norm of the both sides of equation (2), we obtain
[TABLE]
Using properties of the norm, we get
[TABLE]
and consequently
[TABLE]
By condition (3), we obtain
[TABLE]
For , using (6), we estimate
[TABLE]
[TABLE]
Multiplying the both sides of the above inequality by
[TABLE]
we obtain
[TABLE]
[TABLE]
Since ,
[TABLE]
[TABLE]
[TABLE]
Using , we get
[TABLE]
[TABLE]
[TABLE]
By Grönwall Lemma (see [15, p. 257]), it leads to inequality
[TABLE]
Using Lemma 3
[TABLE]
[TABLE]
Hence
[TABLE]
[TABLE]
By (8),
[TABLE]
Analogously, for
[TABLE]
Set
[TABLE]
[TABLE]
[TABLE]
for , and
[TABLE]
By (9) and (10), inequalities (11) and (12) imply the thesis. ∎
Corollary 1**.**
If conditions (3)-(5) and (8) are satisfied,
[TABLE]
[TABLE]
and
[TABLE]
then equation (1) is exponentially stable.
Proof.
By (13) we get, iff . Since and , by properties of functions and , condition (15) implies conditions (9) and (10). Hence assumptions of Theorem 1 are satisfied. So, the thesis holds. ∎
Example 4**.**
Let
[TABLE]
Here and ,
[TABLE]
Moreover, let
[TABLE]
and
[TABLE]
in equation (1). There is , , , and . It follows from these that and
[TABLE]
From the above
[TABLE]
and
[TABLE]
All assumptions of Corollary 1 are satisfied, thus equation (1) is exponentially stable. System (1) achieves consensus exponentially.
In Example 4 there is
[TABLE]
but this condition is not required for exponential stability of (1) (see Example 5).
Remark 2**.**
If conditions (3)-(5), (8) and (14) are satisfied, and
[TABLE]
and
[TABLE]
then equation (1) is exponentially stable.
Proof.
If condition (17) holds, then
[TABLE]
[TABLE]
By (18), we see that for any , and is a positive, decreasing function of variable . Here as well as for any , are bounded. If the cardinality of set is infinity, then . If the cardinality of set is infinity, then . Thus, by Theorem 1, we obtain the thesis. ∎
Example 5**.**
Let
[TABLE]
Here and ,
[TABLE]
[TABLE]
Moreover, let
[TABLE]
and matrix is given by (16) in equation (1). There is , ,
[TABLE]
Finally,
[TABLE]
All assumptions of Remark 2 hold, thus equation (1) is exponentially stable.
In Example 5 there is
[TABLE]
even that system (1) achieves consensus exponentially.
Corollary 2**.**
If conditions (3)-(5) and (14) are satisfied, and
[TABLE]
then equation (1) is exponentially stable.
Proof.
Since (19) holds,
[TABLE]
Hence, reminding that cardinality of the set is infinity, by (14), we obtain
[TABLE]
[TABLE]
[TABLE]
where . ∎
For two possible cases of carrying out of assumption (19) see Example 4 and Example 7.
Theorem 1 generalize Theorem 2 [14]. The following example presents an equation on time scale for which Theorem 2 [14] can not be applicable, but our Corollary 2 of Theorem 1 can be.
Example 6**.**
Let
[TABLE]
Here and ,
[TABLE]
Set ,
[TABLE]
and is given by (16) in equation (1). There is , ,
[TABLE]
Hence
[TABLE]
All assumptions of Corollary 2 are satisfied, thus equation (1) is exponentially stable.
Since results obtained in [14] can not be applied.
The following examples show two different situations concerning time scale in which condition (19) is satisfied. In the first example, is a bounded set. In the second one, set is unbounded.
Example 7**.**
Let
[TABLE]
Here is bounded and . We see that
[TABLE]
[TABLE]
Let also
[TABLE]
and matrix is given by (16) in equation (1). There is , ,
[TABLE]
In consequence
[TABLE]
All assumptions of Corollary 2 are satisfied, thus equation (1) is exponentially stable.
Example 8**.**
Let
[TABLE]
Here either or are unbounded sets. We see that
[TABLE]
[TABLE]
Moreover
[TABLE]
and matrix is given by (16) in equation (1). There is , ,
[TABLE]
Hence
[TABLE]
All assumptions of Corollary 2 are satisfied, thus equation (1) is exponentially stable.
Notice that in Example 8 there is
[TABLE]
Remark 3**.**
If conditions (3)-(5) are satisfied,
[TABLE]
and
[TABLE]
then equation (1) is exponentially stable.
(See Example 4)
Remark 4**.**
Let conditions (3)-(5) be satisfied. If the cardinality of the set is finite and for any then equation (1) is exponentially stable.
Example 9**.**
Let
[TABLE]
Here is unbounded set whereas is bounded, and
[TABLE]
Let
[TABLE]
and matrix is given by (16) in equation (1). There is , ,
[TABLE]
Hence
[TABLE]
All assumptions of Remark 4 are satisfied, thus equation (1) is exponentially stable.
Notice that in Example 9 condition (14) does not hold.
Acknowledgments
The second author was supported by the Polish National Science Center grant on the basis of decision DEC-2014/15/B/ST7/05270.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. H. De Groot, Reaching a consensus, J. Amer. Statist. Assoc., (1974), 69, 118–121
- 2[2] U. Krause, Gordon and Breach Publ., A discrete nonlinear and non-autonomous model of consensus formation, Comunications in Difference Equations, 2000, ICDEA, 1998, Poznań
- 3[3] R. Hegselmann and U. Krause, Opinion dynamics and bounded confidence: models, analysis, and simulation, J. Artificial Societies and Social Simulations, (2002), 5, 1–33
- 4[4] A. Jadbabaie and J. Lin and A. S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic Control, 2003, 48, 6, 988–1001
- 5[5] V. D. Blondel and J. M. Hendrickx and J. N. Tsitsikli, On Krause’s multi-agent consensus model with state-dependent connectivity, IEEE Transactions on automatics control, (2009), 54, 11, 2586–2597
- 6[6] V. D. Blondel and J. M. Hendrickx and J. N. Tsitsikli, Continuous-time average-preserving opinion dynamics with opinion-dependent communications, SIAM J. Control Optim., (2010), 18, 8, 5214–5240
- 7[7] E. Girejko and L. Machado and A. B. Malinowska and N. Martins, Krause’s model of opinion dynamics on isolated time scales, Math. Methods Appl. Sci., (2016), 39, 18, 5302–5314
- 8[8] E. Girejko and A.B. Malinowska and E. Schmeidel and M. Zdanowicz, IEE Explore, The emergence on isolated time scales, 21st International Conference on Methods and Models in Automation and Robotics (MMAR), 2016
