Jorge Cortés
Professor
Cymer Corporation Endowed Chair
Notes on averaging over acyclic digraphs and discrete coverage control
C. Gao, F. Bullo, J. Cortés, A. Jadbabaie
Proceedings of the 45th IEEE Int. Conf. Decision and Control, San
Diego, California, USA, 2006, pp. 4651-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 defined over an
appropriate graph that we term the discrete Voronoi graph.
pdf
  |  
ps.gz
Mechanical and Aerospace Engineering,
University of California, San Diego
9500 Gilman Dr,
La Jolla, California, 92093-0411
Ph: 1-858-822-7930
Fax: 1-858-822-3107
cortes at ucsd.edu
Skype id:
jorgilliyo