Skip to main navigation Skip to search Skip to main content

Design of sparse relative sensing networks

Research output: Contribution to journal › Conference article › peer-review

Abstract

This paper considers the problem of designing sparse relative sensing networks (RSN) subject to a given H∞-performance constraint. The topology design considers homogeneous and heterogeneous agents over weighted graphs. We develop a computationally efficient formulation of the sparse topology design via a convex ℓ1-relaxation. This makes the proposed algorithm attractive for practical applications. We also demonstrate how this relaxation can be used to embed additional performance criteria, such as maximization of the algebraic connectivity of the RSN.

Original languageEnglish
Article number6426358
Pages (from-to)2749-2754
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 2012
Externally publishedYes
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: 10 Dec 2012 → 13 Dec 2012

Keywords

  • H-performance
  • relative sensing networks
  • topology design
  • ℓ-minimization

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Design of sparse relative sensing networks'. Together they form a unique fingerprint.

Cite this