Scheduling for finite time consensus

Authors:
Chih-Kai Ko;Ling Shi
Affiliations:
Department of Electrical Engineering, California Institute of Technology, Pasadena, California;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
Elements of information theory

Elements of information theory
Distributed consensus and linear functional calculation in networks: an observability perspective

Proceedings of the 6th international conference on Information processing in sensor networks
Finite-time convergent gradient flows with applications to network consensus

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of link scheduling for discrete-time agents to achieve average consensus in finite time under communication constraints. We provide necessary and sufficient conditions under which finite time consensus is possible. Furthermore, we prove bounds on the consensus time and exhibit provably optimal communication policies. We also discuss the dual problem of designing communication schedules given a fixed consensus-time requirement.