On bipartite consensus of linear MASs with input saturation over directed signed graphs: Fully distributed adaptive approach

Abstract This paper studies the bipartite consensus problem with input saturation for general linear represents multi‐agent systems (MASs) with signed digraphs. Based on relative state information among neighbour agents, distributed adaptive protocols and a compensation observer are proposed, wherein both leaderless bipartite consensus and tracking bipartite consensus problems are addressed. For the case only relative output information is available, observer‐based distributed adaptive protocols are also designed, where for each agent, a local observer is given to estimate signed consensus error and a distributed observer is presented to achieve bipartite consensus and generate control input and a compensation observer is designed to handle input saturation. Simulation illustrations are given to explain the feasibility. The control protocols presented in this article depend on only local relative state or output information, without any eigenvalue information of Laplacian matrices associated with signed digraphs, which can be practically used for each agent in a fully distributed way.

Abstract licence: CC BY-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.