Fixed‐Time Consensus of Multi‐Agent Systems with Directed and Intermittent Communications

Abstract

This paper proposes a new class of nonlinear protocols for fixed‐time consensus in networked agents with directed and intermittent communications. First of all, based on the assumption of a common positive dwell time for all successful links, it is theoretically shown that the asymptotical consensus can be achieved if the interaction topology with some fixed length of time has a spanning tree. Then, if the length sum of time intervals, over which the directed interaction topology contains a spanning tree, is larger that a threshold value, which is independent of initial conditions, the system will solve a fixed‐time consensus problem. Furthermore, in light of the mirror operation principle of graph theory, the proposed protocol is extended to solve the fixed‐time consensus problem if a common positive dwell time for all active links is strongly connected without the detailed balanced condition. Finally, the effectiveness of the theoretical results is illustrated by simulation results.

A Packet Loss Tolerant Rendezvous Algorithm for Wireless Networked Robot Systems

“…Both works consider a simplistic link model where the links are modeled as bidirectional and instantaneous. The work in proposed a nonlinear protocol for fixed‐time consensus in networks with directed and intermittent communications. In our work we consider networks subject to more severe form of faults, as in presence of heavy disrupted environment.…”

Robust distributed consensus tracking control for high‐order uncertain nonlinear MASs with directed topologies

“…In the recent years, because of the limitation of communication among MASs, the distributed consensus problem which has less communication cost and higher robustness has attracted lots of attention [10][11][12][13]. A lot of existing works about the distributed consensus problem were based on leaderless MASs [14][15][16][17][18][19][20]. For leaderless MASs, the final consensus state is usually dependent on the initial states such as the average of initial states.…”

Event‐triggered Guaranteed Cost Consensus of Networked Singular Multi‐agent Systems

“…In the last decades, the study of multi‐agent systems has attracted considerable attention due to their widespread applications, such as in formation control of aircraft , synchronization of complex networks , synchronization of multiple spacecrafts , consensus control of distributed sensor networks and other fields. Consensus, which is one of the most important dynamic behaviours of multi‐agent systems, means that all the agents in the multi‐agent systems reach an agreement on a common value by relying on some control rules and communication with their neighbors .…”