LQG Control and Sensing Co-Design
Vasileios Tzoumas, Luca Carlone, George J. Pappas, Ali Jadbabaie

TL;DR
This paper addresses the joint design of sensing and control policies in LQG problems, proposing polynomial-time algorithms with suboptimality guarantees for sensor selection under cost and performance constraints.
Contribution
It introduces the first polynomial-time algorithms with performance guarantees for LQG sensing-control co-design, leveraging a separation principle and supermodular optimization techniques.
Findings
Algorithms achieve suboptimality guarantees per instance.
Connections established between algorithm performance and control-theoretic metrics.
Applications demonstrated in formation control and robot navigation.
Abstract
We investigate a Linear-Quadratic-Gaussian (LQG) control and sensing co-design problem, where one jointly designs sensing and control policies. We focus on the realistic case where the sensing design is selected among a finite set of available sensors, where each sensor is associated with a different cost (e.g., power consumption). We consider two dual problem instances: sensing-constrained LQG control, where one maximizes control performance subject to a sensor cost budget, and minimum-sensing LQG control, where one minimizes sensor cost subject to performance constraints. We prove no polynomial time algorithm guarantees across all problem instances a constant approximation factor from the optimal. Nonetheless, we present the first polynomial time algorithms with per-instance suboptimality guarantees. To this end, we leverage a separation principle, that partially decouples the design…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
