Add to ORKGThis paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted and neighbor-shared are de¯ned and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is de¯ned and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an illustration of the use of the concepts developed in this paper, graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.
Abstract — In this paper we discuss the consensus problem for a network of dynamic agents with undir...
We investigate a new consensus problem in networks of dynamic agents, where the agents in a network ...
This paper gives a lower bound on the convergence rate of a class of network consensus algorithms. T...
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consens...
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consens...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper studies a modified version of the Vicsek's problem, also known as the "consensus problem....
This paper formulates and solves a version of the widely studied Vicsek consensus problem in which e...
Abstract—In this paper, we discuss consensus problems for networks of dynamic agents with fixed and ...
Abstract—In this paper, we study the linear distributed asymptotic consensus problem for a network o...
Classical distributed algorithms for asymptotic average consensus typically assume timely and reliab...
This paper formulates and solves a continuoustime version of the widely studied Vicsek consensus pro...
Abstract — In this paper we discuss the consensus problem for a network of dynamic agents with undir...
We investigate a new consensus problem in networks of dynamic agents, where the agents in a network ...
This paper gives a lower bound on the convergence rate of a class of network consensus algorithms. T...
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consens...
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consens...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper uses recently established properties of compositions of directed graphs together with res...
This paper studies a modified version of the Vicsek's problem, also known as the "consensus problem....
This paper formulates and solves a version of the widely studied Vicsek consensus problem in which e...
Abstract—In this paper, we discuss consensus problems for networks of dynamic agents with fixed and ...
Abstract—In this paper, we study the linear distributed asymptotic consensus problem for a network o...
Classical distributed algorithms for asymptotic average consensus typically assume timely and reliab...
This paper formulates and solves a continuoustime version of the widely studied Vicsek consensus pro...
Abstract — In this paper we discuss the consensus problem for a network of dynamic agents with undir...
We investigate a new consensus problem in networks of dynamic agents, where the agents in a network ...
This paper gives a lower bound on the convergence rate of a class of network consensus algorithms. T...