| Presentation | 2016-09-15 A New Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks Kento Endo, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The algebraic connectivity, which is defined as the second smallest eigenvalue of the Laplacian matrix, is an index represending how well the network is connected. Yang {it et al.} proposed a continuous-time algorithm for agents in a network to estimate the algebraic connectivity of the network, and proved the validity by theoretical analysis. However, their method is based on a strong assumption that each agent can compute the average of the state values of all agents instaneously. Very recently, Yamane and Takahashi proposed a truly decentralized algorithm based on the work of Yang {it et al.} and the dynaminc average consensus algorithm proposed by Spanos {it et al.} and confirmed the validity through numerical experiments. This method is truly decentralized because each agent updates the state value by using the information obtained from only agents in the neighborhood. In this report, we propose a new discrete-time algorithm for estimating the algebraic connectivity based on the method of Yamane and Takahashi and a dynamic average consensus algorithm of Zhu and Mart'inez. We also examine the validity of the proposed method by theoretical analysis and numerical experiments. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | multiagent network / algeblaic connectivity / discrete-time algorithm / dynamic average consensus |
| Paper # | NLP2016-55 |
| Date of Issue | 2016-09-07 (NLP) |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2016/9/14(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Konan Univ. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Hisato Fujisaka(Hiroshima City Univ.) |
| Vice Chair | Masaharu Adachi(Tokyo Denki Univ.) |
| Secretary | Masaharu Adachi(Konan Univ.) |
| Assistant | Hiroyuki Asahara(Okayama Univ. of Science) / Toshihiro Tachibana(Shonan Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A New Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks |
| Sub Title (in English) | |
| Keyword(1) | multiagent network |
| Keyword(2) | algeblaic connectivity |
| Keyword(3) | discrete-time algorithm |
| Keyword(4) | dynamic average consensus |
| 1st Author's Name | Kento Endo |
| 1st Author's Affiliation | Okayama University(Okayama Univ.) |
| 2nd Author's Name | Norikazu Takahashi |
| 2nd Author's Affiliation | Okayama University(Okayama Univ.) |
| Date | 2016-09-15 |
| Paper # | NLP2016-55 |
| Volume (vol) | vol.116 |
| Number (no) | NLP-215 |
| Page | pp.pp.57-62(NLP), |
| #Pages | 6 |
| Date of Issue | 2016-09-07 (NLP) |