Abstract
This paper presents a new class of protocols to solve finite-time consensus for multi-agent systems. The protocols are induced from the classical finite-time consensus algorithm by using the so-called protocol function. Sufficient conditions are established for networked agents to experience finite-time consensus under time-varying undirected and fixed directed topologies. Numerical simulations show that the proposed protocols can provide more flexibility to improve convergence rate.
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.
