Event-Triggered Algorithms for Leader-Follower Consensus of Networked Euler-Lagrange Agents

This paper proposes three different distributed event-triggered control algorithms to achieve leader-follower consensus for a network of Euler-Lagrange agents. We firstly propose two model-independent algorithms for a subclass of Euler-Lagrange agents without the vector of gravitational potential forces. By model-independent, we mean that each agent can execute its algorithm with no knowledge of the agent self-dynamics. A variable-gain algorithm is employed when the sensing graph is undirected; algorithm parameters are selected in a fully distributed manner with much greater flexibility compared to all previous work concerning event-triggered consensus problems. When the sensing graph is directed, a constant-gain algorithm is employed. The control gains must be centrally designed to exceed several lower bounding inequalities which require limited knowledge of bounds on the matrices describing the agent dynamics, bounds on network topology information and bounds on the initial conditions. When the Euler-Lagrange agents have dynamics which include the vector of gravitational potential forces, an adaptive algorithm is proposed which requires more information about the agent dynamics but can estimate uncertain agent parameters. For each algorithm, a trigger function is proposed to govern the event update times. At each event, the controller is updated, which ensures that the control input is piecewise constant and saves energy resources. We analyse each controllers and trigger function and exclude Zeno behaviour. Extensive simulations show 1) the advantages of our proposed trigger function as compared to those in existing literature, and 2) the effectiveness of our proposed controllers.Comment: Extended manuscript of journal submission, containing omitted proofs and simulation

Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication

This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost function is strictly convex, we establish asymptotic convergence under connected graph topologies. We also characterize the algorithm's correctness under time-varying interaction topologies and study its privacy preservation properties. Motivated by practical considerations, we analyze the algorithm implementation with discrete-time communication. We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication. Building on this result, we design a provably-correct centralized event-triggered communication scheme that is free of Zeno behavior. Finally, we develop a distributed, asynchronous event-triggered communication scheme that is also free of Zeno with asymptotic convergence guarantees. Several simulations illustrate our results.Comment: 12 page

Event-Triggered Consensus and Formation Control in Multi-Agent Coordination

The focus of this thesis is to study distributed event-triggered control for multi-agent systems (MASs) facing constraints in practical applications. We consider several problems in the field, ranging from event-triggered consensus with information quantization, event-triggered edge agreement under synchronized/unsynchronized clocks, event-triggered leader-follower consensus with Euler-Lagrange agent dynamics and cooperative event-triggered rigid formation control. The first topic is named as event-triggered consensus with quantized relative state measurements. In this topic, we develop two event-triggered controllers with quantized relative state measurements to achieve consensus for an undirected network where each agent is modelled by single integrator dynamics. Both uniform and logarithmic quantizers are considered, which, together with two different controllers, yield four cases of study in this topic. The quantized information is used to update the control input as well as to determine the next trigger event. We show that approximate consensus can be achieved by the proposed algorithms and Zeno behaviour can be completely excluded if constant offsets with some computable lower bounds are added to the trigger conditions. The second topic considers event-triggered edge agreement problems. Two cases, namely the synchronized clock case and the unsynchronized clock case, are studied. In the synchronized clock case, all agents are activated simultaneously to measure the relative state information over edge links under a global clock. Edge events are defined and their occurrences trigger the update of control inputs for the two agents sharing the link. We show that average consensus can be achieved with our proposed algorithm. In the unsynchronized clock case, each agent executes control algorithms under its own clock which is not synchronized with other agents' clocks. An edge event only triggers control input update for an individual agent. It is shown that all agents will reach consensus in a totally asynchronous manner. In the third topic, we propose three different distributed event-triggered control algorithms to achieve leader-follower consensus for a network of Euler-Lagrange agents. We firstly propose two model-independent algorithms for a subclass of Euler-Lagrange agents without the vector of gravitational potential forces. A variable-gain algorithm is employed when the sensing graph is undirected; algorithm parameters are selected in a fully distributed manner with much greater flexibility compared to all previous work concerning event-triggered consensus problems. When the sensing graph is directed, a constant-gain algorithm is employed. The control gains must be centrally designed to exceed several lower bounding inequalities which require limited knowledge of bounds on the matrices describing the agent dynamics, bounds on network topology information and bounds on the initial conditions. When the Euler-Lagrange agents have dynamics which include the vector of gravitational potential forces, an adaptive algorithm is proposed. This requires more information about the agent dynamics but allows for the estimation of uncertain agent parameters. The last topic discusses cooperative stabilization control of rigid formations via an event-triggered approach. We first design a centralized event-triggered formation control system, in which a central event controller determines the next triggering time and broadcasts the event signal to all the agents for control input update. We then build on this approach to propose a distributed event control strategy, in which each agent can use its local event trigger and local information to update the control input at its own event time. For both cases, the trigger condition, event function and trigger behaviour are discussed in detail, and the exponential convergence of the formation system is guaranteed