Notes on averaging over acyclic digraphs and discrete coverage control
Chunkai Gao, Francesco Bullo, Jorge Cortés, Ali Jadbabaie · 2006
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