| Presentation | 2020-11-25 Generalization of Pseudo-Decentralized Continuous-Time Algorithms for Estimation of Algebraic Connectivity Katsuki Shimada, Tsuyoshi Migita, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Development of decentralized algorithms for multiple agents in a network to estimate its connectivity is a fundamental and important issue in consideration of some applications of the multiagent network such as mulitrobot systems. Yang {it et al}.~proposed a pseudo-decentralized continuous-time algorithm for estimating the algebraic connectivity of the network, and proved its validity through theoretical analysis. The algebraic connectivity, that is defined as the second smallest eigenvalue of the Laplacian matrix of the network, represents how well the network is connected. Later, Fukami and Takahashi proposed to replace $L_2$ norm in Yang {it et al}.'s algorithm with $L_1$ norm or $L_infty$ norm, and proved the validity of their algorithms. In this paper, we propose a class of algorithms based on $L_p$ norm that can be considered as a generalization of the conventional algorithms. We analyze the dynamical behavior of the proposed algorithms and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can estimate the algebraic connectivity. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | multiagent networks / algebraic connectivity / continuous-time algorithm / Lp norm |
| Paper # | CAS2020-23,MSS2020-15 |
| Date of Issue | 2020-11-18 (CAS, MSS) |
| Conference Information | |
| Committee | MSS / CAS / IPSJ-AL |
|---|---|
| Conference Date | 2020/11/25(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Shigemasa Takai(Osaka Univ.) / Yasuhiro Takashima(Univ. of Kitakyushu) |
| Vice Chair | Atsuo Ozaki(Osaka Inst. of Tech.) / Hiroki Sato(Sony LSI Design) |
| Secretary | Atsuo Ozaki(Setsunan Univ.) / Hiroki Sato(Hokkaido Univ.) / (Yamanashi Univ.) |
| Assistant | Naoki Hayashi(Osaka Univ.) / Motoi Yamaguchi(TECHNOPRO) / Yohei Nakamura(Hitachi) |
| Paper Information | |
| Registration To | Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Circuits and Systems / Special Interest Group on Algorithms |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Generalization of Pseudo-Decentralized Continuous-Time Algorithms for Estimation of Algebraic Connectivity |
| Sub Title (in English) | |
| Keyword(1) | multiagent networks |
| Keyword(2) | algebraic connectivity |
| Keyword(3) | continuous-time algorithm |
| Keyword(4) | Lp norm |
| 1st Author's Name | Katsuki Shimada |
| 1st Author's Affiliation | Okayama University(Okayama Univ.) |
| 2nd Author's Name | Tsuyoshi Migita |
| 2nd Author's Affiliation | Okayama University(Okayama Univ.) |
| 3rd Author's Name | Norikazu Takahashi |
| 3rd Author's Affiliation | Okayama University(Okayama Univ.) |
| Date | 2020-11-25 |
| Paper # | CAS2020-23,MSS2020-15 |
| Volume (vol) | vol.120 |
| Number (no) | CAS-245,MSS-246 |
| Page | pp.pp.22-27(CAS), pp.22-27(MSS), |
| #Pages | 6 |
| Date of Issue | 2020-11-18 (CAS, MSS) |