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.
Keywords
- graph Laplacian
- generalized graph Laplacian
- adjacency weights
- distributed consensus algorithm
- cooperative control
A Multi–Source Fluid Queue Based Stochastic Model of the Probabilistic Offloading Strategy in a MEC System With Multiple Mobile Devices and a Single MEC Server Hybrid Cryptography with a One–Time Stamp to Secure Contact Tracing for COVID–19 Infection Global Stability of Discrete–Time Feedback Nonlinear Systems with Descriptor Positive Linear Parts and Interval State Matrices Template Chart Detection for Stoma Telediagnosis Fast and Smooth Trajectory Planning for a Class of Linear Systems Based on Parameter and Constraint Reduction Sensor Location for Travel Time Estimation Based on the User Equilibrium Principle: Application of Linear Equations Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks A Feasible Schedule for Parallel Assembly Tasks in Flexible Manufacturing Systems Non–Standard Analysis Revisited: An Easy Axiomatic Presentation Oriented Towards Numerical Applications A Data Association Model for Analysis of Crowd Structure A Comprehensive Study of Clustering a Class of 2D Shapes Performance Analysis of a Dual Stage Deep Rain Streak Removal Convolution Neural Network Module with a Modified Deep Residual Dense Network