CaltechAUTHORS
  A Caltech Library Service

Anytime reliable codes for stabilizing plants over erasure channels

Sukhavasi, Ravi Teja and Hassibi, Babak (2011) Anytime reliable codes for stabilizing plants over erasure channels. In: 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC). IEEE , Piscataway, NJ, pp. 5254-5259. ISBN 978-1-61284-800-6. https://resolver.caltech.edu/CaltechAUTHORS:20150204-071707257

[img] PDF - Submitted Version
See Usage Policy.

434Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150204-071707257

Abstract

The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked control systems. Although the work of Schulman and Sahai over the past two decades, and their development of the notions of “tree codes” and “anytime capacity”, provides the theoretical framework for studying such problems, there has been scant practical progress in this area because explicit constructions of tree codes with efficient encoding and decoding did not exist. To stabilize an unstable plant driven by bounded noise over a noisy channel one needs real-time encoding and real-time decoding and a reliability which increases exponentially with delay, which is what tree codes guarantee. We prove the existence of linear tree codes with high probability and, for erasure channels, give a construction with an expected decoding complexity that is constant per time instant. We give sufficient conditions on the rate and reliability required of the tree codes to stabilize vector plants and argue that they are asymptotically tight. This work takes an important step towards controlling plants over noisy channels, and we demonstrate the efficacy of the method through a simulation.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/CDC.2011.6161478DOIArticle
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6161478PublisherArticle
http://arxiv.org/abs/1103.4438arXivDiscussion Paper
Additional Information:© 2011 IEEE. This work was supported in part by the National Science Foundation under grants CCF-0729203, CNS-0932428 and CCF-1018927, by the Office of Naval Research under the MURI grant N00014-08-1-0747, and by Caltech’s Lee Center for Advanced Networking.
Funders:
Funding AgencyGrant Number
NSFCCF-0729203
NSFCNS-0932428
NSFCCF-1018927
Office of Naval Research (ONR)N00014-08-1-0747
Caltech’s Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20150204-071707257
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20150204-071707257
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:54344
Collection:CaltechAUTHORS
Deposited By: Shirley Slattery
Deposited On:06 Feb 2015 01:03
Last Modified:03 Oct 2019 07:57

Repository Staff Only: item control page