Abstract
This paper studies the global leader-following consensus problem for a multi-agent system with intermittent directed communication in the presence of actuator saturation. Both the follower agents and the leader agent are described by a chain of integrators of an arbitrary length. A bounded consensus algorithm is constructed for each follower agent which utilizes the information obtained from the communication network intermittently. Global leader-following consensus is achieved by the consensus algorithms when the communication topology among all agents, when active, contains a spanning tree rooted at the leader agent. Simulation results illustrate the theoretical conclusions.
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.
