This paper solves the rendezvous problem for a network of underactuated rigid bodies such as quadrotor helicopters. A control strategy is presented that makes the centres of mass of the vehicles converge to an arbitrarily small neighborhood of one another. The convergence is global, and each vehicle can compute its own control input using only an on-board camera and a three-axis rate gyroscope. No global positioning system is required, nor any information about the vehicles' attitudes.
Typical coordination problems include attitude synchronization, rendezvous, flocking, and formation control. For networks of single or double-integrator systems, the rendezvous problem is referred to as consensus or agreement , and it has been investigated by many researchers, for instance @cite_34 @cite_8 @cite_2 @cite_14 @cite_12 @cite_22 @cite_5 @cite_30 .
@cite_30 @cite_14 @cite_22 @cite_8 @cite_2 @cite_5 @cite_34 @cite_12
2114482313 2099175737 2107396783 2143843955 2050505323 2168132433
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main result is the construction of a dynamic output feedback coupling that achieves synchronization if the decoupled systems have no exponentially unstable mode and if the communication graph is uniformly connected. The result can be interpreted as a generalization of classical consensus algorithms. Stronger conditions are shown to be sufficient-but to some extent, also necessary-to ensure synchronization with the diffusive static output coupling often considered in the literature. This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. This note shows that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves. In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results. This paper studies some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems. First, basic theoretical analysis is carried out for the case where for each agent the second-order dynamics are governed by the position and velocity terms and the asymptotic velocity is constant. A necessary and sufficient condition is given to ensure second-order consensus and it is found that both the real and imaginary parts of the eigenvalues of the Laplacian matrix of the corresponding network play key roles in reaching consensus. Based on this result, a second-order consensus algorithm is derived for the multi-agent system facing communication delays. A necessary and sufficient condition is provided, which shows that consensus can be achieved in a multi-agent system whose network topology contains a directed spanning tree if and only if the time delay is less than a critical value. Finally, simulation examples are given to verify the theoretical analysis. This paper describes a distributed coordination scheme with local information exchange for multiple vehicle systems. We introduce second-order consensus protocols that take into account motions of the information states and their derivatives, extending first-order protocols from the literature. We also derive necessary and sufficient conditions under which consensus can be reached in the context of unidirectional information exchange topologies. This work takes into account the general case where information flow may be unidirectional due to sensors with limited fields of view or vehicles with directed, power-constrained communication links. Unlike the first-order case, we show that having a (directed) spanning tree is a necessary rather than a sufficient condition for consensus seeking with second-order dynamics. This work focuses on a formal analysis of information exchange topologies that permit second-order consensus. Given its importance to the stability of the coordinated system, an analysis of the consensus term control gains is also presented, specifically the strength of the information states relative to their derivatives. As an illustrative example, consensus protocols are applied to coordinate the movements of multiple mobile robots. Copyright © 2006 John Wiley & Sons, Ltd. We study the stability properties of linear time-varying systems in continuous time whose system matrix is Metzler with zero row sums. This class of systems arises naturally in the context of distributed decision problems, coordination and rendezvous tasks and synchronization problems. The equilibrium set contains all states with identical state components. We present sufficient conditions guaranteeing uniform exponential stability of this equilibrium set, implying that all state components converge to a common value as time grows unbounded. Furthermore it is shown that this convergence result is robust with respect to an arbitrary delay, provided that the delay affects only the off-diagonal terms in the differential equation.