Notes on Averaging Over Acyclic Digraphs and Discrete Coverage Control

摘要

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 defined over an appropriate graph that we term the discrete Voronoi graph.