Abstract
Abstract In order to describe the interconnection among agents with multi-dimensional states, we generalize the notion of a graph Laplacian by extending the adjacency weights (or weighted interconnection coefficients) from scalars to matrices. More precisely, we use positive definite matrices to denote full multi-dimensional interconnections, while using nonnegative definite matrices to denote partial multi-dimensional interconnections. We prove that the generalized graph Laplacian inherits the spectral properties of the graph Laplacian. As an application, we use the generalized graph Laplacian to establish a distributed consensus algorithm for agents described by multi-dimensional integrators.
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 callMore From: International Journal of Applied Mathematics and Computer Science
Disclaimer: 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.
