DocumentCode
2462628
Title
Scheduling for finite time consensus
Author
Ko, Chih-Kai ; Shi, Ling
Author_Institution
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fYear
2009
fDate
10-12 June 2009
Firstpage
1982
Lastpage
1986
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.
Keywords
discrete time systems; multi-agent systems; scheduling; communication scheduling; discrete-time agents; finite time consensus; fixed consensus-time requirement; optimal communication policy; Algorithm design and analysis; Convergence; Multiagent systems; Processor scheduling; Protocols; Robustness; Sufficient conditions; Time factors; Topology; Unmanned aerial vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2009. ACC '09.
Conference_Location
St. Louis, MO
ISSN
0743-1619
Print_ISBN
978-1-4244-4523-3
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2009.5160026
Filename
5160026
Link To Document