The purpose of this article is to provide a tutorial overview of information consensus in multivehicle cooperative control. Theoretical results regarding consensus-seeking under both time invariant and dynamically changing communication topologies are summarized. Several specific applications of consensus algorithms to multivehicle coordination are described

/pdf/information-consensus-in-multivehicle-cooperative-control-3bx4dd2yti.pdf

Information consensus in multivehicle cooperative control

We review the observations and the basic laws describing the essential aspects of collective motion -- being one of the most common and spectacular manifestation of coordinated behavior Our aim is to provide a balanced discussion of the various facets of this highly multidisciplinary field, including experiments, mathematical methods and models for simulations, so that readers with a variety of background could get both the basics and a broader, more detailed picture of the field The observations we report on include systems consisting of units ranging from macromolecules through metallic rods and robots to groups of animals and people Some emphasis is put on models that are simple and realistic enough to reproduce the numerous related observations and are useful for developing concepts for a better understanding of the complexity of systems consisting of many simultaneously moving entities As such, these models allow the establishing of a few fundamental principles of flocking In particular, it is demonstrated, that in spite of considerable differences, a number of deep analogies exist between equilibrium statistical physics systems and those made of self-propelled (in most cases living) units In both cases only a few well defined macroscopic/collective states occur and the transitions between these states follow a similar scenario, involving discontinuity and algebraic divergences

Collective Motion

This paper reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles, and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.

/pdf/an-overview-of-recent-progress-in-the-study-of-distributed-1xnb6e12se.pdf

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

In this note, we discuss finite-time state consensus problems for multi-agent systems and present one framework for constructing effective distributed protocols, which are continuous state feedbacks. By employing the theory of finite-time stability, we investigate both the bidirectional interaction case and the unidirectional interaction case, and prove that if the sum of time intervals, in which the interaction topology is connected, is sufficiently large, the proposed protocols will solve the finite-time consensus problems.

Finite-Time Consensus Problems for Networks of Dynamic Agents

In this paper, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented. By employing the method of finite-time Lyapunov functions, we derive conditions that guarantee the two protocols to solve the finite-time consensus problems respectively. Moreover, one of the two protocols solves the finite-time weighted-average consensus problem and can be successively applied to the systems with switching topology. Upper bounds of convergence times are also established. Simulations are presented to show the effectiveness of our results.

http://pris.bit.edu.cn/docs/20130419145628707418.pdf

Brief paper: Finite-time formation control for multi-agent systems

The paper studies asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times. The asynchrony means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.

/pdf/asynchronous-consensus-in-continuous-time-multi-agent-273qxmnu35.pdf

Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays

The paper studies asynchronous consensus problems of continuous-time multi-agent systems with discontinuous infor- mation transmission. The proposed consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times. The asynchrony means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermit- tent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.

Feng Xiao

Papers

Finite-Time Consensus Problems for Networks of Dynamic Agents

Finite-Time Consensus Problems for Networks of Dynamic Agents

Brief paper: Finite-time formation control for multi-agent systems

Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays

Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching