Minimal reachability problems

  title={Minimal reachability problems},
  author={Vasileios Tzoumas and Ali Jadbabaie and George J. Pappas},
  journal={2015 54th IEEE Conference on Decision and Control (CDC)},
In this paper, we address a collection of state space reachability problems, for linear time-invariant systems, using a minimal number of actuators. In particular, we design a zero-one diagonal input matrix B, with a minimal number of non-zero entries, so that a specified state vector is reachable from a given initial state. Moreover, we design a B so that a system can be steered either into a given subset, or sufficiently close to a desired state. This work extends the results of [1] and [2… 

Figures from this paper

Minimal input selection for robust control
This paper derives sufficient conditions for existence of a stabilizing controller for an uncertain system that are based on a subset of system modes lying within the controllability subspace induced by the set of inputs, and proves that it is equivalent to a submodular optimization problem, leading to polynomial-time algorithms with provable optimality bounds.
Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds
The main result is to provide a polynomial-time actuator schedule that on average selects only a constant number of actuators at each time step, independent of the dimension, to furnish a guaranteed approximation of the controllability metrics in comparison to when all actuators are in use.
Input Selection for Performance, Stabilizability, and Controllability of Structured Linear Descriptor Systems
This paper investigates the problem of selecting input nodes in order to control structured linear descriptor systems, which contain free parameters that can take any value as well as fixed parameters that take a known, fixed value.
Limitations and Tradeoffs in Minimum Input Selection Problems
A framework to design a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using a polynomial-time algorithm is developed and it is shown that several popular and widely used optimization criteria in the literature belong to this new class of controllability metrics.
Input Constraint Sets for Robust Regulation of Linear Systems
In robust control under state constraints the set of admissible inputs is usually considered as given, under the assumption that the actuators have been already designed. However, if the input set is
Target Control of Networked Systems
This manuscript covers three topics investigated in detail by the author: the role of the choice of target nodes (system outputs) on the control effort, creating and analyzing graphs with symmetry, and the relationship between graph structural properties and control effort.
A Distance-Based Approach to Strong Target Control of Dynamical Networks
This paper considers target control of a family of linear control systems associated with a network, and provides both a necessary and a sufficient topological condition under which the network is strongly targeted controllable.
Sensor placement for optimal Kalman filtering: Fundamental limits, submodularity, and algorithms
It is proved that the minimum mean square error of the Kalman filter decreases only linearly as the number of sensors increases, a fundamental design limit, and an efficient approximation algorithm is provided that selects a small number sensors so to optimize theKalman filter with respect to this estimation error.
S Y ] 1 2 A pr 2 01 8 Herding Complex Networks
The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored, including the input addition problem, which investigates which nodes in a network should receive inputs to ensure that the system is herdable.
Herding Positive, Complex Networks
The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored, which investigates which nodes in a network should receive inputs to ensure that the system is herdable.


On the Exact Solution of the Minimal Controllability Problem
This paper studies the minimal controllability problem (MCP), i.e., the problem of, given a linear time-invariant system, finding the sparsest input vector that ensures system’s controllability. We
Minimal actuator placement with optimal control constraints
This work introduces the problem of minimal actuator placement in a linear control system so that a bound on the minimum control effort for a given state transfer is satisfied while controllability is ensured and provides an efficient algorithm that approximates up to a multiplicative factor of O(log n).
Minimal Controllability Problems
  • Alexander Olshevsky
  • Computer Science, Mathematics
    IEEE Transactions on Control of Network Systems
  • 2014
It is shown that even approximating the minimum number of variables that need to be affected within a multiplicative factor of clog n is NP-hard for some positive c, and that it is possible to find sets of variables matching this in approximability barrier in polynomial time.
Minimal Actuator Placement With Bounds on Control Effort
An efficient algorithm is provided which approximates up to a multiplicative factor of O(log n), with n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time in the worst case.
On Submodularity and Controllability in Complex Dynamical Networks
This paper shows that several important classes of metrics based on the controllability and observability Gramians have a strong structural property that allows for either efficient global optimization or an approximation guarantee by using a simple greedy heuristic for their maximization.
A survey of computational complexity results in systems and control
Sensor and Actuator Placement for Linear Systems Based on $H_{2}$ and $H_{\infty}$ Optimization
The sensor placement algorithm is used to place phase measurement units with maximal impact on the H<sub>2</sub> performance in a power grid and any other combination of actuator placement for state-feedback design or sensor placement for observer design for continuous- time or discrete-time linear systems based on H 2 or H∞.
Sensor Selection via Convex Optimization
This paper describes a heuristic, based on convex optimization, that gives a subset selection as well as a bound on the best performance that can be achieved by any selection of k sensor measurements.
Optimal approximation for submodular and supermodular optimization with bounded curvature
It is proved that the approximation results obtained are the best possible in the value oracle model, even in the case of a cardinality constraint.
Recent Research in Cooperative Control of Multivehicle Systems
This paper presents a survey of recent research in cooperative control of multivehicle systems, using a common mathematical framework to allow different methods to be described in a unified way. The