Skip to main navigation Skip to search Skip to main content

Robust design of sparse relative sensing networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper considers the robust design of sparse relative sensing networks subject to a given H-performance constraint. The topology design considers heterogenous agents over weighted graphs. We develop a robust counterpart to the uncertain optimization problem and formulate the sparsity constraint via a convex ℓ1-relaxation. We also demonstrate how this relaxation can be used to embed additional performance criteria, such as the maximization of the algebraic connectivity of the relative sensing network.

Original languageEnglish GB
Title of host publication2013 European Control Conference, ECC 2013
Pages1860-1865
Number of pages6
DOIs
StatePublished - 2013
Event2013 12th European Control Conference, ECC 2013 - Zurich, Switzerland
Duration: 17 Jul 201319 Jul 2013

Publication series

Name2013 European Control Conference, ECC 2013

Conference

Conference2013 12th European Control Conference, ECC 2013
Country/TerritorySwitzerland
CityZurich
Period17/07/1319/07/13

Keywords

  • relative sensing networks
  • topology design

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint

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

Cite this