Minimal Reachability is Hard To Approximate

DOI10.1109/TAC.2018.2836021zbMath1482.93242arXiv1710.10244OpenAlexW2963801098MaRDI QIDQ4629833

George J. Pappas, Alexander Olshevsky, Vasileios Tzoumas, Ali Jadbabaie

Publication date: 28 March 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.10244

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Linear systems in control theory (93C05) Approximation algorithms (68W25) Large-scale systems (93A15)

Related Items (5)

Leader selection in networks under switching topologies with antagonistic interactions ⋮ Sparse control for continuous‐time systems ⋮ A survey on compressed sensing approach to systems and control ⋮ A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds ⋮ Resource-aware time-optimal control with multiple sparsity measures

This page was built for publication: Minimal Reachability is Hard To Approximate