Sketching for Elimination of Communication Links in LQG Teams
Jiacheng Tang, Abhishek Gupta · IEEE Control Systems Letters · 2021
We consider here a scenario where a team of agents want to switch from a fully connected communication network to a network with limited bandwidth because of a cyber attack. The goal is to identify which communication link should still be active in the new network for near-optimal overall performance. This is formulated as a cardinality constrained quadratic minimization problem, which is NP-hard in general. To obtain an approximately optimal solution efficiently, we used random projection (RP) for dimensionality reduction. We show that the value of the sketched team is bounded above by a constant factor times the optimal value of the team with high probability.