Abstract
The leader-following consensus problems for linear time-varying multi-agent systems under fixed and switching topologies are considered. Several results are derived on the basis of Lyapunov’s direct method. For a network of linear time-varying agents with fixed topology, we provide two protocols, respectively. One of them uses global information of the communication topology. It guarantees the multi-agent system to go to the leader-following agreement with an arbitrarily given exponential rate. The other uses local information associated with each follower, and is implemented in a fully distributed fashion. It has robustness with respect to a certain degree of link failure. It is extended to a network of linear time-varying agents with switching topology. The resulting protocol guarantees the multi-agent system to achieve the leader-following consensus, if the union of switching graphs has a spanning tree rooted at the leader. It also has robustness with respect to a certain degree of link failure. Simulation examples are provided to validate the effectiveness of the 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 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.
