Minimal Reachability is Hard to Approximate

Author(s)
Jadbabaie, A; Olshevsky, A; Pappas, GJ; Tzoumas, V
Thumbnail
DownloadAccepted version (320.5Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2019-02-01
URI
https://hdl.handle.net/1721.1/148591
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering; Massachusetts Institute of Technology. Institute for Data, Systems, and Society
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
Collections