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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
