An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity

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

Abstract

In some applications of multiagent networks, it is desired that each agent can evaluate how well the network is connected. In this paper, we propose a novel discrete-time algorithm for each agent to compute the algebraic connectivity of the network in a pseudo-decentralized manner. The proposed algorithm requires less computational cost than the conventional algorithm. We also analyze the dynamical behavior of the proposed algorithm and prove under some assumptions on the parameter values and the initial state values of the agents that all agents can compute the algebraic connectivity.

Original languageEnglish
Title of host publication2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1292-1298
Number of pages7
ISBN (Electronic)9781728124858
DOIs
Publication statusPublished - Dec 2019
Event2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019 - Xiamen, China
Duration: Dec 6 2019Dec 9 2019

Publication series

Name2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019

Conference

Conference2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
CountryChina
CityXiamen
Period12/6/1912/9/19

Keywords

  • algebraic connectivity
  • convergence
  • multiagent networks
  • pseudo-decentralized algorithm

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Modelling and Simulation

Fingerprint Dive into the research topics of 'An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity'. Together they form a unique fingerprint.

Cite this