Abstract
In this brief, a consensus problem is investigated for a class of multi-agent systems with input saturation, in which the common assumption in existing related literature that each agent has the same input saturation level is removed. Furthermore, the communication graphs are general directed graphs. New kinds of fully distributed control protocols, depending on only the relative state information, are successfully designed to achieve global state consensus among the agents. Specifically, neither the saturation levels of the neighboring agents nor the information about the global communication topology is involved in the controller design. Both leaderless consensus and leader-following consensus with a dynamic leader are studied. Simulation examples are finally provided to illustrate the theoretical results.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: 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.
