A notion of generalized graph Laplacian and its application to distributed consensus algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In order to describe the interconnection among agents with multi-dimensional states, we generalize the notion of graph Laplacian by extending the adjacency weights from positive scalars to positive definite matrices. We prove that the generalized graph Laplacian inherits the spectral properties of the graph Laplacian. As an application example, we use the generalized graph Laplacian to establish a distributed consensus algorithm for agents described by multi-dimensional integrators.

Original languageEnglish
Title of host publication2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program
Pages529-533
Number of pages5
Publication statusPublished - 2011 Oct 12
Event2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Zhengzhou, China
Duration: 2011 Aug 112011 Aug 13

Publication series

Name2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program

Conference

Conference2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011
CountryChina
CityZhengzhou
Period11/8/1111/8/13

    Fingerprint

Keywords

  • adjacency weights
  • cooperative control
  • distributed consensus algorithm
  • generalized graph Laplacian
  • graph Laplacian

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Mechanical Engineering

Cite this

Zhai, G. (2011). A notion of generalized graph Laplacian and its application to distributed consensus algorithm. In 2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program (pp. 529-533). [6024950] (2011 International Conference on Advanced Mechatronic Systems, ICAMechS 2011 - Final Program).