Distributed Coordination Algorithms for Multiple Fractional-Order Systems
|
|
- Phoebe Pitts
- 5 years ago
- Views:
Transcription
1 Proceedings of the 47th IEEE onference on Decision and ontrol ancun, Mexico, Dec. 9-, 8 Distributed oordination Algorithms for Multiple Fractional-Order Systems Yongcan ao, Yan Li, Wei Ren, YangQuan hen Abstract This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus model is introduced by summarizing three different cases: (i) fractional-order agent dynamics with integer-order consensus algorithms, (ii) fractional-order agent dynamics with fractional-order consensus algorithms, and (iii) integer-order agent dynamics with fractional-order consensus algorithms. We show sufficient conditions on the communication graph and the fractional order such that consensus can be achieved using the general model. The consensus equilibrium is also given explicitly. In addition, we characterize the relationship between the number of agents and the fractional order to ensure consensus. Furthermore, we compare the convergence speed of consensus for fractional-order systems with that for integer-order systems. It is shown that the convergence speed of the fractional-order consensus algorithms can be improved by varying the fractional orders with time. Finally, simulation results are presented as a proof of concept. I. INTRODUTION onsensus has an old history [], [], []. In the literature, consensus means agreement of a group faced with decisionmaking situations. As for a group behavior, sharing information with each other, or consulting more than one expert as stated in [] makes the decision makers more confident. Inspired by the ideas in the literature, similar strategies have been applied in multi-agent systems recently. For systems with single-integrator dynamics, consensus algorithms have been studied extensively (see [4] and references therein). Because many existing vehicles are modeled by double-integrator dynamics, consensus algorithms for double-integrator dynamics are studied in [], [6], [7], [8], [9], to name a few. In reality, consensus phenomena exist widely in biology, economics, social science, etc. However, the study of consensus is restricted to systems with integer-order dynamics at present. In fact, there are many phenomena that cannot or are hard to be interpreted by integer-order dynamics, for example, the consensus motion of agents in viscoelastic materials such as macromolecule fluid, porous media, and complicated environments. In these situations, the stress-strain relationships always show dynamics with some non-integer (fractional) order as shown in [], [], Electrical and omputer Engineering Department, Utah State University, Logan, UT 84, USA. Institute of Applied Math, School of Mathematics and System Sciences, Shandong University, Jinan, P. R. hina. Yan Li was supported in part by the State Scholarship Fund of the P. R. hina (Grant No. LiuJinhu[7]-77). orresponding author: wren@engineering.usu.edu. Wei Ren was supported in part by National Science Foundation Grant NS []. Fractional-order dynamics can describe many complex phenomena that are beyond the ability of classical integer-order calculus. In particular, there are many other phenomena that can be naturally interpreted by consensus for systems with fractional-order dynamics, for example, chemotaxi behavior and food seeking of microbe, especially the motion of bacteria in lubrications which are perspired by themselves [], [4]. The contribution of this paper is as follows: First, consensus for integer-order dynamics is extended to fractional-order dynamics. Existing consensus algorithms for integer-order dynamics can be considered a special case of fractionalorder consensus algorithms. Second, we study the conditions on the communication graph and the fractional order such that consensus can be achieved for fractional-order systems. We also characterize the relationship between the number of agents and the fractional order to ensure consensus. Third, an alternative to improve the convergence speed is presented by applying a varying-order consensus strategy. A. Graph Theory II. PRELIMINARY For a system with n agents, the communication graph for all agents can be modeled by a directed graph G = (V, W), where V = {v,v,,v n } and W V represent, respectively, the agent set and the edge set of the graph. Each edge can be denoted as (v i,v j ) which means agent j can access the state information of agent i. Accordingly, agent i is a neighbor of agent j. All neighbors of agent i is denoted by N i. A directed path is a sequence of edges in a directed graph with the form (v, v ), (v,v ),, where v i V. A directed graph has a directed spanning tree if there exists at least one agent that has a directed path to all other agents. The communication graph can be represented by two types of matrices: the adjacency matrix A = [a ij ] IR n n with a ij > if (v j,v i ) W and a ij = otherwise, and the (nonsymmetric) Laplacian matrix L = [l ij ] IR n n with l ii = j N i a ij and l ij = a ij, i j. It is straightforward to verify that L has at least one zero eigenvalue with a corresponding eigenvector, where is an all-one column vector with a compatible size. Lemma.: [] For a fixed communication graph, L has a simple zero eigenvalue with an associated eigenvector and all other eigenvalues have positive real parts if and only if the communication graph has a directed spanning tree /8/$. 8 IEEE 9
2 47th IEEE D, ancun, Mexico, Dec. 9-, 8 B. onsensus Algorithm for Integer-order Systems For an n-agent system with single-integrator dynamics ẋ i = u i, () where IR is the state of ith agent and u i IR represents the corresponding control input, a fundamental consensus algorithm is given by [6], [7], [] u i = j N i a ij [x j ], () where a ij is the (i,j)th entry of the adjacency matrix A. Using (), () can be written in matrix form as Ẋ = LX, () where X = [x,x,...,x n ] T IR n and L is the (nonsymmetric) Laplacian matrix. For high integer-order multi-agent systems, the consensus algorithms are similar to those for the single-integrator systems (see [8] and references therein).. Fractional alculus The aputo fractional-order derivative plays a crucial role in fractional-order calculus. aputo integral is defined from Heaviside unit step function as a Dt α f = Γ(α) t a f(τ) dτ, (t τ) α where Γ( ) is the Gamma function, α (, ], a is an arbitrary real number, and a Dt α denotes the aputo integral with order α. For an arbitrary real number p, aputo derivative is defined as a D p t f = a Dt α f], (4) t [p]+ where α = [p] + p (, ] and [p] is the integer part of p. If p is an integer, then α = and (4) is equivalent to the integer-order derivative. Based on the formal definition of the Laplace transform F(s) = L{f} = [ [p]+ e st fdt, where L{ } denotes the Laplace transform of a function, it follows that the Laplace transform L{ a D α t f} is { s α F(s) + s α f( ), α (, ] s α F(s) + s α f( ) + s α f( ), α (, ), where f( ) = lim f(ǫ) and f( ) = lim f(ǫ). ǫ ǫ Similar to the exponential function frequently used in the solutions of integer-order systems, a function frequently used in the solutions of fractional-order systems is the Mittag- Leffler function defined as z k E α,β (z) = Γ(kα + β), () k= where α and β are arbitrary complex numbers. When β = and α >, () becomes E α (z) = k= z k Γ(kα+). III. STABILITY ANALYSIS OF ONSENSUS ALGORITHMS FOR FRATIONAL-ORDER SYSTEMS In this section, we derive the conditions on the communication graph and the fractional order such that consensus for fractional-order systems is achieved over a directed communication graph. To study this problem, we introduce a general model of consensus for fractional-order systems by summarizing the following three different cases: (i) Fractional-order agent dynamics with an integer-order consensus algorithm Assume that the agent dynamics are x (α) i = u i, (6) where x (α) i is the αth order derivative of with α IR + and u i is the control input. An integer-order consensus algorithm is given by (). (ii) Integer-order agent dynamics with a fractional-order consensus algorithm Assume that the agent dynamics are given by (). A fractional-order consensus algorithm is proposed as u i = a ij [x (β) j x (β) i ], β IR (7) j N i (iii) Fractional-order agent dynamics with a fractional-order consensus algorithm Assume that the agent dynamics are given by (6). A fractional-order consensus algorithm is given by (7), where α IR + and β IR. When applying the aputo derivative to (6) and (7), it follows that ases (ii) and (iii) can be written as ase on both sides of the corresponding system. Therefore, the model in ase (i) can be considered a general model. For a system with n agents, using (), (6) can be written in matrix form as (i) by applying the operator a D β t a D α t X = LX, (8) where X and L are defined in (). Although the dynamics for a given system are fixed, α in the general model (8) can be changed by choosing consensus algorithms with different fractional orders. Note that L can be written in Jordan canonical form as L = P Λ Λ Λ k } {{ } Λ P, where Λ m, m =,,...,k, are standard Jordan blocks. Without loss of generality, let the initial time a =. By defining Y = P X, (8) can be written as For a given system, α is fixed. D α t Y = ΛY. (9) 9
3 47th IEEE D, ancun, Mexico, Dec. 9-, 8 Suppose that the diagonal entry of Λ i is λ i (i.e., an eigenvalue of L). Noting that the standard Jordan block λ i Λ i = λ i, λ i it follows that (9) can be decoupled into n one-dimensional equations represented by either D α t y i = λ i y i () for the equation corresponding to Λ i which has dimension equal to one or the last equation corresponding to Λ i which has dimension larger than one, or D α t y i = λ i y i y i+ () otherwise, where y i is the ith component of Y. Lemma.: When Re(λ i ), where Re( ) denotes the real part of a complex number, the solution of () has the following properties:. When α (, θ i ) and Re(λ i) >, lim y i as t, where θ i = arg{λ i } with arg{λ i } denoting the phase of λ i.. When α (,] and λ i =, y i y i (), t.. When α (,) and λ i =, y i = y i () + ẏ i ()t. 4. When α (, ), the system is not stable. Proof: (Proof of Property ) By taking the Laplace transform of (), it can be computed from the Laplace transform of L{ a Dt α f} in Section II- that L{y i } = y i( )s α, α (, ] () L{y i } = y i( )s α + ẏ i ( )s α, α (, ). () From () and (), it can be seen that the denominator of L{y i } is s α +λ i when α (, ). To ensure that all poles of L{y i } are in the open left half plane (LHP), it follows from the discussion in [9] that α (, ( arg{λ i}) ), that is, α (, θi θi ), where > because Re(λ i) >, i.e., arg{λ i } (, ). In particular, when λ i IR +, α (,) because arg{λ i } =. (Proof of Properties and ) The proofs of Properties and follow from []. (Proof of Property 4) See []. Lemma.: Assume that continuous function y i+ satisfies lim y i+ =. When Re(λ i ) > (i.e., arg{λ i } (, )) and α (, θ i ), where θ i = arg{λ i }, the solution of () satisfies lim y i =. Proof: When α (, ], by taking the Laplace transform of (), it can be computed from the Laplace transform of L{ a Dt α f} that L{y i } = sα y i ( ) L{y i+ }. (4) We follow the convention that arg{x} (, ] for x. It follows from the proof of Property in Lemma. that the poles of (4) are in the open LHP when α (,]. By applying the final value theorem of the Laplace transform, lim y i = lim sl{y i } s = lim s s α y i ( ) sl{y i+ } =, where we have used the fact sl{y i+ } = to derive the last equality because lim y i+ =. When α (, θ i ), it follows from the proof of Property in Lemma. that the poles of (4) are also in the open LHP. By taking the Laplace transform of (), it can be computed from the Laplace transform of L{ a Dt α f} that L{y i } = sα y i ( ) + s α ẏ i ( ) L{y i+ } s α. + λ i () Following a similar discussion for α (, ] gives lim y i =. Theorem.: Let λ i be the ith eigenvalue of L and θ = min θ i, where θ i = arg{λ i }. For λ i,,,,n fractional-order system (8), consensus is achieved if the fixed communication graph has a directed spanning tree and α (, θ ). When α (, ], the solution of (8) satisfies x j p T X() as t, where p is the left eigenvector of L associated with the zero eigenvalue satisfying p T =. When α (, θ ), the solution of (8) satisfies x j p T X() + p T Ẋ()t and ẋ i ẋ j p T Ẋ() as t. Proof: Noting that the communication graph has a directed spanning tree, it follows from Lemma. that L has a simple zero eigenvalue and all other eigenvalues have positive real parts. Without loss of generality, let λ = and Re(λ i ) >, i. When α (,], because λ = is a simple zero eigenvalue, λ satisfies (). It follows from Property in Lemma. that y y (). When λ i, i, satisfies (), it follows from Property in Lemma. that lim y i =, i. When λ i, i, satisfies (), it follows from Lemma. that lim y i =, i, as well because y i+ also satisfies either () or (), which implies lim y i+ =. ombining the above arguments gives lim Y = [y (),,, ] T, i, which implies lim X = lim PY = PSY () = PSP X(), where S = [s ij ] IR n n has only one nonzero entry s =. Note that the first column of P can be chosen as while the first row of P can be chosen as p by noting that and p are, respectively, a right and left eigenvector of L associated with λ = and p T =. Therefore, lim X = PSP X() = p T X(), that is, lim = p T X(). When α (, θ ), similar to the previous discussion for α (, ], λ satisfies (). It follows from Property in Lemma. that y = y () + ẏ ()t. Because Re(λ i ) > 9
4 47th IEEE D, ancun, Mexico, Dec. 9-, 8, i, similar to the previous discussion for α (, ], it follows from Property in Lemma. and Lemma. that lim y i =, i. Therefore, it follows that lim Y = [y () + ẏ ()t,,,] T, which implies that lim Ẏ = [ẏ (),,, ] T. Similar to the proof for α (, ], it follows directly that lim = p T X() + p T Ẋ()t and lim ẋi = p T Ẋ(). orollary.: Assume that the fixed communication graph is undirected. For fractional-order system (8), consensus is achieved if the communication graph is connected and α (,). The consensus equilibria when α (,] and α (, θ ) are the same as those in Theorem.. Proof: When the undirected communication graph is connected, it follows that there is a simple zero eigenvalue and other eigenvalues are positive, which implies that θ =. The statements then follow from the proof in Theorem.. Note that θ is closely related to the eigenvalues of L, which are also related to the number of agents. In the following, we characterize the relationship between α and the number of agents to ensure consensus. Lemma.: [] Let λ i be the ith eigenvalue of L, then arg{λ i } [ + n, n ] for all λ i. Theorem.: Assume that there are n agents with n. For fractional-order system (8), consensus is achieved if the fixed communication graph has a directed spanning tree and α (, + n ). Proof: It follows from Lemma. that arg{λ i } [ + n, θ n ], which implies + n. Therefore, the statement holds apparently from Theorem.. IV. OMPARISON BETWEEN ONSENSUS FOR FRATIONAL-ORDER AND INTEGER-ORDER SYSTEMS In this section, we discuss the difference between consensus for fractional-order systems and integer-order systems. To study this problem, we first derive the solutions of () and (). For α (, ], the Laplace transform of () is (). Taking the inverse Laplace transform of () gives y i = y i ( )E α ( λ i t α ). Similarly, for α (,), the solution of () is given by y i = y i ( )E α ( λ i t α ) + ẏ i ( )te α, ( λ i t α ). For α (, ], the Laplace transform of () is (4). Taking the inverse Laplace transform of (4) gives y i = y i ( )E α ( λ i t α ) y i+ [t α E α,α ( λ i t α )], where denotes the convolution operation. Similarly, for α (,), the solution of () is given by y i =y i ( )E α ( λ i t α ) + ẏ i ( )te α, ( λ i t α ) y i+ [t α E α,α ( λ i t α )]. It thus follows that the decaying speeds of Mittag- Leffler functions determine the speed at which y i, where Re{λ i } <, approaches zero. As a result, it follows that the E α ( t α ) α=. α=.4 α=.6 α=.8 α= 4 Time Fig.. Mittag-Leffler functions with different orders convergence speed of (8) is also determined by the decaying speeds of Mittag-Leffler functions due to the fact shown in the proof of Theorem. that consensus is achieved if y i = for all λ i. As a special case, when α =, (8) becomes () and the Mittag-Leffler functions in the solutions of () and () become exponential functions. To study the difference between consensus for fractional-order dynamics and integer-order dynamics, the decaying speeds of the Mittag-Leffler function E α ( λt α ) and exponential function e λt will be discussed in the following as an example. Theorem 4.: There exists a positive scalar T such that E α ( λt α ) decreases faster than e λt for t (,T), where λ IR + and α IR +. Proof: Note that both e λt and E α ( λt α ) equal to when t =. Taking derivatives of both functions gives d dt [e λt ] t= = λe λt t= = λ, d dt [E α( λt α )] t= =, α >. Because d dt [e λt ] and d dt [E α( λt α )] are continuous with respect to t, there exists a positive scalar T such that E α ( λt α ) decreases faster than e λt for t (,T) by using the comparison principle. To illustrate, Figs. and show Mittag-Leffler functions and their derivatives with different orders for λ =. From Fig., we can observe that the fractional-order system always converge faster than the integer-order system when t < T for some positive T. This property is desirable in realworld applications. For example, the coordination of a group of vehicles (aircraft/robots) requires a higher convergence speed when the deviations among vehicles are relatively large. However, when the deviations become small, it would be more realistic to decrease the convergence speed because of the mass inertia. Therefore, the proposed fractional-order consensus algorithm is practically useful. Remark 4.: In order to achieve higher consensus speed, a varying-order fractional-order consensus strategy can be When α =, the corresponding Mittag-Leffler function becomes the exponential function. 9
5 47th IEEE D, ancun, Mexico, Dec. 9-, 8 t E α, ( t α ) Fig..... α=. α=.4 α=.6 α=.8 α= 4 6 Time Derivatives of Mittag-Leffler functions with different orders adopted. The strategy can be described as follows: Let α < < α m < and choose α in (8) as α, t < t ; α = α i, t i t < t i, i =,,m;, t t m. Here t is chosen such that the convergence speed with order α is the highest when t < t. Similarly, t i, i =,,m, is chosen such that the convergence speed with order α i is highest for t [t i,t i ), and α = if t t m. Given the same L, the convergence speed of this varying-order fractional-order consensus strategy is higher than that of the single-integrator consensus strategy because the convergence speed of the proposed strategy is higher than that of the single-integrator consensus strategy for t < t m and equal to that of the single-integrator consensus strategy for t t m. V. SIMULATION ILLUSTRATIONS AND DISUSSIONS In this section, several simulation results are presented to illustrate the proposed fractional-order consensus algorithm introduced in Section III. We consider a group of four agents. The corresponding Laplacian matris chosen as L =. Note that the communication graph associated with L has a directed spanning tree. It can be computed that p = [,,,]T and the eigenvalues of L are, and. ±.866j, where j is the imaginary unit. For α (, ], let the initial states be X() = [6,,, ] T. When the fractional order is α =.8, the states are shown in Fig. (a). It can be seen that consensus is achieved with the final consensus equilibrium for being, which is equal to pt X(). When α = (i.e., the system takes in the form of single-integrator dynamics), the states are shown in Fig. (b). From these two figures, it can be observed that the convergence speed of the fractional-order case is higher than that of the single-integrator case when t is close to the origin. For α (, θ ), let X() = [6,,, ]T and Ẋ() = [,,, 4] T. It follows from the definition of θ in Theorem. that θ = 6, which implies α (, ). Figures (c) and (d) show the states for α =. and α =.9, respectively. From Fig. (c), it can be observed that consensus is achieved with the final equilibrium for ẋ i being, which is equal to p T Ẋ(). From Fig. (d), it can be observed that consensus cannot be achieved. The states using the varying-order fractional-order consensus strategy are shown in Fig. 4, where we arbitrarily choose t i =.i and α i =.i for i =,,, 4. From Fig. 4, we can see that the convergence speed using the varying-order fractional-order consensus strategy is higher than that of the integer-order consensus strategy as shown in Fig. (b). Of course, when we choose different parameters (α i,t i ) carefully as described in Remark 4., the convergence speed can be further improved Fig. 4. Simulation result of (8) with varying orders. VI. ONLUSION AND FUTURE WORK In this paper, we studied distributed coordination algorithms for multiple fractional-order systems when the fixed communication graph is directed. We presented a general fractional-order consensus model and then investigated its stability properties. Sufficient conditions on the communication graph and the fractional order were given to ensure consensus. In addition, we characterized the relationship between the fractional order and the number of agents to ensure consensus. Finally, a varying-order fractional-order consensus strategy was proposed to improve the overall convergence speed. Future work will explore fractionalorder consensus algorithms with time-varying or switching communication graphs. REFERENES [] R. L. Winkler, The consensus of subjective probability distributions, Manage Science, vol., no., pp. B6 B7, October 968. [] M. H. DeGroot, Reaching a consensus, Journal of American Statistical Association, vol. 69, no. 4, pp. 8, 974. [] T. Vicsek, A. zirok, E. B. Jacob, I. ohen, and O. Schochet, Novel type of phase transitions in a system of self-driven particles, Physical Review Letters, vol. 7, no. 6, pp. 6 9,
6 47th IEEE D, ancun, Mexico, Dec. 9-, (a) α =.8. 4 (b) α = (c) α = (d) α =.9. Fig.. Simulation results of (8) with different orders. [4] W. Ren, R. W. Beard, and E. M. Atkins, Information consensus in multivehicle cooperative control: ollective group behavior through local interaction, IEEE ontrol Systems Magazine, vol. 7, no., pp. 7 8, April 7. [] R. Olfati-Saber, Flocking for multi-agent dynamic systems: Algorithms and theory, IEEE Transactions on Automatic ontrol, vol., no., pp. 4 4, March 6. [6] G. Xie and L. Wang, onsensus control for a class of networks of dynamic agents, vol. 7, no. -, pp , July 7. [7] W. Ren and E. M. Atkins, Distributed multi-vehicle coordinated control via local information exchange, International Journal of Robust and Nonlinear ontrol, vol. 7, no., pp., July 7. [8] H. G. Tanner, A. Jadbabaie, and G. J. Pappas, Flocking in fixed and switching networks, IEEE Transactions on Automatic ontrol, vol., no., pp , May 7. [9] D. Lee and M. W. Spong, Stable flocking of multiple inertial agents on balanced graphs, IEEE Transactions on Automatic ontrol, vol., no. 8, pp , August 7. [] R. L. Bagley and P. J. Torvik, Fractional calculus - a different approach to the analysis of viscoelastically damped structures, AIAA J., vol., no., pp , 98. [], A theoretical basis for the application of fractional calculus to viscoelasticity, Journal of theology, vol. 7, no., pp., 98. [], On the fractional calculus model of viscoelastic behavior, Journal of theology, vol., no., pp., 986. [] Y. Kozlovsky, I. ohen, I. Golding, and E. Ben-Jacob, Lubricating bacteria model for branching growth of bacterial colonies, 999. [Online]. Available: citeseer.ist.psu.edu/kozlovsky99lubricating.html [4] I. ohen, I. Golding, I. G. Ron, and E. Ben-Jacob, Bio-uiddynamics of lubricating bacteria, Math. Meth. Appl. Sci, vol. 4, pp ,. [] W. Ren and R. W. Beard, onsensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE Transactions on Automatic ontrol, vol., no., pp. 6 66, May. [6] A. Jadbabaie, J. Lin, and A. S. Morse, oordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic ontrol, vol. 48, no. 6, pp. 988, June. [7] R. Olfati-Saber and R. M. Murray, onsensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic ontrol, vol. 49, no. 9, pp., September 4. [8] W. Ren, K. L. Moore, and Y. hen, High-order and model reference consensus algorithms in cooperative control of multi-vehicle systems, ASME Journal of Dynamic Systems, Measurement, and ontrol, vol. 9, no., pp , 7. [9] Y. hen, H.-S. Ahn, and I. Podlubny, Robust stability check of fractional order linear time invariant systems with interval uncertainties, (Elsevier) Signal Processing, vol. 86, pp. 6 68, March 6. [] I. Podlubny, Fractional Differential Equations. Academic press, 999. [] R. Gorenflo and F. Mainardi, Fractional oscillations and mittagleffler functions, 996. [Online]. Available: citeseer.ist.psu.edu/ gorenflo96fractional.html [] N. Dmitriev and E. Dynkin, On the characteristic numbers of a stochastic matrix,.r. (Doklady) Acad. Sci. URSS, vol. 49, no., pp. 9 6,
Automatica. Distributed discrete-time coordinated tracking with a time-varying reference state and limited communication
Automatica 45 (2009 1299 1305 Contents lists available at ScienceDirect Automatica journal homepage: www.elsevier.com/locate/automatica Brief paper Distributed discrete-time coordinated tracking with a
More informationComplex Laplacians and Applications in Multi-Agent Systems
1 Complex Laplacians and Applications in Multi-Agent Systems Jiu-Gang Dong, and Li Qiu, Fellow, IEEE arxiv:1406.186v [math.oc] 14 Apr 015 Abstract Complex-valued Laplacians have been shown to be powerful
More informationConsensus of Information Under Dynamically Changing Interaction Topologies
Consensus of Information Under Dynamically Changing Interaction Topologies Wei Ren and Randal W. Beard Abstract This paper considers the problem of information consensus among multiple agents in the presence
More informationConsensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED FOR PUBLICATION AS A TECHNICAL NOTE. 1 Consensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies Wei Ren, Student Member,
More informationConsensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED FOR PUBLICATION AS A TECHNICAL NOTE. Consensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies Wei Ren, Student Member,
More informationMulti-vehicle coordination for double-integrator dynamics under fixed undirected/directed interaction in a sampled-data setting
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL Int. J. Robust Nonlinear Control 010; 0:987 1000 Published online 13 August 009 in Wiley InterScience (www.interscience.wiley.com)..1495 Multi-vehicle
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (9) 71 715 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On the general consensus protocol
More informationGraph Theoretic Methods in the Stability of Vehicle Formations
Graph Theoretic Methods in the Stability of Vehicle Formations G. Lafferriere, J. Caughman, A. Williams gerardol@pd.edu, caughman@pd.edu, ancaw@pd.edu Abstract This paper investigates the stabilization
More informationConsensus seeking on moving neighborhood model of random sector graphs
Consensus seeking on moving neighborhood model of random sector graphs Mitra Ganguly School of Physical Sciences, Jawaharlal Nehru University, New Delhi, India Email: gangulyma@rediffmail.com Timothy Eller
More informationDiscrete Double Integrator Consensus
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 28 Discrete Double Integrator Consensus David W. Casbeer, Randy Beard, and A. Lee Swindlehurst Abstract A distributed
More informationConsensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude
SICE Journal of Control, Measurement, and System Integration, Vol 6, No 1, pp 007 013, January 2013 Consensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude MingHui
More informationConsensus Protocols for Networks of Dynamic Agents
Consensus Protocols for Networks of Dynamic Agents Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology Pasadena, CA 91125 e-mail: {olfati,murray}@cds.caltech.edu
More informationAverage-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control
Outline Background Preliminaries Consensus Numerical simulations Conclusions Average-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control Email: lzhx@nankai.edu.cn, chenzq@nankai.edu.cn
More informationDistributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach Yongcan Cao, Member, IEEE, and Wei Ren, Member, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 1, JANUARY 2012 33 Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach Yongcan Cao, Member, IEEE, and Wei Ren,
More informationConsensus Tracking for Multi-Agent Systems with Nonlinear Dynamics under Fixed Communication Topologies
Proceedings of the World Congress on Engineering and Computer Science Vol I WCECS, October 9-,, San Francisco, USA Consensus Tracking for Multi-Agent Systems with Nonlinear Dynamics under Fixed Communication
More informationConsensus of Hybrid Multi-agent Systems
Consensus of Hybrid Multi-agent Systems Yuanshi Zheng, Jingying Ma, and Long Wang arxiv:52.0389v [cs.sy] 0 Dec 205 Abstract In this paper, we consider the consensus problem of hybrid multi-agent system.
More informationExact Consensus Controllability of Multi-agent Linear Systems
Exact Consensus Controllability of Multi-agent Linear Systems M. ISAEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3, 08038 arcelona SPAIN maria.isabel.garcia@upc.edu
More informationFractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis
Cent Eur J Phys 11(6) 013 845-854 DOI: 10478/s11534-013-074-5 Central European Journal of Physics Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis
More informationConsensus Problems on Small World Graphs: A Structural Study
Consensus Problems on Small World Graphs: A Structural Study Pedram Hovareshti and John S. Baras 1 Department of Electrical and Computer Engineering and the Institute for Systems Research, University of
More informationDiscrete-time Consensus Filters on Directed Switching Graphs
214 11th IEEE International Conference on Control & Automation (ICCA) June 18-2, 214. Taichung, Taiwan Discrete-time Consensus Filters on Directed Switching Graphs Shuai Li and Yi Guo Abstract We consider
More informationStructural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems
Structural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems M. ISAL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, sc. C, 1-3, 08038 arcelona
More informationResearch on Consistency Problem of Network Multi-agent Car System with State Predictor
International Core Journal of Engineering Vol. No.9 06 ISSN: 44-895 Research on Consistency Problem of Network Multi-agent Car System with State Predictor Yue Duan a, Linli Zhou b and Yue Wu c Institute
More informationConsensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems
Consensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems M. ISABEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3,
More informationDistributed Robust Consensus of Heterogeneous Uncertain Multi-agent Systems
Distributed Robust Consensus of Heterogeneous Uncertain Multi-agent Systems Zhongkui Li, Zhisheng Duan, Frank L. Lewis. State Key Laboratory for Turbulence and Complex Systems, Department of Mechanics
More informationSJÄLVSTÄNDIGA ARBETEN I MATEMATIK
SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Consensus problems for multi-agent systems av Hongmei Zhao 2010 - No 2 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET,
More informationScaling the Size of a Multiagent Formation via Distributed Feedback
Scaling the Size of a Multiagent Formation via Distributed Feedback Samuel Coogan, Murat Arcak, Magnus Egerstedt Abstract We consider a multiagent coordination problem where the objective is to steer a
More informationDecentralized Control of Vehicle Formations
Portland State University PDXScholar Mathematics and Statistics Faculty Publications and Presentations Fariborz Maseeh Department of Mathematics and Statistics Decentralized Control of Vehicle Formations
More informationNotes on averaging over acyclic digraphs and discrete coverage control
Notes on averaging over acyclic digraphs and discrete coverage control Chunkai Gao Francesco Bullo Jorge Cortés Ali Jadbabaie Abstract In this paper, we show the relationship between two algorithms and
More informationFlocking while Preserving Network Connectivity
Flocking while Preserving Network Connectivity Michael M Zavlanos, Ali Jadbabaie and George J Pappas Abstract Coordinated motion of multiple agents raises fundamental and novel problems in control theory
More informationOn the Controllability of Nearest Neighbor Interconnections
On the Controllability of Nearest Neighbor Interconnections Herbert G. Tanner Mechanical Engineering Department University of New Mexico Albuquerque, NM 87 Abstract In this paper we derive necessary and
More information1520 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 9, SEPTEMBER Reza Olfati-Saber, Member, IEEE, and Richard M. Murray, Member, IEEE
1520 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 9, SEPTEMBER 2004 Consensus Problems in Networks of Agents With Switching Topology and Time-Delays Reza Olfati-Saber, Member, IEEE, and Richard
More informationTracking control for multi-agent consensus with an active leader and variable topology
Automatica 42 (2006) 1177 1182 wwwelseviercom/locate/automatica Brief paper Tracking control for multi-agent consensus with an active leader and variable topology Yiguang Hong a,, Jiangping Hu a, Linxin
More informationFast Linear Iterations for Distributed Averaging 1
Fast Linear Iterations for Distributed Averaging 1 Lin Xiao Stephen Boyd Information Systems Laboratory, Stanford University Stanford, CA 943-91 lxiao@stanford.edu, boyd@stanford.edu Abstract We consider
More informationA Note to Robustness Analysis of the Hybrid Consensus Protocols
American Control Conference on O'Farrell Street, San Francisco, CA, USA June 9 - July, A Note to Robustness Analysis of the Hybrid Consensus Protocols Haopeng Zhang, Sean R Mullen, and Qing Hui Abstract
More informationDistributed Adaptive Consensus Protocol with Decaying Gains on Directed Graphs
Distributed Adaptive Consensus Protocol with Decaying Gains on Directed Graphs Štefan Knotek, Kristian Hengster-Movric and Michael Šebek Department of Control Engineering, Czech Technical University, Prague,
More informationConsensus Algorithms are Input-to-State Stable
05 American Control Conference June 8-10, 05. Portland, OR, USA WeC16.3 Consensus Algorithms are Input-to-State Stable Derek B. Kingston Wei Ren Randal W. Beard Department of Electrical and Computer Engineering
More informationObtaining Consensus of Multi-agent Linear Dynamic Systems
Obtaining Consensus of Multi-agent Linear Dynamic Systems M I GRCÍ-PLNS Universitat Politècnica de Catalunya Departament de Matemàtica plicada Mineria 1, 08038 arcelona SPIN mariaisabelgarcia@upcedu bstract:
More informationMULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY
Jrl Syst Sci & Complexity (2009) 22: 722 731 MULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY Yiguang HONG Xiaoli WANG Received: 11 May 2009 / Revised: 16 June 2009 c 2009
More informationConsensus Based Formation Control Strategies for Multi-vehicle Systems
Proceedings of the 6 American Control Conference Minneapolis, Minnesota, USA, June 14-16, 6 FrA1.5 Consensus Based Formation Control Strategies for Multi-vehicle Systems Wei Ren Abstract In this paper
More informationFormation Control and Network Localization via Distributed Global Orientation Estimation in 3-D
Formation Control and Network Localization via Distributed Global Orientation Estimation in 3-D Byung-Hun Lee and Hyo-Sung Ahn arxiv:1783591v1 [cssy] 1 Aug 17 Abstract In this paper, we propose a novel
More informationFORMATIONS OF FORMATIONS: HIERARCHY AND STABILITY
FORMATIONS OF FORMATIONS: HIERARCHY AND STABILITY Anca Williams, Sonja lavaški, Tariq Samad ancaw@pdxedu, sonjaglavaski@honeywellcom Abstract In this paper we will consider a hierarchy of vehicle formations
More informationFinite-Time Distributed Consensus in Graphs with Time-Invariant Topologies
Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies Shreyas Sundaram and Christoforos N Hadjicostis Abstract We present a method for achieving consensus in distributed systems in
More informationFormation Control of Nonholonomic Mobile Robots
Proceedings of the 6 American Control Conference Minneapolis, Minnesota, USA, June -6, 6 FrC Formation Control of Nonholonomic Mobile Robots WJ Dong, Yi Guo, and JA Farrell Abstract In this paper, formation
More informationMulti-Hop Relay Protocols for Fast Consensus Seeking
Proceedings of the 5th IEEE Conference on Decision & Control Manchester Grand Hyatt Hotel San Diego, CA, USA, December 13-15, 6 WeB111 Multi-Hop Relay Protocols for Fast Consensus Seeking Zhipu Jin and
More informationAgreement Problems in Networks with Directed Graphs and Switching Topology
Technical Report CIT-CDS 3 5 Agreement Problems in Networks with Directed Graphs and Switching Topology Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology
More informationA Graph-Theoretic Characterization of Controllability for Multi-agent Systems
A Graph-Theoretic Characterization of Controllability for Multi-agent Systems Meng Ji and Magnus Egerstedt Abstract In this paper we continue our pursuit of conditions that render a multi-agent networked
More informationTheory and Applications of Matrix-Weighted Consensus
TECHNICAL REPORT 1 Theory and Applications of Matrix-Weighted Consensus Minh Hoang Trinh and Hyo-Sung Ahn arxiv:1703.00129v3 [math.oc] 6 Jan 2018 Abstract This paper proposes the matrix-weighted consensus
More informationANALYSIS OF CONSENSUS AND COLLISION AVOIDANCE USING THE COLLISION CONE APPROACH IN THE PRESENCE OF TIME DELAYS. A Thesis by. Dipendra Khatiwada
ANALYSIS OF CONSENSUS AND COLLISION AVOIDANCE USING THE COLLISION CONE APPROACH IN THE PRESENCE OF TIME DELAYS A Thesis by Dipendra Khatiwada Bachelor of Science, Wichita State University, 2013 Submitted
More informationMulti-Hop Relay Protocols for Fast Consensus Seeking
Multi-Hop Relay Protocols for Fast Consensus Seeking Zhipu Jin and Richard M Murray Abstract Consensus protocols in coordinated multi-agent systems are distributed algorithms Just using local information
More informationA Hyperparameter-Based Approach for Consensus Under Uncertainties
A Hyperparameter-Based Approach for Consensus Under Uncertainties The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published
More informationOUTPUT CONSENSUS OF HETEROGENEOUS LINEAR MULTI-AGENT SYSTEMS BY EVENT-TRIGGERED CONTROL
OUTPUT CONSENSUS OF HETEROGENEOUS LINEAR MULTI-AGENT SYSTEMS BY EVENT-TRIGGERED CONTROL Gang FENG Department of Mechanical and Biomedical Engineering City University of Hong Kong July 25, 2014 Department
More informationA Graph-Theoretic Characterization of Structural Controllability for Multi-Agent System with Switching Topology
Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference Shanghai, P.R. China, December 16-18, 29 FrAIn2.3 A Graph-Theoretic Characterization of Structural Controllability
More informationTheory of Cooperation in Complex Social Networks
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Theory of Cooperation in Complex Social Networks Bijan Ranjbar-Sahraei, Haitham Bou Ammar 2, Daan Bloembergen,3, Karl Tuyls 3,
More informationarxiv: v1 [physics.data-an] 28 Sep 2009
Synchronization in Networks of Coupled Harmonic Oscillators with Stochastic Perturbation and Time Delays arxiv:99.9v [physics.data-an] Sep 9 Yilun Shang Abstract In this paper, we investigate synchronization
More informationOn Bifurcations in Nonlinear Consensus Networks
American Control Conference Marriott Waterfront, Baltimore, MD, USA June -July, WeC.4 On Bifurcations in Nonlinear Consensus Networks Vaibhav Srivastava Jeff Moehlis Francesco Bullo Abstract The theory
More informationProblems in swarm dynamics and coordinated control
27 1 2010 1 : 1000 8152(2010)01 0086 08 Control Theory & Applications Vol. 27 No. 1 Jan. 2010,,,, (, 100871) :,.,,.,. : ; ; ; ; ; ; : TP13; TP18; O23; N941 : A Problems in swarm dynamics and coordinated
More informationConsensus Control of Multi-agent Systems with Optimal Performance
1 Consensus Control of Multi-agent Systems with Optimal Performance Juanjuan Xu, Huanshui Zhang arxiv:183.941v1 [math.oc 6 Mar 18 Abstract The consensus control with optimal cost remains major challenging
More informationMax-Consensus in a Max-Plus Algebraic Setting: The Case of Fixed Communication Topologies
Max-Consensus in a Max-Plus Algebraic Setting: The Case of Fixed Communication Topologies Behrang Monajemi Nejad, Sid Ahmed Attia and Jörg Raisch Control Systems Group ( Fachgebiet Regelungssysteme ),
More informationThe abundance of embedded computational
Information Consensus in Multivehicle Cooperative Control WEI REN, RANDAL W. BEARD, and ELLA M. ATKINS COLLECTIVE GROUP BEHAVIOR THROUGH LOCAL INTERACTION The abundance of embedded computational resources
More informationConsensus Seeking Using Multi-Hop Relay Protocol
1 Consensus Seeking Using Multi-Hop Relay Protocol Zhipu Jin and Richard M. Murray Abstract We consider the problem of average consensus seeking in networked multi-agent systems. Based on local information
More informationHierarchical Clustering and Consensus in Trust Networks
Hierarchical Clustering and Consensus in Trust etworks Santiago Segarra Alejandro Ribeiro Department of Electrical and Systems Engineering University of Pennsylvania Abstract We apply recent developments
More informationarxiv: v1 [cs.sy] 6 Jun 2016
Distance-based Control of K Formation with Almost Global Convergence Myoung-Chul Park, Zhiyong Sun, Minh Hoang Trinh, Brian D. O. Anderson, and Hyo-Sung Ahn arxiv:66.68v [cs.sy] 6 Jun 6 Abstract In this
More informationConsensus of Multi-Agent Systems with
Consensus of Multi-Agent Systems with 1 General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols arxiv:1109.3799v1 [cs.sy] 17 Sep 2011 Zhongkui Li, Wei Ren, Member, IEEE, Xiangdong
More informationOn Bifurcations. in Nonlinear Consensus Networks
On Bifurcations in Nonlinear Consensus Networks Vaibhav Srivastava Jeff Moehlis Francesco Bullo Abstract The theory of consensus dynamics is widely employed to study various linear behaviors in networked
More informationResearch Article H Consensus for Discrete-Time Multiagent Systems
Discrete Dynamics in Nature and Society Volume 05, Article ID 8084, 6 pages http://dx.doi.org/0.55/05/8084 Research Article H Consensus for Discrete- Multiagent Systems Xiaoping Wang and Jinliang Shao
More informationInformation Consensus and its Application in Multi-vehicle Cooperative Control
Brigham Young University BYU ScholarsArchive All Faculty Publications 2007-07-01 Information Consensus and its Application in Multi-vehicle Cooperative Control Ella Atkins Randal Beard beard@byu.edu See
More informationStability Analysis of Stochastically Varying Formations of Dynamic Agents
Stability Analysis of Stochastically Varying Formations of Dynamic Agents Vijay Gupta, Babak Hassibi and Richard M. Murray Division of Engineering and Applied Science California Institute of Technology
More informationEvolutionary Optimized Consensus and Synchronization Networks. Toshihiko Yamamoto, Hiroshi Sato, Akira Namatame* 1 Introduction
Int. J. Bio-Inspired Computation, Vol. x, No. x, 2009 2 Evolutionary Optimized Consensus and Synchronization Networks Toshihiko Yamamoto, Hiroshi Sato, Akira Namatame* Department of Computer Science National
More informationZeno-free, distributed event-triggered communication and control for multi-agent average consensus
Zeno-free, distributed event-triggered communication and control for multi-agent average consensus Cameron Nowzari Jorge Cortés Abstract This paper studies a distributed event-triggered communication and
More informationConsensus Analysis of Networked Multi-agent Systems
Physics Procedia Physics Procedia 1 1 11 Physics Procedia 3 1 191 1931 www.elsevier.com/locate/procedia Consensus Analysis of Networked Multi-agent Systems Qi-Di Wu, Dong Xue, Jing Yao The Department of
More informationOn Distributed Coordination of Mobile Agents with Changing Nearest Neighbors
On Distributed Coordination of Mobile Agents with Changing Nearest Neighbors Ali Jadbabaie Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 19104 jadbabai@seas.upenn.edu
More informationNotes on averaging over acyclic digraphs and discrete coverage control
Notes on averaging over acyclic digraphs and discrete coverage control Chunkai Gao a, Jorge Cortés b, Francesco Bullo a, a Department of Mechanical Engineering, University of California, Santa Barbara,
More informationConsensus, Flocking and Opinion Dynamics
Consensus, Flocking and Opinion Dynamics Antoine Girard Laboratoire Jean Kuntzmann, Université de Grenoble antoine.girard@imag.fr International Summer School of Automatic Control GIPSA Lab, Grenoble, France,
More informationOutput Synchronization on Strongly Connected Graphs
Output Synchronization on Strongly Connected Graphs Nikhil Chopra and Mark W. Spong Abstract In this paper we study output synchronization of networked multiagent systems. The agents, modeled as nonlinear
More informationFlocking of Discrete-time Multi-Agent Systems with Predictive Mechanisms
Preprints of the 8th IFAC World Congress Milano (Italy) August 28 - September 2, 2 Flocing of Discrete-time Multi-Agent Systems Predictive Mechanisms Jingyuan Zhan, Xiang Li Adaptive Networs and Control
More informationObserver-based Consensus Control Strategy for Multi-Agent System with Communication Time Delay
17th IEEE International Conference on Control Applications Part of 28 IEEE Multi-conference on Systems and Control San Antonio, Texas, USA, September 3-5, 28 FrA4.5 Observer-based Consensus Control Strategy
More informationEquilibrium points, stability and numerical solutions of fractional-order predator prey and rabies models
J. Math. Anal. Appl. 325 (2007) 542 553 www.elsevier.com/locate/jmaa Equilibrium points, stability and numerical solutions of fractional-order predator prey and rabies models E. Ahmed a, A.M.A. El-Sayed
More informationQuadratic and Copositive Lyapunov Functions and the Stability of Positive Switched Linear Systems
Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 WeA20.1 Quadratic and Copositive Lyapunov Functions and the Stability of
More informationOn the Scalability in Cooperative Control. Zhongkui Li. Peking University
On the Scalability in Cooperative Control Zhongkui Li Email: zhongkli@pku.edu.cn Peking University June 25, 2016 Zhongkui Li (PKU) Scalability June 25, 2016 1 / 28 Background Cooperative control is to
More informationApplied Mathematics Letters
Applied Mathematics Letters 24 (211) 219 223 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Laplace transform and fractional differential
More informationDistributed Tracking ControlforLinearMultiagent Systems With a Leader of Bounded Unknown Input
518 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 2, FEBRUARY 2013 Distributed Tracking ControlforLinearMultiagent Systems With a Leader of Bounded Unknown Input Zhongkui Li, Member,IEEE, Xiangdong
More informationOn Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems
1 On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems O. Mason and R. Shorten Abstract We consider the problem of common linear copositive function existence for
More informationStable Flocking of Mobile Agents, Part I: Fixed Topology
1 Stable Flocking of Mobile Agents, Part I: Fixed Topology Herbert G. Tanner, Ali Jadbabaie and George J. Pappas Department of Electrical and Systems Enginnering University of Pennsylvania Abstract This
More informationConsensus Problems in Networks of Agents with Switching Topology and Time-Delays
Consensus Problems in Networks of Agents with Switching Topology and Time-Delays Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology e-mails: {olfati,murray}@cds.caltech.edu
More informationStable Flocking Motion of Mobile Agents Following a Leader in Fixed and Switching Networks
International Journal of Automation and Computing 1 (2006) 8-16 Stable Flocking Motion of Mobile Agents Following a Leader in Fixed and Switching Networks Hui Yu, Yong-Ji Wang Department of control science
More informationarxiv: v1 [math.oc] 22 Jan 2008
arxiv:0801.3390v1 [math.oc] 22 Jan 2008 LQR-based coupling gain for synchronization of linear systems S. Emre Tuna tuna@eee.metu.edu.tr May 28, 2018 Abstract Synchronization control of coupled continuous-time
More informationScaling the Size of a Formation using Relative Position Feedback
Scaling the Size of a Formation using Relative Position Feedback Samuel Coogan a, Murat Arcak a a Department of Electrical Engineering and Computer Sciences, University of California, Berkeley Abstract
More informationIN the multiagent systems literature, the consensus problem,
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 63, NO. 7, JULY 206 663 Periodic Behaviors for Discrete-Time Second-Order Multiagent Systems With Input Saturation Constraints Tao Yang,
More informationOn consensus in multi-agent systems with linear high-order agents
Proceedings of the 7th World Congress he International Federation of Automatic Control On consensus in multi-agent systems with linear high-order agents Peter Wieland, Jung-Su Kim, Holger Scheu, and Frank
More informationStabilizing a Multi-Agent System to an Equilateral Polygon Formation
Stabilizing a Multi-Agent System to an Equilateral Polygon Formation Stephen L. Smith, Mireille E. Broucke, and Bruce A. Francis Abstract The problem of stabilizing a group of agents in the plane to a
More informationNCS Lecture 8 A Primer on Graph Theory. Cooperative Control Applications
NCS Lecture 8 A Primer on Graph Theory Richard M. Murray Control and Dynamical Systems California Institute of Technology Goals Introduce some motivating cooperative control problems Describe basic concepts
More informationInformation Aggregation in Complex Dynamic Networks
The Combined 48 th IEEE Conference on Decision and Control and 28 th Chinese Control Conference Information Aggregation in Complex Dynamic Networks Ali Jadbabaie Skirkanich Associate Professor of Innovation
More informationCombining distance-based formation shape control with formation translation
Combining distance-based formation shape control with formation translation Brian D O Anderson, Zhiyun Lin and Mohammad Deghat Abstract Steepest descent control laws can be used for formation shape control
More informationConsensus Problems in Complex-Weighted Networks
Consensus Problems in Complex-Weighted Networks arxiv:1406.1862v1 [math.oc] 7 Jun 2014 Jiu-Gang Dong, Li Qiu Abstract Consensus problems for multi-agent systems in the literature have been studied under
More informationAn Unbiased Kalman Consensus Algorithm
Proceedings of the 2006 American Control Conference Minneapolis, Minnesota, USA, June 14-16, 2006 ThC01.1 An Unbiased Kalman Consensus Algorithm Mehdi Alighanbari and Jonathan P. How Aerospace Controls
More informationObservability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation
1 Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation Mauro Franceschelli, Simone Martini, Magnus Egerstedt, Antonio Bicchi, Alessandro
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
More informationFinite-Field Consensus
Finite-Field Consensus Fabio Pasqualetti, Domenica Borra, and Francesco Bullo Abstract This work studies consensus networks over finite fields, where agents process and communicate values from the set
More informationConvergence of Consensus Filtering under Network Throughput Limitations
Convergence of Consensus Filtering under Network Throughput Limitations Yashan Sun and Michael D. Lemmon Abstract Consensus filters [] provide a distributed way of computing data aggregates in embedded
More informationObservability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation
Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation Mauro Franceschelli, Simone Martini, Magnus Egerstedt, Antonio Bicchi, Alessandro
More information