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.
Generating global products of LAI and FPAR from SNPP-VIIRS data: theoretical background and implementation Yan, Kai; Park, Taejin; Chen, Chi; Xu, Baodong; Song, Wanjuan; Yang, Bin; Zeng, Yelu; Liu, Zhao; Yan, Guangjian; Knyazikhin, Yuri; Myneni, Ranga B.Leaf area index (LAI) and fraction of photosynthetically active radiation (FPAR) absorbed by vegetation have been successfully generated from the Moderate Resolution Imaging Spectroradiometer (MODIS) data since early 2000. ...
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 ...
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 ...