Published 2009
| Version Published
Book Section - Chapter
Open
Scheduling for finite time consensus
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.
Additional Information
© 2009 AACC. The authors would like to acknowledge Xiaojie Gao, Richard Murray, Leonard Schulman, and Chris Umans for helpful discussions. We thank the anonymous reviewers whose comments improved the paper. We also thank one reviewer for pointing out an additional reference.Attached Files
Published - Ko2009p81032009_American_Control_Conference_Vols_1-9.pdf
Files
Ko2009p81032009_American_Control_Conference_Vols_1-9.pdf
Additional details
Identifiers
- Eprint ID
- 18179
- Resolver ID
- CaltechAUTHORS:20100507-092806430
Dates
- Created
-
2010-05-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field