Stabilizability over deterministic relay networks


Conference Paper

We consider the problem of linear system stabilization using a set of decentralized controllers that communicate with the plant's sensors over a network that employs linear network coding. Our analysis is built upon an existing algebraic description of deterministic relay networks, which is able to model broadcast transmissions and multiple access channel constraints. Since these networks can be described as linear time-invariant systems with specific transfer functions, this network representation allows us to reason about the control system and network (and their interaction) using a common mathematical framework. In this paper we characterize algebraic and topological stabilizability conditions for a wide class of these networks. Our analysis shows that the (algebraic) structure of a network required for stabilization of a dynamical plant can be related to the plant's dynamics; in particular, we prove that the geometric multiplicities of the plant's unstable eigenvalues play a key role in the ability to stabilize the system over such networks. ©2013 IEEE.

Full Text

Duke Authors

Cited Authors

  • Pajic, M; Sundaram, S; Pappas, GJ

Published Date

  • January 1, 2013

Published In

Start / End Page

  • 4018 - 4023

International Standard Serial Number (ISSN)

  • 0191-2216

Digital Object Identifier (DOI)

  • 10.1109/CDC.2013.6760504

Citation Source

  • Scopus