Consensus in multi-agent systems with non-periodic sampled-data exchange and uncertain network topology

Consensus in multi-agent systems
with non-periodic sampled-data exchange
and uncertain network topology

Mehran Zareh Dimos V. Dimarogonas Mauro Franceschelli This work was partly supported by the National Natural Science Foundation of China under Grant No. 61450110086.
Karl Henrik Johansson
Carla Seatzu
Department of Electrical and Electronic Engineering
University of Cagliari Italy
mauro.franceschelli seatzu}
School of Electrical Engineering
Royal Institute of Technology Stockholm Sweden

In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact knowledge of its own state at any time instant. The considered local interaction rule is PD-type. Sufficient conditions for stability of the consensus protocol to a time-invariant value are derived based on LMIs. Such conditions only require the knowledge of the connectivity of the graph modeling the network topology. Numerical simulations are presented to corroborate the theoretical results.

I Introduction

Due to its broad spectrum of applications, in the past years, a large attention has been devoted to the consensus problem in multi-agent systems (MAS) [1, 2, 3, 4]. Sensor networks [5, 6], automated highway systems [2], mobile robotics [7], satellite alignment [8] and several more, are some of the potential areas in which a consensus problem is taken into account. Consensus is a state of a networked multi-agent system in which all the agents reach agreement on a common value by only sharing information locally, namely with their neighbors. Several algorithms, often called consensus protocols, have been proposed that lead a MAS to consensus. In particular, the coordination problem of mobile robots finds several applications in the manufacturing industry in the context of automated material handling. The consensus problem in the context of mobile robots consists in the design of local state update rules which allow the network of robots to rendezvous at some point in space or follow a leading robot exploiting only measurements of speeds and relative positions between neighboring robots. Robots are hereafter referred to as agents.

In MAS, heavy computational loads can interrupt the sampling period of a certain controller. A scheduled sampling period can be used to deal with this problem. In such a case robust stability analysis with respect to the changes in the sampling time is necessary. For interesting contributions in this area we address the reader to [9, 10, 11] and the references therein. We also mention the work by Fridman et al. [12] who exploited an approach for time-delay systems and obtained the sufficient stability conditions based on the Lyapunov-Krasovskii functional method. Seuret [13] and Fridman [10] proposed methods with better upper bounds to the maximum allowed sampling. Shen et al. [14] studied the sampled-data synchronization control problem for dynamical networks. Qin et al. [15] and Ren and Cao [16] studied the consensus problem for networks of double integrators with a constant sampling period. In the latter two papers, even though the authors use the sampled-data notation to introduce their novelty, they suppose that the communication and the local sensing occur simultaneously and this simplifies the problem into a discrete state consensus problem. Xiao and Chen [17] and Yu et al. [18] studied second-order consensus in multi-agent dynamical systems with sampled position data.

In this paper, we consider the case in which each agent has a perfect knowledge of its own state with almost no delay, i.e., it knows its own speed and position. Information exchanges between neighboring agents happen at discrete time intervals which are possibly non-periodic but strictly positive and bounded. The network dynamics can thus be modeled as a sampled-data system (SDS), a class of systems extensively investigated in the literature. Using PD-like algorithm we guarantee that all the agents reach consensus. We recently proposed such a protocol in [19] where we provided a characterization of the convergence properties exploiting a Lyapunov-Krasovskii functional method. In particular in [19] we provided sufficient conditions for exponential stability of the consensus protocol to a time-invariant value under the assumption that the spectrum of the weighted adjacency matrix is known. In this paper we relax such assumption and provide sufficient conditions for consensus under the assumption that the only information on the network topology is its connectivity, i.e., the second largest eigenvalue of the weighted adjacency matrix. This is obviously a significant improvement with respect to [19], not only because much less information on the network topology is needed, but also because, despite of [19], the number of LMIs that have to be computed does not depend on the number of agents.

The paper is organized as follows. In Section II some notation and preliminaries are introduced. In Section III the consensus problem for second order multi-agent systems with non-periodic sampled-data exchange is formalized. In Section IV the convergence properties of the proposed consensus protocol are characterized. In Section V simulation results are presented to corroborate the theoretical analysis. Finally, in Section VI concluding remarks and directions for future research are discussed.

Ii Notation and Preliminaries

In this section we recall some basic notions on graph theory and introduce the notation used in the paper.

The topology of bidirectional communication channels among the agents is represented by an undirected graph where is the set of nodes (agents) and is the set of edges. An edge exists if there is a communication channel between agent and . Self loops are not considered. The set of neighbors of agent is denoted by . Let be the degree of agent which represents the total number of its neighbors.

The topology of graph is encoded by the so-called adjacency matrix, an matrix whose -th entry is equal to if , otherwise. Obviously in an undirected graph matrix is symmetric.

We denote the diagonal matrix whose non null entries are the degrees of the nodes. Moreover, matrix is the weighted adjacency matrix associated with . The following result has been proved in [19].

Lemma 1

If a graph is connected then the eigenvalues of the weighted adjacency matrix , namely , are all located in the interval , and is always a simple eigenvalue of .

Finally, in the rest of this paper we denote with the symmetric elements of symmetric matrices.

Iii Problem Statement

Consider a second-order multi-agent system with an undirected communication topology. Consider the PD-type consensus protocol inspired by [20] and [21]:


where denotes the number of agents, and are the position and the velocity of agent , and indicates its degree.

We suppose that the local information, i.e., the information that each agent receives from its own sensors, is measured instantaneously. This obviously makes sense when the sensor dynamics are fast enough.

Moreover, we assume that the communication between the generic agent and its set of neighbors occurs in stochastic sampling time instants , , that satisfy the following conditions:


Under the above assumptions, equation (1) can be rewritten as:


or, alternatively, doing some simple manipulations, as:


where , , , is the adjacency matrix, is the weighted adjacency matrix, and matrices and are equal, respectively, to:


A MAS with an undirected communication topology and following equation (1), is said to converge to a consensus state if


In this paper, given the value of the maximum admissible difference between any two consecutive sampling time instants, and a communication topology whose connectivity is known to be smaller than or equal to a given value , we aim at finding conditions that guarantee consensus to a fixed point among agents that evolve according to equation (3).

Iv Convergence properties

In the following subsection we recall a state variable transformation, firstly introduced in [19], to decouple the dynamics of modes associated with the eigenvalues of the weighted adjacency matrix. Then, the stability of such modes is analyzed in detail.

Iv-a Stability analysis

Apply the following change of variables:


to eq. (3). Then, it holds:


and eq. (3) can be rewritten as:


Since is a symmetrizable matrix, then it is also diagonalizable [20], and the transformation matrix can be chosen such that


are the eigenvalues of the weighted adjacency matrix . As a result, eq. (7) can be rewritten as:

or alternatively, as


where , and is the -th element of vector .

Now, if we define


the -th mode of the system, we can say that its dynamics follows equation:


Moreover, assuming , the above equation can be rewritten as:


The above SDS is a special case of a time varying delayed system where the delay is upper bounded by , and its derivative is , while the delay switches at times , .

In the rest of this paper we assume that the graph describing the communication topology is connected. By Lemma 1 this implies that its largest eigenvalue is . We call unitary eigenvalue mode (UEM) the mode associated with .

The following lemma, demonstrated in [19], characterizes the dynamics of the UEM. In particular it shows that the UEM converges asymptotically to a vector whose first entry is equal to a constant value and the second entry is null.

Lemma 2

Consider a system whose dynamics in the time interval , , follows eq. (10) with and . Assume for any . It holds


We now provide the main contribution of this paper, i.e., we characterize the conditions on the design parameters under which the modes , , defined in eq. (9) are asymptotically stable provided that for all .

Theorem 3

Consider the generic mode defined in eq. (9) whose dynamics follows eq. (11) where is an uncertain parameter in , and obviously .

If there exist positive definite matrices and and square matrices and such that the following inequalities hold:


then the system with dynamics (11) is asymptotically stable.

Proof: Consider the Lyapunov function


It holds:


To provide an upper bound to (18) we use Jensen integral inequality:


Define .

We get:


From the descriptor method [22] we know:


Adding this to the right side of the inequality in (18) and using the inequality (20) we obtain:





Notice that is always positive. Thus:


Hence to prove the stability one needs to prove that is negative definite.

Now define the following matrices:





One can show that:


Define and .

Then , and


Since and , coefficients , , , and are positive. Moreover, by equations (13) to (16) it follows that is negative definite and this proves the stability of the system.

Iv-B Consensus among agents

We now prove the consensus of agents to a common position.

Theorem 4

Consider a MAS evolving according to equation (2) where is such that . Assume that the undirected connected graph modeling the network topology is such that the second largest eigenvalue of its weighted adjacency matrix is smaller than or equal to . If the LMIs defined in eq. (13) to (16) are satisfied, then there exists a such that asymptotically converges to and asymptotically converges to .

Proof: By Theorem 3, if the LMIs in eq. (13) to (16) hold, all modes except the UEM are asymptotically stable, i.e., and thus for . Furthermore, by Lemma 2, there exists a positive constant such that .

Now, the first column of is the eigenvector corresponding to the unitary eigenvalue of , therefore it is equal to . Thus, being , it is trivial to show that when it is , for all . The same calculations can be repeated for the velocities, thus proving that for , it is , .

V Simulation results

In this section we present the results of some numerical simulations that show the effectiveness of the proposed consensus protocol. To this aim we consider a system with agents and assume and .

In Fig. 1 the area under the curve shows the stability region in the plane. Such an area has been computed using the LMIs (13) to (16).

We now consider a graph with adjacency matrix (randomly generated) equal to:


Fig. 2 shows the positions and velocities of the agents, while Fig. 3 shows the sampled positions and velocities aperiodically transmitted to neighbors by each agent.

Fig. 1: The stability area in the plane.
Fig. 2: Positions and velocities when the proposed protocol is implemented.
Fig. 3: Sampled positions and velocities aperiodically transmitted to neighbors by agents when the proposed protocol is implemented.

Vi Conclusions and future work

In this paper we considered a PD-like consensus algorithm for a second-order multi-agent system where, at non-periodic sampling times, agents transmit to their neighbors information about their position and velocity, while each agent has a perfect knowledge of its own state at any time instant. The main contribution consists in proving consensus to a common fixed point, based on LMIs verification, under the assumption that the network topology is not known and the only information is an upper bound on the connectivity.

Two are the main directions of our future research in this framework. First, we want to compute analytically an upper bound on the value of the second largest eigenvalue of the weighted adjacency matrix that guarantees consensus, as a function of the other design parameters. Second, we plan to study the case where agents do not have a perfect knowledge of their own state.


  • [1] J. Qin, H. Gao, and W. X. Zheng, “Second-order consensus for multi-agent systems with switching topology and communication delay,” Systems & Control Letters, vol. 60, no. 6, pp. 390–397, 2011.
  • [2] W. Ren, R. W. Beard, and E. M. Atkins, “A survey of consensus problems in multi-agent coordination,” in 2005 American Control Conference, 2005.
  • [3] W. Yu, G. Chen, and M. Cao, “Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems,” Automatica, vol. 46, no. 6, pp. 1089–1095, 2010.
  • [4] M. Zareh, C. Seatzu, and M. Franceschelli, “Consensus on the average in arbitrary directed network topologies with time-delays,” in 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, 2013.
  • [5] W. Yu, G. Chen, Z. Wang, and W. Yang, “Distributed consensus filtering in sensor networks,” IEEE Trans. on Systems, Man, and Cybernetics. Part B: Cybernetics, vol. 39, no. 6, pp. 1568–1577, 2009.
  • [6] R. Olfati-Saber and J. S. Shamma, “Consensus filters for sensor networks and distributed sensor fusion,” in 44th IEEE Conf. on Decision and Control and 2005 European Control Conference, 2005.
  • [7] S. Khoo, L. Xie, and Z. Man, “Robust finite-time consensus tracking algorithm for multirobot systems,” Mechatronics, IEEE/ASME Transactions on, vol. 14, no. 2, pp. 219–228, 2009.
  • [8] W. Ren, “Distributed attitude alignment in spacecraft formation flying,” International Journal of Adaptive Control and Signal Processing, vol. 21, no. 2-3, pp. 95–113, 2007.
  • [9] J. Ackermann, Sampled-data control systems: analysis and synthesis, robust system design.   Springer-Verlag New York, 1985.
  • [10] E. Fridman, “A refined input delay approach to sampled-data control,” Automatica, vol. 46, no. 2, pp. 421–427, 2010.
  • [11] A. Zutshi, S. Sankaranarayanan, and A. Tiwari, “Timed relational abstractions for sampled data control systems,” in Computer Aided Verification.   Springer, 2012, pp. 343–361.
  • [12] E. Fridman, A. Seuret, and J.-P. Richard, “Robust sampled-data stabilization of linear systems: an input delay approach,” Automatica, vol. 40, no. 8, pp. 1441–1446, 2004.
  • [13] A. Seuret, “A novel stability analysis of linear systems under asynchronous samplings,” Automatica, vol. 48, no. 1, pp. 177–182, 2012.
  • [14] B. Shen, Z. Wang, and X. Liu, “Sampled-data synchronization control of dynamical networks with stochastic sampling,” 2012.
  • [15] J. Qin, W. X. Zheng, and H. Gao, “Sampled-data consensus for multiple agents with discrete second-order dynamics,” in 49th IEEE Conf. on Decision and Control, 2010.
  • [16] W. Ren and Y. Cao, “Convergence of sampled-data consensus algorithms for double-integrator dynamics,” in 47th IEEE Conf. on Decision and Control, 2008.
  • [17] F. Xiao and T. Chen, “Sampled-data consensus for multiple double integrators with arbitrary sampling,” IEEE Trans. on Automatic Control, vol. 57, no. 12, pp. 3230–3235, 2012.
  • [18] W. Yu, W. X. Zheng, G. Chen, W. Ren, and J. Cao, “Second-order consensus in multi-agent dynamical systems with sampled position data,” Automatica, vol. 47, no. 7, pp. 1496–1503, 2011.
  • [19] M. Zareh, D. V. Dimarogonas, M. Franceschelli, K. H. Johansson, and C. Seatzu, “Consensus in multi-agent systems with second-order dynamics and non-periodic sampled-data exchange,” in 19th IEEE Conf. on Emerging Technologies and Factory Automation, Barcelona, Spain, 2014.
  • [20] R. Cepeda-Gomez and N. Olgac, “An exact method for the stability analysis of linear consensus protocols with time delay,” IEEE Trans. on Automatic Control, vol. 56, no. 7, pp. 1734–1740, 2011.
  • [21] M. Zareh, C. Seatzu, and M. Franceschelli, “Consensus of second-order multi-agent systems with time delays and slow switching topology,” in 10th IEEE Int. Conf. on Networking, Sensing and Control, 2013.
  • [22] E. Fridman, “A descriptor system approach to nonlinear singularly perturbed optimal control problem,” Automatica, vol. 37, no. 4, pp. 543–549, 2001.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description