TY - GEN

T1 - Rate-cost tradeoffs in control

AU - Kostina, Victoria

AU - Hassibi, Babak

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The authors acknowledge many stimulating discussions with Dr. Anatoly Khina and his helpful comments on the earlier versions of the manuscript. The authors are also grateful to Ayush Pandey, who with incessant enthusiasm generated the plot in Fig. 2. The work of Victoria Kostina was supported in part by the National Science Foundation (NSF) under Grant CCF-1566567. The work of Babak Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA's Jet Propulsion Laboratory through the President and Director's Fund, and by King Abdullah University of Science and Technology.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.

PY - 2017/2/13

Y1 - 2017/2/13

N2 - Consider a distributed control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is minimize a quadratic cost function. The most basic special case of that cost function is the mean-square deviation of the system state from the desired state. We study the fundamental tradeoff between the communication rate r bits/sec and the limsup of the expected cost b, and show a lower bound on the rate necessary to attain b. The bound applies as long as the system noise has a probability density function. If target cost b is not too large, that bound can be closely approached by a simple lattice quantization scheme that only quantizes the innovation, that is, the difference between the controller's belief about the current state and the true state.

AB - Consider a distributed control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is minimize a quadratic cost function. The most basic special case of that cost function is the mean-square deviation of the system state from the desired state. We study the fundamental tradeoff between the communication rate r bits/sec and the limsup of the expected cost b, and show a lower bound on the rate necessary to attain b. The bound applies as long as the system noise has a probability density function. If target cost b is not too large, that bound can be closely approached by a simple lattice quantization scheme that only quantizes the innovation, that is, the difference between the controller's belief about the current state and the true state.

UR - http://hdl.handle.net/10754/623584

UR - http://ieeexplore.ieee.org/document/7852366/

UR - http://www.scopus.com/inward/record.url?scp=85010796961&partnerID=8YFLogxK

U2 - 10.1109/allerton.2016.7852366

DO - 10.1109/allerton.2016.7852366

M3 - Conference contribution

SN - 9781509045501

SP - 1157

EP - 1164

BT - 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

PB - Institute of Electrical and Electronics Engineers (IEEE)

ER -