DocumentCode
2472479
Title
Notes on averaging over acyclic digraphs and discrete coverage control
Author
Gao, Chunkai ; Bullo, Francesco ; Cortés, Jorge ; Jadbabaie, Ali
Author_Institution
Dept. of Mech. Eng., California Univ., Santa Barbara, CA
fYear
2006
fDate
13-15 Dec. 2006
Firstpage
4651
Lastpage
4656
Abstract
In this paper, we show the relationship between two algorithms and optimization problems that are the subject of recent attention in the networking and control literature. First, we obtain some results on averaging algorithms over acyclic digraphs with fixed and controlled-switching topology. Second, we discuss continuous and discrete coverage control laws. Further, we show how discrete coverage control laws can be cast as averaging algorithms over discrete Voronoi graphs
Keywords
computational geometry; directed graphs; discrete systems; optimisation; acyclic digraphs; averaging algorithms; continuous coverage control laws; control literature; controlled-switching topology; discrete Voronoi graphs; discrete coverage control laws; Algorithm design and analysis; Convergence; Distributed control; Drives; Laplace equations; Network topology; Optimal control; Robot kinematics; Robot sensing systems; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2006 45th IEEE Conference on
Conference_Location
San Diego, CA
Print_ISBN
1-4244-0171-2
Type
conf
DOI
10.1109/CDC.2006.377456
Filename
4177468
Link To Document