### Citations

1213 | Coordination of groups of mobile autonomous agents using nearest neighbor rules,”
- Jadbabaie, Lin, et al.
- 2003
(Show Context)
Citation Context ...ntrol; consensus protocols. 1. Introduction Distributed coordination for multi-agent systems has become an active research topic and attracted great attention of researchers in recent years; see e.g. =-=[7, 10, 11, 13, 14, 15, 16]-=-. A typical problem in the area is agreement or consensus problem, which means to design a network protocol based on the local information obtained by each agent, such that all agents finally reach an... |

1029 | Consensus problems in networks of agents with switching topology and timedelays
- Olfati-Saber, Murray
- 2004
(Show Context)
Citation Context ...ntrol; consensus protocols. 1. Introduction Distributed coordination for multi-agent systems has become an active research topic and attracted great attention of researchers in recent years; see e.g. =-=[7, 10, 11, 13, 14, 15, 16]-=-. A typical problem in the area is agreement or consensus problem, which means to design a network protocol based on the local information obtained by each agent, such that all agents finally reach an... |

852 | Algebraic Graph Theory
- Godsil, Royle
- 2001
(Show Context)
Citation Context ...imulations are given in Section 4 and we draw conclusion in Section 5. 2. Problem formulation In general, information exchange between agents in a multi-agent system can be modeled by directed graphs =-=[4, 13]-=-. Before we proceed, we first introduce some basic concepts and notions in graph theory. Let G(A) = (V(G), E(G), A) be a weighted directed graph with the set of vertices V(G) = {1,2, · · · ,n} and the... |

840 |
Ordinary Differentiable Equations
- Hartman
- 1964
(Show Context)
Citation Context ...mark 1. The continuity in Assumption (A1) is meant to guarantee the existence of solutions of differential equations (1) on [0, ∞) for any initial value x(0), as is indicated by Peano’s Theorem (e.g. =-=[6]-=- pp.10). Remark 2. It is easy to see that the linear protocol proposed in [13] (i.e. by setting fi(x) = kx for k > 0) does not satisfy Assumption (A2). In fact, consensus can never occur in a finite t... |

757 | Consensus and cooperation in networked multi-agent systems
- Olfati-Saber, Fax, et al.
- 2007
(Show Context)
Citation Context ...pectrum of applications including formation control, distributed filtering, multi-sensor data fusion, and distributed computation, to cite but a few examples. We refer the reader to the survey papers =-=[12, 21]-=- and references therein. In the study of consensus problems, convergence rate is an important index to evaluate the proposed protocol. Most of the existing protocols (including those appeared in the a... |

408 | Flocking for multi-agent dynamic systems: Algorithms and theory
- Olfati-Saber
- 2006
(Show Context)
Citation Context ...ntrol; consensus protocols. 1. Introduction Distributed coordination for multi-agent systems has become an active research topic and attracted great attention of researchers in recent years; see e.g. =-=[7, 10, 11, 13, 14, 15, 16]-=-. A typical problem in the area is agreement or consensus problem, which means to design a network protocol based on the local information obtained by each agent, such that all agents finally reach an... |

401 | Consensus seeking in multiagent systems under dynamically changing interaction topologies - Ren, Beard - 2005 |

220 | Information consensus in multivehicle cooperative control: Collective group behavior through local interaction
- Ren, Beard, et al.
(Show Context)
Citation Context |

156 | Agreement over random networks
- Hatano, Mesbahi
- 2005
(Show Context)
Citation Context |

58 | Finite-time convergent gradient flows with applications to network consensus
- Cortes
- 2006
(Show Context)
Citation Context ...s where finite-time convergence is a desirable property. Recently, finite-time consensus problems have attracted the attention of some researchers. Some related works are briefly reviewed as follows. =-=[2]-=- introduces the signed gradient descent flows which serve as discontinuous protocols for finite-time coordination under connected undirected topologies. Two discontinuous distributed algorithms are ch... |

56 |
Finite-time stability of continuous autonomous systems
- Bhat, Bernstein
- 2000
(Show Context)
Citation Context ...e aim to identify general criteria for solving finite-time consensus problems with continuous protocols under directed weighted fixed topologies. Based on the theory of finite-time Lyapunov stability =-=[1, 5]-=-, we show that under protocols satisfying our conditions, the states of agents reach a consensus in finite time when the interaction topology has a directed spanning tree. Novel protocols are proposed... |

34 |
Finite time controllers
- Haimo
- 1986
(Show Context)
Citation Context ...e aim to identify general criteria for solving finite-time consensus problems with continuous protocols under directed weighted fixed topologies. Based on the theory of finite-time Lyapunov stability =-=[1, 5]-=-, we show that under protocols satisfying our conditions, the states of agents reach a consensus in finite time when the interaction topology has a directed spanning tree. Novel protocols are proposed... |

26 | Finite-time consensus problems for networks of dynamic agents
- Wang, Xiao
- 2010
(Show Context)
Citation Context ...pectively, max and min consensus in finite time over strongly connected digraphs. Several classes of continuous nonlinear protocols coming out of the typical linear protocol in [13] are considered by =-=[19, 20]-=-. The authors show that they are efficient finitetime agreement protocols provided the directed interconnection topology has a spanning tree. The question of having communication delays is further dis... |

16 |
Finite-time semistability and consensus for nonlinear dynamical networks
- Hui, Haddad, et al.
- 2008
(Show Context)
Citation Context ...ow that they are efficient finitetime agreement protocols provided the directed interconnection topology has a spanning tree. The question of having communication delays is further discussed in [17]. =-=[8, 9]-=- deal with finite-time consensus under a general framework for finite-time semistability of homogeneous systems, and the underlying topology is assumed to be a connected undirected graph. A continuous... |

8 | Fast information sharing in networks of autonomous agents - Xiao, Wang, et al. - 2008 |

3 |
Semistability theory for differential inclusions with applications to consensus problems in dynamical networks with switching topology
- Hui, Haddad, et al.
- 2008
(Show Context)
Citation Context ...ow that they are efficient finitetime agreement protocols provided the directed interconnection topology has a spanning tree. The question of having communication delays is further discussed in [17]. =-=[8, 9]-=- deal with finite-time consensus under a general framework for finite-time semistability of homogeneous systems, and the underlying topology is assumed to be a connected undirected graph. A continuous... |

1 |
Finite time agreement protocol design of multiagent systems with communication delays
- Wang, Chen, et al.
(Show Context)
Citation Context ...ors show that they are efficient finitetime agreement protocols provided the directed interconnection topology has a spanning tree. The question of having communication delays is further discussed in =-=[17]-=-. [8, 9] deal with finite-time consensus under a general framework for finite-time semistability of homogeneous systems, and the underlying topology is assumed to be a connected undirected graph. A co... |

1 |
Finite-time tracking control of a nonholonomic mobile robot
- Wang, Li, et al.
(Show Context)
Citation Context ...k for finite-time semistability of homogeneous systems, and the underlying topology is assumed to be a connected undirected graph. A continuous finite-time tracking control problem is investigated in =-=[18]-=- for a non-holonomic wheeled mobile robot by carefully selecting control gains. 1 Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, CHINA. email: shyl@sjtu.edu.cn 1In this no... |