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.

/pdf/consensus-problems-in-networks-of-agents-with-switching-25c3hqvtd8.pdf

Consensus problems in networks of agents with switching topology and time-delays

We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We prove a Nyquist criterion that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability. We also propose a method for decentralized information exchange between vehicles. This approach realizes a dynamical system that supplies each vehicle with a common reference to be used for cooperative motion. We prove a separation principle that decomposes formation stability into two components: Stability of this is achieved information flow for the given graph and stability of an individual vehicle for the given controller. The information flow can thus be rendered highly robust to changes in the graph, enabling tight formation control despite limitations in intervehicle communication capability.

/pdf/information-flow-and-cooperative-control-of-vehicle-4ws61wioze.pdf

Information flow and cooperative control of vehicle formations

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

Coverage control for mobile sensing networks

This paper addresses the consensus problem of multiagent systems with a time-invariant communication topology consisting of general linear node dynamics. A distributed observer-type consensus protocol based on relative output measurements is proposed. A new framework is introduced to address in a unified way the consensus of multiagent systems and the synchronization of complex networks. Under this framework, the consensus of multiagent systems with a communication topology having a spanning tree can be cast into the stability of a set of matrices of the same low dimension. The notion of consensus region is then introduced and analyzed. It is shown that there exists an observer-type protocol solving the consensus problem and meanwhile yielding an unbounded consensus region if and only if each agent is both stabilizable and detectable. A multistep consensus protocol design procedure is further presented. The consensus with respect to a time-varying state and the robustness of the consensus protocol to external disturbances are finally discussed. The effectiveness of the theoretical results is demonstrated through numerical simulations, with an application to low-Earth-orbit satellite formation flying.

Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint

Most of the signal processing that we will study in this course involves local operations on a signal, namely transforming the signal by applying linear combinations of values in the neighborhood of each sample point. You are familiar with such operations from Calculus, namely, taking derivatives and you are also familiar with this from optics namely blurring a signal. We will be looking at sampled signals only. Let's start with a few basic examples. Local difference Suppose we have a 1D image and we take the local difference of intensities, DI(x) = 1 2 (I(x + 1) − I(x − 1)) which give a discrete approximation to a partial derivative. (We compute this for each x in the image.) What is the effect of such a transformation? One key idea is that such a derivative would be useful for marking positions where the intensity changes. Such a change is called an edge. It is important to detect edges in images because they often mark locations at which object properties change. These can include changes in illumination along a surface due to a shadow boundary, or a material (pigment) change, or a change in depth as when one object ends and another begins. The computational problem of finding intensity edges in images is called edge detection. We could look for positions at which DI(x) has a large negative or positive value. Large positive values indicate an edge that goes from low to high intensity, and large negative values indicate an edge that goes from high to low intensity. Example Suppose the image consists of a single (slightly sloped) edge:

http://ieeexplore.ieee.org/iel5/5/31307/01456462.pdf

Linear systems

This paper addresses the problem of coordinating multiple spacecraft to fly in tightly controlled formations. The main contribution of the paper is to introduce a coordination architecture that subsumes leader-following, behavioral, and virtual-structure approaches to the multiagent coordination problem. The architecture is illustrated through a detailed application of the ideas to the problem of synthesizing a multiple spacecraft interferometer in deep space.

/pdf/a-coordination-architecture-for-spacecraft-formation-control-4svhkbrfe5.pdf

A coordination architecture for spacecraft formation control

Formation flying is defined as a set of more than one spacecraft whose states are coupled through a common control law. This paper provides a comprehensive survey of spacecraft formation flying control (FFC), which encompasses design techniques and stability results for these coupled-state control laws. We divide the FFC literature into five FFC architectures: (i) multiple-input multiple-output, in which the formation is treated as a single multiple-input, multiple-output plant, (ii) leader/follower, in which individual spacecraft controllers are connected hierarchically, (iii) virtual structure, in which spacecraft are treated as rigid bodies embedded in an overall virtual rigid body, (iv) cyclic, in which individual spacecraft controllers are connected non-hierarchically, and (v) behavioral, in which multiple controllers for achieving different (and possibly competing) objectives are combined. This survey significantly extends an overview of the FFC literature provided by Lawton, which discussed the L/F, virtual structure and behavioral architectures. We also include a brief history of the formation flying literature, and discuss connections between spacecraft FFC and other multi-vehicle control problems in the robotics and automated highway system literatures.

/pdf/a-survey-of-spacecraft-formation-flying-guidance-and-control-410faahlui.pdf

A survey of spacecraft formation flying guidance and control. Part II: control

Ideas from elementary graph theory and linear matrix inequalities are combined with logic-based switching to shed light on the various control strategies which are feasible in the leader-following framework for the formation flying of multiple spacecraft.

Formation Flying Control of Multiple Spacecraft via Graphs, Matrix Inequalities, and Switching

This paper provides a comprehensive survey of spacecraft formation flying guidance (FTG). Here by the term guidance we mean both path planning and optimal, open loop control design.

A survey of spacecraft formation flying guidance and control (part 1): guidance

DOI: 10.2514/1.G000218 This paper presents a decentralized, model predictive control algorithm for the optimal guidance and reconfiguration of swarms of spacecraft composed of hundreds to thousands of agents with limited capabilities. In previous work, J2-invariantorbitshavebeenfoundtoprovidecollision-freemotionforhundredsoforbitsinalowEarthorbit. This paper develops real-time optimal control algorithms for the swarm reconfiguration that involve transferring from one J2-invariant orbit to another while avoidingcollisions and minimizing fuel. The proposedmodel predictive control-sequential convex programming algorithm uses sequential convex programming to solve a series of approximate path planning problems until the solution converges. By updating the optimal trajectories during the reconfiguration, the model predictive control algorithm results in decentralized computations and communication between neighboring spacecraft only. Additionally, model predictive control reduces the horizon of the convex optimizations, which reduces the run time of the algorithm. Multiple time steps, time-varying collision constraints, and communication requirements are developed to guarantee stability, feasibility, and robustness of the model predictive control-sequential convex programming algorithm.

Fred Y. Hadaegh

Papers

A coordination architecture for spacecraft formation control

A survey of spacecraft formation flying guidance and control. Part II: control

Formation Flying Control of Multiple Spacecraft via Graphs, Matrix Inequalities, and Switching

A survey of spacecraft formation flying guidance and control (part 1): guidance

Model Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming