Abstract
This paper concerns the consensus problem for linear multi-agent systems with time-varying delays. A consensus protocol is built upon the relative output information between neighboring agents in the presence of time-varying delays. Some delay-dependent conditions are derived based on linear matrix inequalities to achieve consensus. In the case that the feedback gain matrix K is known, the Lyapunov functional theory together with the convex combination technique are used. In the case that K is unknown, the variable substitute approach is introduced to convert nonlinear matrix inequalities into linear matrix inequalities, which are easily verified via GEVP solver in Matlab Toolbox to guarantee consensus for linear multi-agent systems. Finally, two numerical examples and simulation results are presented which 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.
