Anytime reliable codes for stabilizing plants over erasure channels

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.

[1]  Leonard J. Schulman Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[2]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[3]  A. Matveev,et al.  Estimation and Control over Communication Networks , 2008 .

[4]  F. Schweppe Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .

[5]  S. Yüksel A random time stochastic drift result and application to stochastic stabilization over noisy channels , 2009 .

[6]  Robin J. Evans,et al.  Stabilizability of Stochastic Linear Systems with Finite Feedback Data Rates , 2004, SIAM J. Control. Optim..

[7]  F. Schweppe Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .

[8]  Pravin Varaiya,et al.  Scalar estimation and control with noisy binary observations , 2004, IEEE Transactions on Automatic Control.

[9]  Osman Guler,et al.  The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases , 2007, 0709.0707.

[10]  Panos J. Antsaklis,et al.  Control and Communication Challenges in Networked Real-Time Systems , 2007, Proceedings of the IEEE.

[11]  Babak Hassibi,et al.  Linear error correcting codes with anytime reliability , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[12]  Alexey S. Matveev,et al.  Estimation and Control over Communication Networks (Control Engineering) , 2007 .

[13]  Massimo Franceschetti,et al.  Data Rate Theorem for Stabilization Over Time-Varying Feedback Channels , 2009, IEEE Transactions on Automatic Control.

[14]  A. Sluis Upperbounds for roots of polynomials , 1970 .

[15]  Rafail Ostrovsky,et al.  Error-correcting codes for automatic control , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[16]  Anant Sahai,et al.  The Necessity and Sufficiency of Anytime Capacity for Stabilization of a Linear System Over a Noisy Communication Link—Part I: Scalar Systems , 2006, IEEE Transactions on Information Theory.

[17]  Anant Sahai,et al.  The necessity and sufficiency of anytime capacity for stabilization of a linear system over a noisy communication link, Part II: vector systems , 2006 .