Stability of multiagent systems with time-dependent communication links

By Luc Moreau. 2005

2,787 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Molecular Biology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Molecular Biology

Citations in the corpus

Distributed optimization over time-varying directed graphs (2013, positive): “. We ﬁrst remark that the matrices A(t) have a special structure that allows us to efﬁciently analyze their products. Speciﬁcally, we have the following properties of the matrices A(t) (see [2], [8], [15], [19], [33] for proofs of this and similar statements). Lemma 2: Suppose that the graph sequenc”
Mean square average-consensus under measurement noises and fixed topologies: Necessary and sufficient conditions (2009, background): “The convergence properties of the system (13) and its discretetime version have been widely studied (Moreau, 2005; Moreau & Belgium, 2004; Tsitsiklis, Bertsekas, & Athans, 1986).”
Cooperative Minimum Time Surveillance With Multiple Ground Vehicles (2010, background): “is not required for asymptotic convergence to the agreement subspace, see [45].”
Global consensus for discrete-time multi-agent systems with input saturation constraints (2014, result): “The studies on the discrete-time case are rather limited, but some results can be found in (e.g., Jadbabaie et al., 2003; Blondel, Hendrickx, Olshevsky, and Tsitsiklis, 2005; Tuna, 2008; Moreau, 2005; Ren and Beard, 2005; Zhang and Tian, 2009; You and Xie, 2011).”
Reaching a consensus via pinning control (2009, background): “…Tianjin 300071, PR China b Department of Media and Communication, City University of Hong Kong, Kowloon, Hong Kong a r t i c l e i n f o Article history: Received 8 July 2008 Received in revised form 27 November 2008 Accepted 8 December 2008 Available online 9 March 2009 Keywords:…”
Discrete-time dynamic average consensus (2010, background): “Key words: Consensus algorithms, multi-agent systems, cooperative control”
Cooperative Control of Multiple Nonholonomic Mobile Agents (2008, result): “In contrast to the results in [20], [32] which give a set of conditions under which the stability of multiple agents can be achieved, in this paper we explicitly propose cooperative control laws for each nonholonomic agent in chained form.”
Cooperative Control of Dynamical Systems With Application to Autonomous Vehicles (2009, background): “combination of graph theory, convexity, and discrete-set-valued Lyapunov functions [28].”
Lyapunov-Based Approach to Multiagent Systems With Switching Jointly Connected Interconnection (2007, background): “[9] reported a simple network model of agents interacting via time-dependent communication links based on graph theory and set-valued Lyapunov theory.”
Agreeing Asynchronously (2008, background): “In particular, we prove that the conditions under which a consensus is achieved are essentially the same as those in the synchronous case derived in [7], [8] provided the notion of an agent’s neighbor between its event times is appropriately defined.”
State Agreement for Continuous-Time Coupled Nonlinear Systems (2007, methodology): “The first is the continuous-time counterpart to the result of Moreau [27].”
The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case (2007, result): “3 It is worth noting that a similar proof could also be crafted using recent results by Moreau which appeared in [ 21 ]”
Stabilization of collective motion on a sphere (2009, methodology): “A key component of the extension to limited communication is the inclusion into the control algorithm of a decentralized consensus filter (Moreau, 2005; Olfati-Saber, Fax, & Murray, 2007; Ren & Beard, 2005) that enables each particle to estimate the average properties of the group (Scardovi,…”
Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies (2011, background): “Switching network topologies were studied in Moreau (2005), Olfati-Saber, Fax, and Murray (2007), and more recently in Huang, , the authors considered stochastic consensus over lossy wireless networks, in which the proposed measurement model has a random link gain, an additive noise, and a Markov…”