vix.ing · top · new · best · stats · spec

Minimal Reachability is Hard To Approximate

2017/10/27 by Jadbabaie, Ali, Olshevsky, Alexander, Pappas, George J. +1 · 1 citation
#FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.1710.10244

Abstract

In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's initial condition to a given final state is possible. Assuming a standard complexity hypothesis, we show that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial, time.

Cited by

Related