Abstract
This study investigates the consensus problem for cooperative heterogeneous agents with non-linear dynamics in a directed communication network. Global bounded consensus is studied by employing a quadratic Lyapunov function, and a distributed consensus protocol is designed by solving a few lower-dimension linear matrix inequalities associated with the dynamics of the heterogeneous agents. A sufficient condition corresponding to the semi-positive definiteness of the Laplacian matrix and the non-linear dynamics of each agent is obtained to guarantee the boundedness of consensus. In particular, to avoid the calculation of matrix eigenvalues, a sufficient condition is also obtained in the form of several scalar inequalities involving the coupling strengths and the property of all paths between agent pairs under a proper path strategy. The presented framework for designing protocols is quite simple with limited conservatism, which can be effectively used to design consensus protocols of various weighted and directed networks.
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.
