Distinctive LMI Formulations for Admissibility and Stabilization Algorithms of Singular Fractional-Order Systems with Order Less than One
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
This paper presents three novel sufficient and necessary conditions for the admissibility of singular fractional-order systems (FOSs), a stabilization criterion, and a solution algorithm. The strict linear matrix inequality (LMI) stability criterion for integer-order systems is generalized to singular FOSs by using column-full rank matrices. This admissibility criterion does not involve complex variables and is different from all previous results, filling a gap in this area. Based on the LMIs in the generalized condition, the improved criterion utilizes a variable substitution technique to reduce the number of matrix variables to be solved from one pair to one, reflecting the admissibility more essentially. This improved result simplifies the programming process compared to the traditional approach that requires two matrix variables. To complete the state feedback controller design, the system matrices in the generalized admissibility criterion are decoupled, but bilinear constraints still occur in the stabilization criterion. For this case, where a feasible solution cannot be found using the MATLAB LMI toolbox, a branch-and-bound algorithm (BBA) is designed to solve it. Finally, the validity of these criteria and the BBA is verified by three examples, including a real circuit model.