Abstract-This paper provides a novel analysis of the global convergence properties of a well-known consensus protocol for multi-agent systems that evolve in continuous time on the nsphere. The feedback is intrinsic to the n-sphere, i.e., it does not rely on the use of local coordinates obtained through a parametrization. It is shown that, for any connected undirected graph topology and all n ∈ N\{1}, the consensus protocol yields convergence that is akin to almost global consensus in a weak sense. Simulation results suggest that actual almost global consensus holds. This result is of interest in the context of consensus on Riemannian manifolds since it differs from what is known with regard to the 1-sphere and SO(3) where more advanced intr...
Two consensus problems are considered in this paper. One is the consensus of linear multi-agent syst...
This paper addresses the global consensus problem of multi-agent systems with a leader-follower comm...
The present paper considers distributed consensus algorithms that involve N agents evolving on a con...
This paper provides a novel analysis of the global convergence properties of a well-known consensus ...
This paper establishes novel results regarding the global convergence properties of a large class of...
This paper establishes novel results regarding the global convergence properties of a large class of...
This paper concerns two aspects of the multi- agent consensus problem on the n-sphere. Firstly, it p...
This paper introduces a new lifting method for analyzing convergence of continuous-time distributed ...
The thesis studies the problem of consensus, considering a set of N agents locally exchanging inform...
In view of the fact that prototypes of Riemannian manifolds range from Euclidean surfaces to Lie gro...
The present paper considers distributed consensus algorithms for agents evolving on a connected comp...
Abstract. In this paper, we present new results on consensus for continuous-time multi-agent systems...
The paper introduces a new class of consensus protocols to reach an agreement in networks of agents ...
International audienceIn this paper, we present new results on consensus for continuous-time multiag...
Convergence properties of distributed consensus protocols on networks of dynamical agents have been ...
Two consensus problems are considered in this paper. One is the consensus of linear multi-agent syst...
This paper addresses the global consensus problem of multi-agent systems with a leader-follower comm...
The present paper considers distributed consensus algorithms that involve N agents evolving on a con...
This paper provides a novel analysis of the global convergence properties of a well-known consensus ...
This paper establishes novel results regarding the global convergence properties of a large class of...
This paper establishes novel results regarding the global convergence properties of a large class of...
This paper concerns two aspects of the multi- agent consensus problem on the n-sphere. Firstly, it p...
This paper introduces a new lifting method for analyzing convergence of continuous-time distributed ...
The thesis studies the problem of consensus, considering a set of N agents locally exchanging inform...
In view of the fact that prototypes of Riemannian manifolds range from Euclidean surfaces to Lie gro...
The present paper considers distributed consensus algorithms for agents evolving on a connected comp...
Abstract. In this paper, we present new results on consensus for continuous-time multi-agent systems...
The paper introduces a new class of consensus protocols to reach an agreement in networks of agents ...
International audienceIn this paper, we present new results on consensus for continuous-time multiag...
Convergence properties of distributed consensus protocols on networks of dynamical agents have been ...
Two consensus problems are considered in this paper. One is the consensus of linear multi-agent syst...
This paper addresses the global consensus problem of multi-agent systems with a leader-follower comm...
The present paper considers distributed consensus algorithms that involve N agents evolving on a con...