A Separation Theorem for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds

05/06/2020
by   Milad Siami, et al.
0

We study the problem of jointly designing a sparse sensor and actuator schedule for linear dynamical systems while guaranteeing a control/estimation performance that approximates the fully sensed/actuated setting. We further prove a separation principle, showing that the problem can be decomposed into finding sensor and actuator schedules separately. However, it is shown that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial time for time-invariant sensor/actuator schedules; instead, we develop deterministic polynomial-time algorithms for a time-varying sensor/actuator schedule with guaranteed approximation bounds. Our main result is to provide a polynomial-time joint actuator and sensor schedule that on average selects only a constant number of sensors and actuators at each time step, irrespective of the dimension of the system. The key idea is to sparsify the controllability and observability Gramians while providing approximation guarantees for Hankel singular values. This idea is inspired by recent results in theoretical computer science literature on sparsification.

READ FULL TEXT
research
01/09/2019

Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks

This paper studies the 1-2-1 half-duplex network model, where two half-d...
research
11/04/2021

Reallocation Problems with Minimum Completion Time

Reallocation scheduling is one of the most fundamental problems in vario...
research
11/07/2018

A Tight Analysis of Bethe Approximation for Permanent

We prove that the permanent of nonnegative matrices can be deterministic...
research
03/24/2020

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering

Given a linear dynamical system affected by stochastic noise, we conside...
research
12/12/2019

A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time

We give the first constant-factor approximation for the Directed Latency...
research
04/28/2023

A Critique of Czerwinski's "Separation of PSPACE and EXP"

Czerwinski's paper "Separation of PSPACE and EXP" [Cze21] claims to prov...

Please sign up or login with your details

Forgot password? Click here to reset