Minimal Reachability is Hard to Approximate
Name
08358739.pdf
Description
Accepted version
Size
320.52 KB
Format
Adobe PDF
Checksum (MD5)
af88e212d867104c115a2cae85d94acd
Author(s)
Jadbabaie, A
Olshevsky, A
Pappas, GJ
Tzoumas, V
Date Issued
February 1, 2019
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Jadbabaie, A, Olshevsky, A, Pappas, GJ and Tzoumas, V. 2019. "Minimal Reachability is Hard to Approximate." IEEE Transactions on Automatic Control, 64 (2).
Version
Author's final manuscript
Abstract
© 1963-2012 IEEE. 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.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TAC.2018.2836021
