Dissipative Consensus Tracking of Fuzzy Multi-Agent Systems Via Adaptive Protocol

Abstract

This paper considers the design problems of adaptive consensus protocol for nonlinear multiagent systems under directed topology and external disturbance. Considering external disturbance, we propose a new polynomial fuzzy modeling approach. Based on the monotonically increasing functions, novel centralized adaptive protocol and distributed consensus protocol are designed respectively to guarantee that all agents can reach agreement. The distributed protocol is independent of global information of network topology and thereby is fully distributed. By constructing Lyapunov functions, SOS-based relaxed sufficient criteria are presented to achieve consensus. In addition, the time-varying coupling weights approach finite steady-state values. A simulation example is provided to demonstrate the effectiveness of the proposed adaptive consensus techniques.

Event-Based Consensus Tracking for Nonlinear Multi-Agent Systems Under Semi-Markov Jump Topology

“…Now, we consider the event-triggering dissipative consensus conditions for system (7) under semi-Markov changing topologies. Then, the derived results can be extended to a fixed topological case.…”

“…Here, we first design a distributed event-triggering consensus protocol for system (7) under semi-Markov changing topologies.…”

“…The main purpose of consensus problems is to design a distributed controller (consensus protocol), which can guarantee that all agents can reach a common state by exchanging local information among neighboring agents via communication link. Various control schemes have been utilized, such as finite time control in [4], fault-tolerant control in [5], [6], adaptive control in [7]- [9] and optimal control in [11], [12].…”

Fully distributed consensus for fuzzy multiagent systems with jointly connected topology

“…Compared with the previous related work of the authors [33–35], the distributed adaptive consensus protocol for a class of nonlinear MASs is explored. The adaptive consensus protocol proposed here is fully distributed, which does not need to know the eigenvalues of the Laplacian matrix about the network topologies. The communication topology in previous studies [1, 10, 20, 21, 23, 24] requires either a directed spanning tree or an undirected fixed connected graph. Unlike previous works [1, 10, 20, 21, 23, 24], the interaction topology considered here utilizes jointly connected switching topologies, in which unions of sub‐topologies are connected in the interval and sub‐topologies may be disconnected in each sub‐interval.…”

“…The adaptive consensus protocol proposed here is fully distributed, which does not need to know the eigenvalues of the Laplacian matrix about the network topologies. The communication topology in previous studies [1, 10, 20, 21, 23, 24] requires either a directed spanning tree or an undirected fixed connected graph. Unlike previous works [1, 10, 20, 21, 23, 24], the interaction topology considered here utilizes jointly connected switching topologies, in which unions of sub‐topologies are connected in the interval and sub‐topologies may be disconnected in each sub‐interval. The jointly connected topologies are a far milder condition on switching topologies for MASs and guarantee that the agents do not need to exchange their information real‐time. New sufficient criteria are presented to assure distributed adaptive consensus.…”