Graph Laplacians and Stabilization of Vehicle Formations

Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we merge tools from graph theory and control theory to derive stability criteria for formation stabilization. The interconnection between vehicles (i.e., which vehicles are sensed by other vehicles) is modeled as a graph, and the eigenvalues of the Laplacian matrix of the graph are used in stating a Nyquist-like stability criterion for vehicle formations. The location of the Laplacian eigenvalues can be correlated to the graph structure, and therefore used to identify desirable and undesirable formation interconnection topologies

Reply to “Comments on “Consensus and Cooperation in Networked Multi-Agent Systems””

[No abstract

Information flow and cooperative control of vehicle formations

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

Distributed LQR-based Suboptimal Control for Coupled Linear Systems

A well-established distributed LQR method for decoupled systems is extended to the dynamically coupled case where the open-loop systems are dynamically dependent. First, a fully centralized controller is designed which is subsequently substituted by a distributed state-feedback gain with sparse structure. The control scheme is obtained by optimizing an LQR performance index with a tuning parameter utilized to emphasize/de-emphasize relative state difference between interconnected systems. Overall stability is guaranteed via a simple test applied to a convex combination of Hurwitz matrices, the validity of which leads to stable global operation for a class of interconnection schemes. It is also shown that the suboptimality of the method can be assessed by measuring a certain distance between two positive definite matrices which can be obtained by solving two Lyapunov equations

Tracking control for multi-agent consensus with an active leader and variable topology

In this paper, we consider the coordination control of a group of autonomous mobile agents with multiple leaders. Different interconnection topologies are investigated. At first, a necessary and sufficient condition is proved in the case of fixed interconnection topology. Then a sufficient condition is proposed when the interconnection topology is switched. With a simple first-order dynamics model by using the neighborhood rule, both results show that the group behavior of the agents will converge to the polytope formed by the leaders.Comment: 6 page

Distributed tracking control of leader-follower multi-agent systems under noisy measurement

In this paper, a distributed tracking control scheme with distributed estimators has been developed for a leader-follower multi-agent system with measurement noises and directed interconnection topology. It is supposed that each follower can only measure relative positions of its neighbors in a noisy environment, including the relative position of the second-order active leader. A neighbor-based tracking protocol together with distributed estimators is designed based on a novel velocity decomposition technique. It is shown that the closed loop tracking control system is stochastically stable in mean square and the estimation errors converge to zero in mean square as well. A simulation example is finally given to illustrate the performance of the proposed control scheme.Comment: 8 Pages, 3 figure

Adaptive sliding mode observation in a network of dynamical systems

This paper considers the problem of reconstructing state information in all the nodes of a complex network of dynamical systems. The individual nodes comprise a known linear part and unknown but bounded uncertainties in certain channels of the system. A supervisory adaptive sliding mode observer configuration is proposed for estimating the states. A linear matrix inequality (LMI) approach is suggested to synthesise the gains of the sliding mode observer. Although deployed centrally to estimate all the states of the complex network, the design process depends only on the dynamics of an individual node of the network. The methodology is demonstrated by considering a network of Chua oscillators

Performance Control for Interconnection of Identical Systems: Application to PLL network design

International audienceIn this paper, the problem of the control law design for interconnected identical systems ensuring the global stability and the global performance properties is under consideration. Inspired by the decentralized control law design methodology using the dissipativity input–output approach, the problem is reduced to the problem of satisfying two conditions: (i) the condition on the interconnection and (ii) the condition on the local subsystem dynamics. Both problems are efficiently solved applying a (quasi‐) convex LMI optimization and standard H∞ synthesis. The proposed design methodology is applied to the control law design of a synchronous PLL network

Two fault-tolerant control problems for multiple-integrators networks

The paper considers a network of agents with multiple-integrator internal dynamics, which share partial information on their states according to an arbitrary topology. For this system, two control problems are addressed and solved. The first consists in assigning the dominant closed-loop poles. The second consists in achieving a specified consensus with arbitrarily fast dynamics. In both cases, the regulator is required to be decentralized and the controlled network has to result tolerant with respect to faults in the communication apparatuses of the agents