On the Equivalence among Three Controllability Problems for a Networked System

11 Oct 2016 Zhou Tong

A new proof is given for the mathematical equivalence among three $k$-sparse controllability problems of a networked system, which plays key roles in Olshevsky,2014, in the establishment of the NP-hardness of the associated minimal controllability problems (MCP). Compared with the available ones, a completely deterministic approach is adopted... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • OPTIMIZATION AND CONTROL
  • DYNAMICAL SYSTEMS