Name
Abstract | ||
|---|---|---|
We consider a discrete-time linear quadratic Gaussian networked control setting where the (full information) observer and controller are separated by a fixed-rate noiseless channel. The minimal rate required to stabilize such a system has been well studied. However, for a given fixed rate, how to quantize the states so as to optimize performance is an open question of great theoretical and practical significance. We concentrate on minimizing the control cost for first-order scalar systems. To that end, we use the Lloyd-Max algorithm and leverage properties of logarithmically-concave functions to construct the optimal quantizer that greedily minimizes the cost at every time instant. By connecting the globally optimal scheme to the problem of scalar successive refinement, we argue that its gain over the proposed greedy algorithm is negligible. This is significant since the globally optimal scheme is often computationally intractable. All the results are proven for the more general case of disturbances with logarithmically-concave distributions. |
Year | Venue | DocType |
|---|---|---|
2018 | 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | Journal |
Volume | ISSN | Citations |
abs/1809.04917 | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anatoly Khina | 1 | 79 | 9.58 |
| Yorie Nakahira | 2 | 4 | 0.80 |
| Yu Su | 3 | 9 | 4.89 |
| Babak Hassibi | 4 | 8737 | 778.04 |