scholarly journals Robust Finite-TimeH∞Control for Linear Time-Varying Descriptor Systems with Jumps

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Xiaoming Su ◽  
Adiya Bao
Keyword(s):  
Linear Matrix Inequalities ◽  
Finite Time ◽  
Linear Time ◽  
Descriptor Systems ◽  
Feasibility Problem ◽  
Descriptor System ◽  
Linear Matrix ◽  
Time Varying ◽  
Matrix Inequalities ◽  
Finite Time Boundedness

The finite-timeH∞control problem is addressed for uncertain time-varying descriptor system with finite jumps and time-varying norm-bounded disturbance. Firstly, a sufficient condition of finite-time boundedness for the abovementioned class of system is obtained. Then the result is extended to finite-timeH∞for the system. Based on the condition, state feedback controller is designed such that the closed-loop system is finite-time boundedness and satisfiesL2gain. The conditions are given in terms of differential linear matrix inequalities (DLMIs) and linear matrix inequalities (LMIs), and such conditions require the solution of a feasibility problem involving DLMIs and LMIs, which can be solved by using existing linear algorithms. Finally, a numerical example is given to illustrate the effectiveness of the method.

scholarly journals Finite-Time Stability Analysis for a Class of Continuous Switched Descriptor Systems

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Pan Tinglong ◽  
Yang Kun ◽  
Shen Yanxia ◽  
Gao Zairui ◽  
Ji Zhicheng
Keyword(s):  
Finite Time ◽  
Sufficient Conditions ◽  
Average Dwell Time ◽  
Descriptor Systems ◽  
Descriptor System ◽  
Linear Matrix ◽  
Time Interval ◽  
Time Stability ◽  
Finite Time Stability ◽  
Finite Time Boundedness

Finite-time stability has more practical application values than the classical Lyapunov asymptotic stability over a fixed finite-time interval. The problems of finite-time stability and finite-time boundedness for a class of continuous switched descriptor systems are considered in this paper. Based on the average dwell time approach and the multiple Lyapunov functions technique, the concepts of finite-time stability and boundedness are extended to continuous switched descriptor systems. In addition, sufficient conditions for the existence of state feedback controllers in terms of linear matrix inequalities (LMIs) are obtained with arbitrary switching rules, which guarantee that the switched descriptor system is finite-time stable and finite-time bounded, respectively. Finally, two numerical examples are presented to illustrate the reasonableness and effectiveness of the proposed results.

scholarly journals Design and analysis of three nonlinearly activated ZNN models for solving time-varying linear matrix inequalities in finite time

2020 ◽  
Vol 390 ◽  
pp. 78-87 ◽  
Author(s):  
Yuejie Zeng ◽  
Lin Xiao ◽  
Kenli Li ◽  
Jichun Li ◽  
Keqin Li ◽  
...  
Keyword(s):  
Linear Matrix Inequalities ◽  
Finite Time ◽  
Linear Matrix ◽  
Time Varying ◽  
Matrix Inequalities

Continuous-Time Feedback Control With Finite-Time Boundedness and H∞ Performance Criteria

2015 ◽  
Author(s):  
Jacob D. Hostettler ◽  
Xin Wang
Keyword(s):  
Feedback Control ◽  
Linear Matrix Inequalities ◽  
Finite Time ◽  
Control Method ◽  
Sufficient Conditions ◽  
State Feedback Control ◽  
Performance Criteria ◽  
Linear Matrix ◽  
Matrix Inequalities ◽  
Finite Time Boundedness

For advanced control applications, research into the use of linear matrix inequalities has yielded a notable amount of work in the area of nonlinear systems. Linear Matrix Inequalities can be formed through the application of desired performance criteria to a general system. By proper selection of a Lyapunov energy function, sufficient conditions to satisfy the performance objectives can be realized. The performance criteria, typically chosen for the application, define the objectives associated with the control. This work presents a control method for discrete-time systems with finite-time boundedness and H∞ performance criteria. The design of the controller corresponds to a system existing with bounded model uncertainties, and in the presence of L2 type external disturbances. Through the use of a linear state feedback control, sufficient conditions which guarantee the finite-time stability and H∞ performance objectives are achieved via the solution of a Linear Matrix Inequality. MATLAB application and simulation is carried out using the field oriented control of a permanent magnet synchronous generator in order to effectively demonstrate the effectiveness of this control strategy in the wind energy conversion system application.

A new control approach for a class of linear switched systems with time-varying delay

2021 ◽  
pp. 014233122199272
Author(s):  
Abbas Zabihi Zonouz ◽  
Mohammad Ali Badamchizadeh ◽  
Amir Rikhtehgar Ghiasi
Keyword(s):  
Stability Analysis ◽  
Linear Matrix Inequalities ◽  
Linear Matrix ◽  
Switching Systems ◽  
Time Varying ◽  
Matrix Inequalities ◽  
Time Varying Delay ◽  
Linear Switching Systems ◽  
The Stability ◽  
Varying Delay

In this paper, a new method for designing controller for linear switching systems with varying delay is presented concerning the Hurwitz-Convex combination. For stability analysis the Lyapunov-Krasovskii function is used. The stability analysis results are given based on the linear matrix inequalities (LMIs), and it is possible to obtain upper delay bound that guarantees the stability of system by solving the linear matrix inequalities. Compared with the other methods, the proposed controller can be used to get a less conservative criterion and ensures the stability of linear switching systems with time-varying delay in which delay has way larger upper bound in comparison with the delay bounds that are considered in other methods. Numerical examples are given to demonstrate the effectiveness of proposed method.

scholarly journals A New Stability Criterion for Systems with Distributed Time-Varying Delays via Mixed Inequalities Method

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Jun-kang Tian ◽  
Yan-min Liu
Keyword(s):  
Linear Matrix Inequalities ◽  
Stability Criterion ◽  
Linear Matrix ◽  
Time Varying ◽  
Matrix Inequalities ◽  
Numerical Examples ◽  
Delay Dependent ◽  
Delay Dependent Stability ◽  
New Inequalities

This paper is concerned with the delay-dependent stability of systems with distributed time-varying delays. The novelty relies on the use of some new inequalities which are less conservative than some existing inequalities. A less conservative stability criterion is obtained by constructing some new augmented Lyapunov–Krasovskii functionals, which are given in terms of linear matrix inequalities. The effectiveness of the presented criterion is demonstrated by two numerical examples.

scholarly journals Finite-Time Boundedness Control of Time-Varying Descriptor Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-5
Author(s):  
Xiaoming Su ◽  
Yali Zhi ◽  
Qingling Zhang
Keyword(s):  
Control Problem ◽  
Finite Time ◽  
State Feedback ◽  
Descriptor Systems ◽  
Necessary Condition ◽  
Time Varying ◽  
Time Stability ◽  
Finite Time Stability ◽  
Finite Time Boundedness ◽  
Sufficient And Necessary Condition

This paper mainly studies a control problem of finite-time boundedness of time-varying descriptor systems. Firstly, a sufficient and necessary condition of finite-time stability is given, then a sufficient condition of finite-time boundedness for time-varying descriptor systems is given. Secondly, we analyze the finite-time boundedness control problem and design the finite-time state feedback controller; the controller is given based on LMIs for time-varying descriptor systems and time-varying uncertain descriptor systems, respectively. Finally, a numerical example is given to prove the effectiveness of the method.

Stabilization of the Rotary Inverted Pendulum Using Aggregate Modeling

2006 ◽  
Author(s):  
Kiriakos Kiriakidis ◽  
Matthew Feemster ◽  
Richard O'Brien
Keyword(s):  
Linear Matrix Inequalities ◽  
Inverted Pendulum ◽  
Feasibility Problem ◽  
Linear Matrix ◽  
Matrix Inequalities ◽  
Aggregate Model ◽  
Stabilizing Controller ◽  
Aggregate Modeling ◽  
Operating Region ◽  
Rotary Inverted Pendulum

Using the method of aggregate modeling, the paper derives an approximation of the rotary pendulum's Euler-Lagrange dynamics within a specified operating region. Based on the resulting aggregate model, the authors cast the system's stabilization as a feasibility problem associated with linear matrix inequalities. Furthermore, the authors test the resulting stabilizing controller on the actual rotary pendulum and verify the expected results experimentally.

scholarly journals Constraint Consensus Methods for Finding Strictly Feasible Points of Linear Matrix Inequalities

2015 ◽  
Vol 2015 ◽  
pp. 1-16
Author(s):  
Shafiu Jibrin ◽  
James W. Swift
Keyword(s):  
Linear Matrix Inequalities ◽  
Numerical Experiments ◽  
Phase 1 ◽  
Feasibility Problem ◽  
Linear Matrix ◽  
Consensus Methods ◽  
Phase 2 ◽  
Matrix Inequalities ◽  
Feasible Points ◽  
Constraint Consensus

We give algorithms for solving the strict feasibility problem for linear matrix inequalities. These algorithms are based on John Chinneck’s constraint consensus methods, in particular, the method of his original paper and the modified DBmax constraint consensus method from his paper with Ibrahim. Our algorithms start with one of these methods as “Phase 1.” Constraint consensus methods work for any differentiable constraints, but we take advantage of the structure of linear matrix inequalities. In particular, for linear matrix inequalities, the crossing points of each constraint boundary with the consensus ray can be calculated. In this way we check for strictly feasible points in “Phase 2” of our algorithms. We present four different algorithms, depending on whether the original (basic) or DBmax constraint consensus vector is used in Phase 1 and, independently, in Phase 2. We present results of numerical experiments that compare the four algorithms. The evidence suggests that one of our algorithms is the best, although none of them are guaranteed to find a strictly feasible point after a given number of iterations. We also give results of numerical experiments indicating that our best method compares favorably to a new variant of the method of alternating projections.

Sign in / Sign up

Export Citation Format

Share Document