Notes on Averaging Over Acyclic Digraphs and Discrete Coverage Control

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2006
Accession Number
ADA459077

Entities

People

  • Chunkai Gao
  • Francesco Bullo
  • Jorge Cortés

Organizations

  • University of California, Santa Barbara

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • California
  • Closed Loop Systems
  • Computations
  • Control Systems
  • Convergence
  • Difference Equations
  • Differential Equations
  • Engineering
  • Equations
  • Intervals
  • Lyapunov Functions
  • Sequences
  • Simulations
  • Topology
  • Vector Spaces

Readers

  • Approximation Theory.
  • Graph Algorithms and Convex Optimization.
  • Operations Research