Distributed model‐independent consensus of Euler–Lagrange agents on directed networks

Abstract

SummaryThis 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. Copyright © 2016 John Wiley & Sons, Ltd.