Minimal reachability is hard to approximate
Pappas, George J.
MetadataShow full item record
Citation (published version)Ali Jadbabaie, Alexander Olshevsky, George J Pappas, Vasileios Tzoumas. 2017. "Minimal Reachability is Hard To Approximate." IEEE Transactions on Automatic Control, https://doi.org/10.1109/TAC.2018.2836021
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.
Rights© 2011 IEEE.
Showing items related by title, author, creator and subject.
Hirsch, Michael; Semeter, Joshua; Zettergren, Matthew; Dahlgren, Hanna; Goenka, Chhavi; Akbari, Hassanali (IEEE-Inst Electrical Electronics Engineers Inc, 2016-05-01)We present a feasibility study for a high frame rate, short baseline auroral tomographic imaging system useful for estimating parametric variations in the precipitating electron number flux spectrum of dynamic auroral ...
Tron, Roberto; Afsari, Bijan; Vidal, Rene (IEEE, 2013-04-01)Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in ...
Wong, Wing Shing; Baillieul, John (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2012-11-01)Recent papers have treated control communication complexity in the context of information-based, multiple agent control systems including nonlinear systems of the type that have been studied in connection with ...