- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 123072, 11 pages
Formation Control and Obstacle Avoidance for Hybrid Multi-Agent Systems
1Department of Control Science and Engineering, Tongji University, Shanghai 201804, China
2Institute for Information-Oriented Control, Technische Universität München, D-80290 München, Germany
3Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Hong Kong SAR, China
Received 10 July 2013; Accepted 20 September 2013
Academic Editor: Michael Chen
Copyright © 2013 Dong Xue et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A new concept of formation is proposed to handle a group of agents navigating in a free and an obstacle-laden environment while maintaining a desired formation and changing formations when required. With respect to the requirements of changing formation subject to internal or external events, a hybrid multiagent system (HMAS) is formulated in this paper. Based on the fact that obstacles impose the negative effect on the formation of HMAS, the formation is introduced to reflect the above disturbed situation and quantify the attenuation level of obstacle avoidance via the -norm of formation stability. An improved Newtonian potential function and a set of repulsive functions are employed to guarantee the HMAS formation-keeping and collision-avoiding from obstacles in a path planning problem, respectively. Simulation results in this paper show that the proposed formation algorithms can effectively allow the multiagent system to avoid penetration into obstacles while accomplishing prespecified global objective successfully.
In recent years, there has been a spurt of interest in the area of cooperative control for multiple agents due to its challenging features and many applications, for example, formation control [1, 2], obstacles avoidance [3, 4], rendezvous , flocking , foraging , troop hunting, and payload transport. Referring to the existing literature, it is obvious that multiple agents can perform tasks faster and more efficiently than a single one. The existing approaches for cooperative control of MASs fall into several categories, including behavior-based, artificial potential, virtual structure, leader-follower, graph theory, and decentralized control methods. Other methods and research aspects of the cooperative control for MASs can be found in [8–10].
As one key branch of cooperative control, formation and obstacle avoidance problems of multiagent systems have been received significant attentions [1–4, 8, 11]. In this case, the MAS is usually required to follow a trajectory while maintaining a desired formation and avoiding obstacles. In some practical situations, the group of agents may be necessary to perform certain maneuvers, such as split, reunion and reconfiguration, in order to negotiate the obstacles [2, 12]. Although the formation problem for MASs is attracting increasingly research attention, there are still several open fields deserving further investigation, such as robustness, fragility, and effectiveness of formation. With respect to the most robustness analysis of MASs, such as [13–15], the agents are investigated under uncertain environments with external disturbances. However, in some sense, obstacles in the navigational path can also be regarded as a disturbance from environment, which would impair the performance of formation stability. Furthermore, the influence of obstacles is usually negligible when the distances between agents and obstacles exceed certain range threshold. Inspired by obstacle avoidance issue and control theory, we introduce a new concept of formation, which treats the effects of obstacles as certain exterior disturbances, to handle the formation problem of MASs in clustered environment. Then a Lyapunov approach is employed to deal with analysis.
Artificial potential field (APF) method is widely used in coordination control of MASs due to its simplicity and efficiency [7, 16], which was first introduced by  for formation and obstacle avoidance of MASs. Since then, several literatures have attempted to improve the performance of APF method. In , bifurcation theory is used to reconfigure the formation through a simple free parameter change to reduce the computational expense. By introducing a new concept of artificial potential trenches in , the scalability and flexibility of robot formations are improved. The basic idea of potential field theory is to create a workshop, where the agents are counterbalanced with each other by the interactive potential force between them and suffered a repulsive force from obstacles to steer around them . Despite all the advantages of APFs, the lack of accurate representations of obstacles with arbitrary shapes is regarded as one major limitation to generally extend to practical applications. A potential function based on generalized sigmoid functions, which can be generated from the combinations of implicit primitives or from sampled surface data is proposed in . Using the optical flow,  have achieved the automatic detection of obstacles in virtual environment. The formation control with obstacle avoidance is highly related to the flocking problems in , where only the obstacles with simple shapes are taken into account. In this paper, we assume that the boundary functions of arbitrary obstacles can be known from the implicit functions which can be constructed from sensor readings or image data. By combining the artificial potential model and the negotiating results with obstacles, a resultant artificial repulsive force is developed to guarantee the obstacles avoidance.
In addition, it may happen that the MASs are desired to perform various formation shapes to achieve specified navigational objective. As a result, it is necessary for the MAS to possess the ability of changing formation shape during the navigation, such as split, rejoin, and reconfiguration. In this case, the MASs consist of both continuous variables and discrete events. In , a triple (group element , shape variable , control graph ) is employed to model the mobile robots and meet the requirement of changing formations. Furthermore, a Petri-potential-fuzzy hybrid controller is presented for the motion planning of multiple mobile robots with multiple targets in a clustered environment in . In this paper, a hybrid formation controller is proposed where the formation changes as events (tasks) occur. In practice, the correspondence between tasks and formation can be prespecified at the initialization step, and created intelligently by the embedded processors in each agent during the implementation. It is remarkable that the hybrid multiagent systems exhibit continuous-state dynamics and discrete behavior jumping between formations. Then, we formulate the HMAS by a hybrid machine owing to its advantages of illustrating inputs and outputs explicitly [23, 24].
The paper proceeds as follows. The formation control and obstacle avoidance problem are addressed in Section 2. In Section 3, a new concept of formation and technical proofs are provided. In Section 4, we discuss the obstacle-avoidance functions. Simulation results to illustrate the results are presented in Section 5. Conclusions and future work are provided in Section 6.
Notation 1. Throughout the paper, let be the set of positive integers, and let . represents the real Euclidean -dimensional vector space. For , the norm of is , where the symbol denotes the transpose of a matrix or a vector. denotes the identity matrix of order (for simplicity if no confusion arises). is the Lebesgue space of -valued vector-functions , defined on the time interval , with the norm .
2. Problem Formulation and Preliminaries
Consider a multiagent system with nodes and an undirected graph topology ; and are the set of vertices and the set of edges (i.e, ), respectively. The notation or equivalently denotes the edge of the graph between node and node . Furthermore, a graph is connected if there exists a path between every pair of distinct nodes; otherwise it is disconnected.
Before proceeding further, the following assumptions are made in this paper. (1)Each agent is equipped with sensors and computational hardware that allow it to detect the distances to the obstacles within the sensing range. Furthermore, the agent can access its position in the world coordinate system and broadcast to its neighboring agents. The wireless communication has a limited range and is assumed to be imperfect; that is, links may be broken. (2)The multiagent system has a task set and a formation set which meet actual project needs before initiation. And suppose that all agents know the information of and , as well as the desired formation shape and trajectories in every step.
Referred to hybrid machine presented in [23, 24] and associated with the practical application, we consider a special class of hybrid multiagent system (HMAS) which is modeled by an elementary hybrid machine (EHM)  as follows: The elements of HMAS are denoted as follows. is a set of vertices (discrete states); in formation control, each discrete state corresponds to a desired formation shape , and we denote a set of formation shape by . () is a finite (task) set of event labels; is the initial desired formation and state of HMAS, respectively. is a set of edges (transition-paths), where is the exited vertex and is the entered one. If the event is triggered, consequently the formation of HMAS transits from to . For example, Figure 1 shows a sequence of admissible collective behaviors of a HMAS triggered by event set .
Remark 1. In practical application, the multiagent system is always assigned multiple tasks in the navigation, and each task may correspond to multiple formation shapes. Similarly to the deterministic automaton described in , we suppose that the HMAS is deterministic; namely, there cannot be two transitions with the same event label. It is worth mentioning that the following theoretical analysis is available for nondeterministic HMAS; that is, there can be multiple transitions triggered by the same event.
is the dynamics of HMAS and for each agent and , which is described by where , , , , and are real constant matrices with appropriate dimensions. is continuously differentiable, representing the group motion (i.e., path of the HMAS). is the time-varying coupling configuration matrix representing the communication strength and communicational topology of the HMAS. If there is an interconnection between agent and agent , then ; otherwise, , and the diagonal elements of matrix are defined by here denotes the obstacle-avoiding function, which will be derived from potential function in Section 6.
Moreover, the formation controller in this paper is derived by extending the one in  into multiformation case (): where and is the formation-shape matrix of the multiagent system with and . Parameters , , , and are positive constants representing the strengths and effect ranges of the attractive and repulsive forces, respectively; and with the following constraint we have where .
Remark 2. Compared to the formation controller given in , the formation controller in this paper is designed to achieve more complicated control objects, such as formation switching in clustered environment. Furthermore, it is worth mentioning that the obstacle-avoiding function () as a part of the controller is an important contribution for this paper.
Then rewrite the formation controller (4) as follows:
Remark 3. Let be a continuous function with respect to , and it is easy to prove that if the bounds of exist, then is bounded on all sets of ( and ). Furthermore, regard the fact that most multiagent systems are implemented in finite horizon which means the limitation of interagent distances exists. Throughout the paper, we assume that the lower bound of exists, and we denote it by where can be guaranteed by choosing appropriate values of , , , and in the constraint (5).
3. Analysis of Formation Stability
Now, this section will analyze formation stability of the above-developed framework of HMAS in a free and an obstacle-laden environment, respectively.
Before moving on, we need to note that the formation switching in the controller will introduce discontinuities to the right hand side of (9). With respect to the dwell-time theory in , if the switching of a family of individually stable systems is sufficiently slow, then overall systems remain stable. As a result, we assume that the intervals between consecutive switching signals, that is, dwell time, are large enough. Due to the introduction of average dwell-time, this assumption does not represent a restriction because this concept allows the formation switching mechanism to be more flexible provided that the average interval between consecutive switching is no less than certain fixed positive constant.
For a formation of multiple agents moving in a clustered environment, it is inevitable to encounter various obstacles which affect the performance of formation or even break the whole system down. Naturally, the multiagent system is desirable to be able to adapt to the environment. In general, the agents are only affected by the obstacles when they enter a certain region. At other times, the influence being exerted from obstacles can be negligible. With the above analysis, the obstacles can be treated as exogenous disturbances deriving from the environment, and analysis can be employed to investigate the formation stability of HMAS.
(DF1). The formation of HMAS (1) is asymptotically stable when , where , which is equivalent to the asymptotical formation stability of the HMAS (1) in the absence of obstacles. That is to say that, all agents asymptotically converge to the desired formation positions; that is, as , where .
(DF2). The formation controller ensures a certain level of formation performance as follows: for initial states and , where is a constant, , and is given by (12). If the conditions (DF1) and (DF2) hold, then the formation of HMAS (1) is said to achieve the formation stability.
Remark 4. It is worthwhile noting that (DF2) is a standard condition arising from the control theory, which implies that , , converges to in the sense of .
Remark 5. According to (DF2), the attenuation level shows the sensitivity of obstacle avoidance in HMAS (1). Giving a smaller means that the intensity and range of reaction of HMAS towards obstacles are smaller.
Proof. Without the loss of generality, construct a common Lyapunov function in the form of
where . If the derivative of with respective to (9) is constantly negative for all subsystems, then the formation of HMAS (1) is stable. For the sake of convenience, is implicitly rewritten as , as well as , , and in the proof.
From the above discussion, one has
In respect that the coupling configuration matrix is symmetric, and , , , and , one has
Renaming in the as , thus one has
One can find the fact that and ; then
Using the standard completing the square argument, it follows from (20) that
Furthermore, the is similarly analyzed as follows:
With respect to (8), one can easily obtain
Then, for , one has
Now, we consider the formation stability of HMAS (1) with . From the inequalities (21) and (23), becomes where , , and are given in (15). By the Schur complement formula, the achievement of inequality (14) is equivalent to the following inequalities satisfied as follows: By nonnegative matrix theory, one can easily find that which implies . This proves that condition (DF1) holds for the HMAS (1) with .
Next, we prove the performance constraint (DF2) for all nonzero and a prescribed . Define and one has
Combining (21), (23), and (24), one obtains where . From the LMI (14), it is easy to prove which implies and immediately leads to the inequality (13).
Therefore, the formation of HMAS (1) has the property of criteria () and (). This completes the proof.
Remark 7. By studying the LMIs (14), the variables in (15) indicate the connectivity strength among agents. In particular, due to the monotone decreasing property of with respect to norm and the discussion in Remark 3, this connectivity strength is inversely proportional to the relatively active scope of MASs.
4. Design Obstacle-Avoiding Functions
In this section, collision avoidance in trajectory tracking is achieved using mutual repulsion between agents and obstacles, which is resulted from the Newtonian potential-based model. By regarding the agents and obstacles as conductors with uniform charges, the repulsive force inversely proportional to the distance of them can be derived in closed form.
Based on practical applications in robotics and haptic rendering, an ideal potential field should possess all of the following attributes.(i)With respect to the property of obstacle avoidance, the magnitude of potential and corresponding repulsion should be infinite at the boundary of obstacles and drop off with distance. And the range of potential is bounded, which is accordant with the limited detective scope of agent’s built-in explorer in this paper. (ii)The shapes of equipotential surface should be similar with the obstacle surface and spherical symmetrical at the boundary of potential field. (iii)The first and second derivatives of potential function should exist and be continuous, so that the resulting force field is smooth.
Before moving on, for making this paper self-contained, we revisit the general definition of external disturbance in the problem. techniques are usually used to evaluate the incremental gain of external input signal in any direction and at any frequency. In the context of theory, the external signals with finite energy are often investigated; that is, . More explicitly, the finite energy signal is said to belong to , which implies
In order to utilize theory to design obstacle-avoidance controller, we assume that multiagent systems ultimately get far from the obstacles as time evolves. Incorporated with attributes (ii) this assumption leads to . That is, the obstacle-avoidance functions are available in finite time intervals. In addition, for avoiding obstacles, the agent-obstacle distances are intuitively greater than zero, and consequently the supremum of function () exists. Based on above analysis on obstacle-avoidance function, one can easily derive the conclusion that belongs to .
Now, we will discuss the obstacle-avoiding function beginning with the instance of mass points (when the bulks of agents and obstacles are close to each other) and then extending to bulky obstacles (over times bigger than agent) with arbitrary shapes.
Consider that an agent navigates in an obstacle-laden environment with obstacles, and assume that is the position of obstacle (). The potential at agent due to obstacle is where is the repulsion coefficient for obstacles avoidance and is defined as follows: where is a positive scalar and is the maximal sensing range of agent. When the relative distance of agent and obstacle is shorter than that of the detective scope , agent will receive a signal of possible collision and the obstacle-avoiding function will work. In other words, the repulsive potentials between agents and obstacles act only when they get close to certain range. Now, the obstacle-avoiding function for agent is introduced based on the negative gradient of the potential (32) in the following form:
Then we extend the obstacle-avoiding function for the bulky objects with arbitrary shapes. In practical situations, particularly in many exploration applications, the implicit functions of obstacles to be modeled are not available. But by samples of boundary surfaces obtained from camera, laser range finder and sonar, and with the help of some techniques such as signal sampling and image processing, the implicit functions can be obtained, and then they construct the APFs . For convenience, in this paper, assume that the boundary function of obstacle is known as , and here is the position of arbitrary point on the boundary of obstacle. In fact, most of obstacles can be mathematically approximated with polyhedron. In this paper we focus on the convex polyhedra obstacles. Moreover, the results can be easily extended to obstacles with arbitrary shapes. The repulsion between agent and an arbitrary point of the obstacle’s boundary is where are defined in (33). Then for the agent the obstacle-avoiding function is defined as where represents the surface integrals on boundary of obstacles.
In view of above analysis, the obstacles laden in the terrain are static. However, it is worth mentioning that all the obstacle-avoidance functions are available for moving obstacles except for those with high-speed. In this case, the position vector is a vector-valued function over time .
5. Numerical Examples
In this section, some simulation results illustrate the performance of the proposed control laws to achieve formation and obstacles avoidance. To avoid triviality, the advantage of formation controllers (4) compared with others is omitted in this paper, and the reader is referred to .
Firstly, drive agents with the initialization positions , , , and to form a shape of square and realize obstacle avoidance in the navigation. The formation-shape matrix is set as and two obstacles locate at and . The target trajectory of in HMAS (1) is given by and the time-varying configuration matrix switches from one mode to another. They are as follows: For the formation controller (5), let , , , , and , in obstacle-avoiding function (34).
According to Figures 2 and 3, one can demonstrate the control laws presented in this paper realize the formation keeping while avoiding collision with obstacles (marked by black stars in the figures) in complex environment. For the sake of measuring and visualising the formation effectiveness, we introduce the following formation error: which is shown in Figure 4. Then, the sensitivity of obstacle-avoiding function is investigated in Figure 5, which depicts the curves of left term in inequality (13) under different repulsion coefficient and repulsion rang . From Figure 5, one can verify the fact that the performance index in inequality (13) reflects the sensitivity of HMAS towards obstacles; that is, smaller requires HMAS to be less active (smaller and ) towards obstacle.
Next, in an attempt to demonstrate the effectiveness of obstacle-avoidance function (36), a rectangular obstacle stands in the way of the HMAS path. Figures 6 and 7 show that the HMAS steers around the obstacle smoothly with the help of obstacle-avoidance functions and keeps a predefined formation in the whole process, as well as the corresponding formation error.
In many practical situations, the HMAS occasionally encounters the trench-shape obstacles which are impossible for the whole system keeping original shape to pass through. In such case, the HMAS has to transform formation to a feasible one. In this example, the task is to transition from a square formation to a straight line to pass the trench safely. When the HMAS detects the trench existed in the tracking path, specified task is triggered and corresponding formation is determined according to the predetermined task-formation scheme. As shown in Figure 8, the HMAS breaks formation, goes in a straight line when it meets the trench, and transforms back into the original formation after passing the trench.
In this paper, new formation and obstacle-avoidance protocols of multiagent systems are presented. A notion of formation has been first defined to characterize the performance of obstacle-avoiding, and the performance index is concreted as a sensitivity of obstacle-avoidance in this paper. Then a hybrid formation controller with a task set and a formation set is introduced to handle distinct obstacles. By designing diverse task-formation mapping, the HMAS can accomplish various complex missions. Then obstacle-avoidance functions using potential field model are specified to realize multiagent systems avoiding arbitrarily-shaped obstacles on the path. According to the simulation results, not only the HMAS can steer around the obstacles with proposed approach, but also the reconfiguration of formation can be achieved in the complex environment.
This work was supported by the National Natural Science Foundation of China under Grants 61174158, 61034004, 51075306, and 61272271, Special Financial Grant from the China Postdoctoral Science Foundation (no. 201104286), China Postdoctoral Science Foundation funded project 2012M510117, Natural Science Foundation Program of Shanghai (no. 12ZR1434000), and the Fundamental Research Funds for the Central Universities.
- D. Xue, J. Yao, G. Chen, and Y.-L. Yu, “Formation control of networked multi-agent systems,” IET Control Theory & Applications, vol. 4, no. 10, pp. 2168–2176, 2010.
- J. P. Desai, J. P. Ostrowski, and V. Kumar, “Modeling and control of formations of nonholonomic mobile robots,” IEEE Transactions on Robotics and Automation, vol. 17, no. 6, pp. 905–908, 2001.
- S. Cristaldi, A. Ferro, R. Giugno, G. Pigola, and A. Pulvirenti, “Obstacles constrained group mobility models in event-driven wireless networks with movable base stations,” Ad Hoc Networks, vol. 9, no. 3, pp. 400–417, 2011.
- X. Wang, V. Yadav, and S. N. Balakrishnan, “Cooperative UAV formation flying with obstacle/collision avoidance,” IEEE Transactions on Control Systems Technology, vol. 15, no. 4, pp. 672–679, 2007.
- Q. Hui, “Finite-time rendezvous algorithms for mobile autonomous agents,” IEEE Transactions on Automatic Control, vol. 56, no. 1, pp. 207–211, 2011.
- R. Olfati-Saber, “Flocking for multi-agent dynamic systems: algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.
- V. Gazi and K. M. Passino, “Stability analysis of Social foraging swarms,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 34, no. 1, pp. 539–557, 2004.
- F. Zhang, “Geometric cooperative control of particle formations,” IEEE Transactions on Automatic Control, vol. 55, no. 3, pp. 800–803, 2010.
- M. Defoort, T. Floquet, A. Kökösy, and W. Perruquetti, “Sliding-mode formation control for cooperative autonomous mobile robots,” IEEE Transactions on Industrial Electronics, vol. 55, no. 11, pp. 3944–3953, 2008.
- T.-H. Kim and T. Sugie, “Cooperative control for target-capturing task based on a cyclic pursuit strategy,” Automatica, vol. 43, no. 8, pp. 1426–1431, 2007.
- S. S. Ge and C.-H. Fua, “Queues and artificial potential trenches for multirobot formations,” IEEE Transactions on Robotics, vol. 21, no. 4, pp. 646–656, 2005.
- R. Olfati-Saber and R. M. Murray, “Graph rigidity and distributed formation stabilization of multi-vehicle systems,” in Proceedings of the 41st IEEE Conference on Decision and Control, vol. 3, pp. 2965–2971, Pasadena, Calif, USA, December 2002.
- M. Karasalo and X. Hu, “Robust formation control and servoing using switching range sensors,” Robotics and Autonomous Systems, vol. 58, no. 8, pp. 1003–1016, 2010.
- B. Shen, Z. Wang, and X. Liu, “Bounded H∞ synchronization and state estimation for discrete time-varying stochastic complex networks over a finite horizon,” IEEE Transactions on Neural Networks, vol. 22, no. 1, pp. 145–157, 2011.
- J. A. Guerrero, G. Romero, and R. Lozano, “Robust consensus tracking of leader-based multi-agent systems,” in Proceedings of the American Control Conference (ACC '10), pp. 6299–6305, Baltimore, Md, USA, July 2010.
- V. Gazi, “Swarm aggregations using artificial potentials and sliding-mode control,” IEEE Transactions on Robotics, vol. 21, no. 6, pp. 1208–1214, 2005.
- O. Khatib, “Real time obstacle avoidance for manipulators and mobile robots,” International Journal of Robotics Research, vol. 5, no. 1, pp. 90–98, 1986.
- D. J. Bennet and C. R. McInnes, “Distributed control of multi-robot systems using bifurcating potential fields,” Robotics and Autonomous Systems, vol. 58, no. 3, pp. 256–264, 2010.
- J.-H. Chuang and N. Ahuja, “An analytically tractable potential field model of free space and its application in obstacle avoidance,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 28, no. 5, pp. 729–736, 1998.
- J. Ren, K. A. McIsaac, R. V. Patel, and T. M. Peters, “A potential field model using generalized sigmoid functions,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 37, no. 2, pp. 477–484, 2007.
- A. Eresen, N. Imamoğlu, and M. Ö. Efe, “Autonomous quadrotor flight with vision-based obstacle avoidance in virtual environment,” Expert Systems with Applications, vol. 39, no. 1, pp. 894–905, 2012.
- D. R. Parhi and J. C. Mohanta, “Navigational control of several mobile robotic agents using Petri-potential-fuzzy hybrid controller,” Applied Soft Computing Journal, vol. 11, no. 4, pp. 3546–3557, 2011.
- M. Heymann, F. Lin, and G. Meyer, “Control synthesis for a class of hybrid systems subject to configuration based on safety constraints,” NASA Technical Memorandum 112196, 1997.
- M. Heymann, F. Lin, and G. Meyer, “Synthesis and viability of minimally interventive legal controllers for hybrid systems,” Discrete Event Dynamic Systems, vol. 8, no. 2, pp. 105–135, 1998.
- J. Yao, F. Lin, and B. Liu, “H∞ control for stochastic stability and disturbance attenuation in a class of networked hybrid systems,” IET Control Theory & Applications, vol. 5, no. 15, article 1698, 2011.
- C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, Springer, New York, NY, USA, 2nd edition, 2008.
- R. Shorten, F. Wirth, O. Mason, K. Wulff, and C. King, “Stability criteria for switched and hybrid systems,” SIAM Review, vol. 49, no. 4, pp. 545–592, 2007.
- 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.