Presentation 2014-11-20
Analysis of average consensus dynamics for faster convergence
Kenji NOMURA, Naoki HAYASHI, Shigemasa TAKAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we consider convergence speed of consensus problems in multi-agent systems. The convergence speed of consensus problems is closely related to the second smallest eigenvalue of a graph Laplacian. We propose a novel continuous-time average consensus dynamics in which each agent considers not only the difference of states among its neighbors but also the one observed by its neighbor agents. We show that the proposed dynamics can achieve the faster convergence than the conventional dynamics.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Multi-agent systems / Consensus problem / Graph Laplacian / Second smallest eigenvalue
Paper # CAS2014-97,MSS2014-61
Date of Issue

Conference Information
Committee MSS
Conference Date 2014/11/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Mathematical Systems Science and its applications(MSS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analysis of average consensus dynamics for faster convergence
Sub Title (in English)
Keyword(1) Multi-agent systems
Keyword(2) Consensus problem
Keyword(3) Graph Laplacian
Keyword(4) Second smallest eigenvalue
1st Author's Name Kenji NOMURA
1st Author's Affiliation Graduate School of Engineering, Osaka University()
2nd Author's Name Naoki HAYASHI
2nd Author's Affiliation Graduate School of Engineering, Osaka University
3rd Author's Name Shigemasa TAKAI
3rd Author's Affiliation Graduate School of Engineering, Osaka University
Date 2014-11-20
Paper # CAS2014-97,MSS2014-61
Volume (vol) vol.114
Number (no) 313
Page pp.pp.-
#Pages 4
Date of Issue