Consensus

Abstract: This paper investigates the consensus seeking problem of mobile sensor networks (MSNs) with random switching topologies. The network communication topologies are composed of a set of directed graphs (or digraph) with a spanning tree. The switching of topologies is governed by a Markov chain. The consensus seeking problem is addressed by introducing a global topology-aware linear quadratic (LQ) cost as the performance measure. By state transformation, the consensus problem is transformed to the stabilization of a Markovian jump system with guaranteed cost. A sufficient condition for global mean-square consensus is derived in the context of stochastic stability analysis of Markovian jump systems. A computational algorithm is given to synchronously calculate both the sub-optimal consensus controller gains and the sub-minimum upper bound of the cost. The effectiveness of the proposed design method is illustrated by three numerical examples.

Abstract: This paper presents an MPC (Model Predictive Control) based consensus algorithm which solves a consensus problem in which constraints are imposed on the increment of the state of each agent. After making an artificial consensus trajectory using a previously designed consensus algorithm, the MPC is used to make the agent track the consensus trajectory. Simulation results demonstrate the effectiveness of the proposed algorithm.

Abstract: This article studies the leader-following consensus of multiagent systems (MASs) with completely event-triggered mechanisms (CETMs) and directed switching topologies. When most event-triggered schemes in MASs only reduce each agent's data transmissions to neighbor agents, CETMs further reduce data transmissions to actuators with one triggered function in each agent. To guarantee the switching links utilized by CETMs contain a directed spanning tree at any time, triggered decisions are improved to include the instants at which each agent's output links or leader link change. Furthermore, a less conservative method based on matrix inequalities is combined to minimize the allowable average dwell time (ADT) of switching topologies under the design conditions of CETMs. Based on multiple Lyapunov functions (MLFs), the sufficient conditions for controller gains that guarantee the leader-following consensus of MASs are proposed when the ADT of switching topologies is larger than the allowable value. Finally, an example of autonomous underwater vehicles (AUVs) is given to illustrate the effectiveness of CETMs.