Search

This paper studies how to control large formations of autonomous agents in the plane, assuming that each agent is able to sense relative positions of its neighboring agents with respect to its own local coordinate system. We tackle the problem by adopting two types of controllers. First, we use the classical gradient-based controllers on three leader agents to meet their distance constraints. Second, we develop other type of controllers for follower agents: utilizing the properties of rooted graphs, one is able to design linear controllers incorporating relative positions between the follower agents and their neighbors, to stabilize the overall large formations. The advantages of the proposed method are fourfold: (i) fewer constraints on neighboring relationship graphs; (ii) simplicity of linear controllers for follower agents; (iii) global convergence of the overall formations; (iv) implementation in local coordinate systems, in no need of a global coordinate system. Numerical simulations show the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Abstract: Without assuming that the interaction diagraph is strongly connected or contains a directed spanning tree, this paper studies the second-order leader-following consensus problem of nonlinear multi-agent systems with general network topologies. Based on graph theory, matrix theory, and LaSalle’s invariance principle, a pinning control algorithm is proposed to achieve leader-following consensus in a network of agents with nonlinear second-order dynamics. Furthermore, a pinning consensus protocol is developed for coupled double-integrators with a constant reference velocity. In particular, this paper addresses what kind of agents and how many agents should be pinned, and establishes some sufficient conditions to guarantee that all agents asymptotically follow the virtual leader. Numerical simulations are given to verify the theoretical analysis. [ABSTRACT FROM AUTHOR]

In this paper, we study the adaptive coordinated tracking problem for continuous-time first-order integrator systems with quantized information under switching undirected and fixed directed communication graphs, respectively. The combined effect of quantized relative information error and quantized absolute information error on the tracking result is investigated. Both the logarithmic quantizers and uniform quantizers are considered. It is shown that when logarithmic quantizers are used, exact coordinated tracking can still be achieved by properly choosing the design parameters in the controller while when uniform quantizers are used, practical coordinated tracking can be achieved with tracking error bounds proportional to the quantizer parameter. Simulation examples are provided to illustrate the results. [ABSTRACT FROM AUTHOR]

Abstract: By controllability of multi-agent systems, we mean the property that all agents can be driven to arbitrary configurations only through regulating a few leaders externally, while the rest of the agents are subject to the nearest-neighbor-law. It is known that the controllability of multi-agent systems depends not only on the communication topologies among agents but also on the selection of leaders. The main objective of this paper aims to characterize the virtue that leaders should have from the perspective of algebraic and graphical conditions. We begin with a heuristic observation for tree graph. To gain more insights, necessary and sufficient conditions are then proposed in terms of downer branch and subgraphs, respectively. In particular, it is shown for path topologies that controllability completely depends on the leaders’ location. The obtained results may help us to pave the way towards a new method of formation and reconfiguration control in swarming robots. [Copyright &y& Elsevier]