Abstract
This paper is concerned with the consensus problem of linear multi-agent systems with constant and time-varying communication delays over fixed topology. A proportional and derivative like (PD-like) consensus algorithm is proposed to address the problem, which is available to transform the system into a neutral-like system. By uniformly dividing the delay interval into multiple segments, a Lyapunov-Krasovskii functional constructed to analysis the stability of the system. Then, some new consensus conditions are presented in terms of linear matrix inequality (LMI) to tolerate a large upper bound of the time-delay. Finally, some simulations are provided to demonstrate the effectiveness of the proposed 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.
