Distributed model-independent consensus of Euler-Lagrange agents on directed networks

This paper proposes a distributed model-independent algorithm to achieve leaderless consensus on a directed network where each fully-actuated agent has self-dynamics described by Euler–Lagrange equations of motion. Specifically, we aim to achieve consensus of the generalised coordinates with zero generalised velocity. We show that on a strongly connected graph, a model-independent algorithm can achieve the consensus objective at an exponential rate if an upper bound on the initial conditions is known a priori. By model-independent, we mean that each agent can execute the algorithm with no knowledge of the equations describing the self-dynamics of any agent. For design of the control laws which achieve consensus, a control gain scalar and a control gain matrix are required to satisfy several inequalities involving bounds on the matrices of the agent dynamic model, bounds on the Laplacian matrix describing the network topology and the set of initial conditions; design of the algorithm therefore requires some knowledge on the bounds of the agent dynamical parameters. Because only bounds are required, the proposed algorithm offers robustness to uncertainty in the parameters of the multiagent system. We systematically show that additional relative velocity information improves the performance of the controller. Numerical simulations are provided to show the effectiveness of the algorithm.This work was supported by the National Natural Science Foundation of China (grant 61375072), and by Data61-CSIRO (formerly NICTA)

Robust Control

The need to be tolerant to changes in the control systems or in the operational environment of systems subject to unknown disturbances has generated new control methods that are able to deal with the non-parametrized disturbances of systems, without adapting itself to the system uncertainty but rather providing stability in the presence of errors bound in a model. With this approach in mind and with the intention to exemplify robust control applications, this book includes selected chapters that describe models of H-infinity loop, robust stability and uncertainty, among others. Each robust control method and model discussed in this book is illustrated by a relevant example that serves as an overview of the theoretical and practical method in robust control

Control law and state estimators design for multi-agent system with reduction of communications by event-triggered approach

A large amount of research work has been recently dedicated to the study of Multi-Agent System and cooperative control. Applications to mobile robots, like unmanned air vehicles (UAVs), satellites, or aircraft have been tackled to insure complex mission such as exploration or surveillance. However, cooperative tasking requires communication between agents, and for a large number of agents, the number of communication exchanges may lead to network saturation, increased delays or loss of transferred packets, from the interest in reducing them. In event-triggered strategy, a communication is broadcast when a condition, based on chosen parameters and some threshold, is fulfilled. The main difficulty consists in determining the communication triggering condition (CTC) that will ensure the completion of the task assigned to the MAS. In a distributed strategy, each agent maintains an estimate value of others agents state to replace missing information due to limited communication. This thesis focuses on the development of distributed control laws and estimators for multi-agent system to limit the number of communication by using event-triggered strategy in the presence of perturbation with two main topics, i.e. consensus and formation control. The first part addresses the problem of distributed event-triggered communications for consensus of a multi-agent system with both general linear dynamics and state perturbations. To decrease the amount of required communications, an accurate estimator of the agent states is introduced, coupled with an estimator of the estimation error, and adaptation of communication protocol. By taking into account the control input of the agents, the proposed estimator allows to obtain a consensus with fewer communications than those obtained by a reference method. The second part proposes a strategy to reduce the number of communications for displacement-based formation control while following a desired reference trajectory. Agent dynamics are described by Euler-Lagrange models with perturbations and uncertainties on the model parameters. Several estimator structures are proposed to rebuilt missing information. The proposed distributed communication triggering condition accounts for inter-agent displacements and the relative discrepancy between actual and estimated agent states. A single a priori trajectory has to be evaluated to follow the desired path. Effect of state perturbations on the formation and on the communications are analyzed. Finally, the proposed methods have been adapted to consider packet dropouts and communication delays. For both type

Optimization based energy-efficient control inmobile communication networks

In this work we consider how best to control mobility and transmission for the purpose of datatransfer and aggregation in a network of mobile autonomous agents. In particular we considernetworks containing unmanned aerial vehicles (UAVs). We first consider a single link betweena mobile transmitter-receiver pair, and show that the total amount of transmittable data isbounded. For certain special, but not overly restrictive cases, we can determine closed-formexpressions for this bound, as a function of relevant mobility and communication parameters.We then use nonlinear model predictive control (NMPC) to jointly optimize mobility and trans-mission schemes of all networked nodes for the purpose of minimizing the energy expenditureof the network. This yields a novel nonlinear optimal control problem for arbitrary networksof autonomous agents, which we solve with state-of-the-art nonlinear solvers. Numerical re-sults demonstrate increased network capacity and significant communication energy savingscompared to more na ̈ıve policies. All energy expenditure of an autonomous agent is due tocommunication, computation, or mobility and the actual computation of the NMPC solutionmay be a significant cost in both time and computational resources. Furthermore, frequentbroadcasting of control policies throughout the network can require significant transmit andreceive energies. Motivated by this, we develop an event-triggering scheme which accounts forthe accuracy of the optimal control solution, and provides guarantees of the minimum timebetween successive control updates. Solution accuracy should be accounted for in any triggeredNMPC scheme where the system may be run in open loop for extended times based on pos-sibly inaccurate state predictions. We use this analysis to trade-off the cost of updating ourtransmission and locomotion policies, with the frequency by which they must be updated. Thisgives a method to trade-off the computation, communication and mobility related energies ofthe mobile autonomous network.Open Acces