Alternate checking criteria for reachable controllability of rectangular descriptor systems

Mishra, Vikas Kumar; Tomar, Nutan Kumar

doi:10.14736/kyb-2017-5-0820

Search citation statements

Order By: Relevance

Paper Sections

Select...

Problem Formulation1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…System (2) or (E, A, B) is called the linear singular system or descriptor system. Obviously, when E is nonsingular, this system collapses to the standard state-space system [23].…”

Section: Problem Formulationmentioning

confidence: 99%

Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

In this paper, the problem of determining the sparsest input matrices to ensure controllability of linear singular systems is investigated. Firstly, it is shown that, determining the sparsest input matrices to ensure reachable controllability or complete controllability is NP-hard, even when the system 'singularity' is arbitrarily large. Secondly, submodular functions for singular systems are built, upon which greedy algorithms are developed to approximate the sparsest input matrices with guaranteed performance bounds for the case where there is no restriction on the number of independent inputs. Thirdly, a two-step greedy algorithm is proposed for determining the sparsest input matrices with a given number of inputs to ensure controllability. Compared with the existing algorithms for sparsest input selections, the proposed algorithm achieves better trade-off between the approximation performances and computation efficiency, which are demonstrated by two simulation examples. INDEX TERMS Controllability, computational complexity, networked control systems, optimization.

show abstract

“…System (2) or (E, A, B) is called the linear singular system or descriptor system. Obviously, when E is nonsingular, this system collapses to the standard state-space system [23].…”

Section: Problem Formulationmentioning

confidence: 99%

Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

Alternate checking criteria for reachable controllability of rectangular descriptor systems

Abstract: Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

Cited by 1 publication

References 21 publications

Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm

Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm

Contact Info

Product

Resources

About