Repository landing page
research
Minimal reachability is hard to approximate
Abstract
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.Published versio- Article
- Science & technology
- Automation & control systems
- Engineering, electrical & electronic
- Engineering
- Approximation algorithms
- Computational complexity
- Controllability
- (non-)submodularity
- Sparse actuator placement
- Leader selection
- Limitations
- Systems
- Electrical and electronic engineering
- Applied mathematics
- Mechanical engineering
- Industrial engineering & automation
Similar works
Full text
Last time updated on 09/07/2019
This paper was published in Boston University Institutional Repository (OpenBU).
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.