Controllability of a Linear System With Nonnegative Sparse Controls

@article{Joseph2022ControllabilityOA,
  title={Controllability of a Linear System With Nonnegative Sparse Controls},
  author={Geethu Joseph},
  journal={IEEE Transactions on Automatic Control},
  year={2022},
  volume={67},
  pages={468-473}
}
  • Geethu Joseph
  • Published 10 February 2020
  • Mathematics, Computer Science
  • IEEE Transactions on Automatic Control
This article studies controllability of a discrete-time linear dynamical system using nonnegative and sparse inputs. These constraints on the control input arise naturally in many real-life systems, where the external influence on the system is unidirectional, and activating each input node adds to the cost of control. We derive the necessary and sufficient conditions for the controllability of the system, without imposing any constraints on the system matrices. Unlike the straightforward… 

Output Controllability of a Linear Dynamical System with Sparse Controls

This paper derives non-combinatorial conditions for output sparse controllability which can be verified with polynomial time complexity and provides bounds on the minimum sparsity level required to ensure output controllable of the system.

References

SHOWING 1-10 OF 28 REFERENCES

Null Controllability of Linear Systems with Constrained Controls

The paper considers the problem of steering the state of a linear time-varying system to the origin when the control is subject to magnitude constraints. Necessary and sufficient conditions are given

Controllability in Linear Autonomous Systems with Positive Controllers

This paper presents results on the controllability of the autonomous linear control system in $R^n $, $\dot x = Ax + Bu$, where $u \in \Omega \subset R^m $ without the assumption that the origin in

On the null-controllability of linear discrete-time systems with restrained controls

This paper is devoted to the null-controllability problem for linear, autonomous, discrete-time systems with restrained controls, i.e., systems described by the equationxk+1=Axk+uk,uk∈ Г, where 0 ∈

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.

Scheduling of control nodes for improved network controllability

The problem of controlling a linear time-invariant network by means of (possibly) time-varying set of control nodes is considered, and a scheduling algorithm is proposed to select control nodes over time so as to improve the network controllability degree.

Controllability of linear oscillatory systems using positive controls

A linear autonomous control process is considered where the null control is an extreme point of the restraint set $\Omega $. In the event that $\Omega = [0,1]$ (hence, scalar control) necessary and

The Geometry of the Reachability Set for Linear Discrete-time Systems with Positive Controls

In order to give a complete geometrical characterization of the reachable set, a formula is provided to evaluate the dimension of the largest reachable subspace and necessary and sufficient conditions for polyhedrality of the proper cone in terms of eigenvalues location.

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.

Deterministic Polynomial-Time Actuator Scheduling With Guaranteed Performance

By leveraging recent advances in the graph sparsification literature, a framework for designing a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using a polynomial-time algorithm is developed.

On the reachable set for third-order linear discrete-time systems with positive control