Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2020 | public
Book Section - Chapter

The Minimal Directed Information Needed to Improve the LQG Cost

Abstract

We study a linear quadratic Gaussian (LQG) control problem, in which a noisy observation of the system state is available to the controller. To lower the achievable LQG cost, we introduce an extra communication link from the system to the controller. We investigate the trade-off between the improved LQG cost and the consumed communication (information) resources that are measured with the conditional directed information. The objective is to minimize the directed information over all encoding-decoding policies subject to a constraint on the LQG cost. The main result is a semidefinite programming formulation for the optimization problem in the finite-horizion scenario where the dynamical system may have time-varying parameters. This result extends the seminal work by Tanaka et al., where the direct noisy measurement of the system state at the controller is assumed to be absent. As part of our derivation to show the optimality of an encoder that transmits a Gaussian measurement of the state, we show that the presence of the noisy measurements at the encoder can not reduce the minimal directed information, extending a prior result of Kostina and Hassibi to the vector case. Finally, we show that the results in the finite-horizon case can be extended to the infinite-horizon scenario when assuming a time-invariant system, but possibly a time-varying policy. We show that the solution for this optimization problem can be realized by a time-invariant policy whose parameters can be computed explicitly from a finite-dimensional semidefinite program.

Additional Information

© 2020 IEEE. This work was supported in part by the National Science Foundation (NSF) under grants CCF-1751356 and CCF-1956386. The work of O. Sabag is partially supported by the ISEF international postdoctoral fellowship.

Additional details

Created:
August 20, 2023
Modified:
March 5, 2024