dc.contributor.author | Jadbabaie, A | |
dc.contributor.author | Olshevsky, A | |
dc.contributor.author | Pappas, GJ | |
dc.contributor.author | Tzoumas, V | |
dc.date.accessioned | 2023-03-17T13:53:10Z | |
dc.date.available | 2023-03-17T13:53:10Z | |
dc.date.issued | 2019-02-01 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/148591 | |
dc.description.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. | en_US |
dc.language.iso | en | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.relation.isversionof | 10.1109/TAC.2018.2836021 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | other univ website | en_US |
dc.title | Minimal Reachability is Hard to Approximate | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Jadbabaie, A, Olshevsky, A, Pappas, GJ and Tzoumas, V. 2019. "Minimal Reachability is Hard to Approximate." IEEE Transactions on Automatic Control, 64 (2). | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Institute for Data, Systems, and Society | en_US |
dc.relation.journal | IEEE Transactions on Automatic Control | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2023-03-17T12:17:29Z | |
dspace.orderedauthors | Jadbabaie, A; Olshevsky, A; Pappas, GJ; Tzoumas, V | en_US |
dspace.date.submission | 2023-03-17T12:17:30Z | |
mit.journal.volume | 64 | en_US |
mit.journal.issue | 2 | en_US |
mit.license | OPEN_ACCESS_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |