This paper investigates a problem of robust output tracking control of networked control systems(NCSs)with network-induced delays,packet dropouts,parameter uncertainties and external disturbances.Firstly,an augmented ...This paper investigates a problem of robust output tracking control of networked control systems(NCSs)with network-induced delays,packet dropouts,parameter uncertainties and external disturbances.Firstly,an augmented model of time-delay system is proposed for networked tracking control systems.Then,considering the piecewise differentiable characteristic of time-delay,the criterion to output tracking performance analysis and controller design are derived by using an approach of free weighting matrix,reciprocally convex and cone complementarity linearization(CCL).Finally,simulation results of numerical examples show the effectiveness of the proposed approach,and illustrate the advantages of the proposed criteria which outperform previous criteria in the literature.展开更多
This paper considers the H-infinity dynamic output feedback control for descriptor systems with delay in states. The controller is a descriptor system without delay. Several equivalent sufficient conditions for the ex...This paper considers the H-infinity dynamic output feedback control for descriptor systems with delay in states. The controller is a descriptor system without delay. Several equivalent sufficient conditions for the existence of one descriptor dynamic controller without impulsive models are given. Furthermore the explicit expression of the desired controller is obtained. The detailed design of the controller is presented using the cone complementarity linearization iterative algorithm and the LMI method. A ntumerical example is shown to illustrate the designed method.展开更多
This paper investigates the problem of robust L1 model reduction for continuous-time uncertain stochastic time-delay systems. For a given mean-square stable system, our purpose is to construct reduced-order systems, s...This paper investigates the problem of robust L1 model reduction for continuous-time uncertain stochastic time-delay systems. For a given mean-square stable system, our purpose is to construct reduced-order systems, such that the error system between these two models is mean-square asymptotically stable and has a guaranteed L1 (also called peak-to-peak) performance. The peak-to-peak gain criterion is first established for stochastic time-delay systems, and the corresponding model reduction problem is solved by using projection lemma. Sufficient conditions are obtained for the existence of admissible reduced-order models in terms of linear matrix inequalities (LMIs) plus matrix inverse constraints. Since these obtained conditions are not expressed as strict LMIs, the cone complementarity linearization (CCL) method is exploited to cast them into nonlinear minimization problems subject to LMI constraints, which can be readily solved by standard numerical software. In addition, the development of reduced-order models with special structures, such as the delay-free model, is also presented. The efficiency of the proposed methods is demonstrated via a numerical example.展开更多
Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator...Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator on H,ΩH is a Lorentz cone,and q ∈ H.We investigate some conditions for which the problem concerned has a unique solution for all q ∈ H(i.e.,T has the GUS-property).Several sufficient conditions and several necessary conditions are given.In particular,we provide two suficient and necessary conditions of T having the GUS-property.Our approach is based on properties of the Jordan product and the technique from functional analysis,which is different from the pioneer works given by Gowda and Sznajder(2007) in the case of finite-dimensional spaces.展开更多
In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condi...In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms.展开更多
In this paper, we propose a theoretical framework of an infeasible interior-point algorithm for solving monotone linear cornplementarity problems over symmetric cones （SCLCP）. The new algorithm gets Newton-like dire...In this paper, we propose a theoretical framework of an infeasible interior-point algorithm for solving monotone linear cornplementarity problems over symmetric cones （SCLCP）. The new algorithm gets Newton-like directions from the Chen-Harker-Kanzow-Smale （CHKS） smoothing equation of the SCLCP. It possesses the following features： The starting point is easily chosen; one approximate Newton step is computed and accepted at each iteration; the iterative point with unit stepsize automatically remains in the neighborhood of central path; the iterative sequence is bounded and possesses （9（rL） polynomial-time complexity under the monotonicity and solvability of the SCLCP.展开更多
基金Supported by the National Natural Science Foundation of China(No.61104027,61573263)the Scientific Research Project of Hubei Provincial Department of Education(No.B2017280)
文摘This paper investigates a problem of robust output tracking control of networked control systems(NCSs)with network-induced delays,packet dropouts,parameter uncertainties and external disturbances.Firstly,an augmented model of time-delay system is proposed for networked tracking control systems.Then,considering the piecewise differentiable characteristic of time-delay,the criterion to output tracking performance analysis and controller design are derived by using an approach of free weighting matrix,reciprocally convex and cone complementarity linearization(CCL).Finally,simulation results of numerical examples show the effectiveness of the proposed approach,and illustrate the advantages of the proposed criteria which outperform previous criteria in the literature.
文摘This paper considers the H-infinity dynamic output feedback control for descriptor systems with delay in states. The controller is a descriptor system without delay. Several equivalent sufficient conditions for the existence of one descriptor dynamic controller without impulsive models are given. Furthermore the explicit expression of the desired controller is obtained. The detailed design of the controller is presented using the cone complementarity linearization iterative algorithm and the LMI method. A ntumerical example is shown to illustrate the designed method.
基金Sponsored by the Scientific and Technical Research Project Foundation of Education Department of Heilongjiang Province(Grant No. 10551013).
文摘This paper investigates the problem of robust L1 model reduction for continuous-time uncertain stochastic time-delay systems. For a given mean-square stable system, our purpose is to construct reduced-order systems, such that the error system between these two models is mean-square asymptotically stable and has a guaranteed L1 (also called peak-to-peak) performance. The peak-to-peak gain criterion is first established for stochastic time-delay systems, and the corresponding model reduction problem is solved by using projection lemma. Sufficient conditions are obtained for the existence of admissible reduced-order models in terms of linear matrix inequalities (LMIs) plus matrix inverse constraints. Since these obtained conditions are not expressed as strict LMIs, the cone complementarity linearization (CCL) method is exploited to cast them into nonlinear minimization problems subject to LMI constraints, which can be readily solved by standard numerical software. In addition, the development of reduced-order models with special structures, such as the delay-free model, is also presented. The efficiency of the proposed methods is demonstrated via a numerical example.
基金supported by National Natural Science Foundation of China(Grant No. 10871144)the Natural Science Foundation of Tianjin Province (Grant No. 07JCYBJC05200)
文摘Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator on H,ΩH is a Lorentz cone,and q ∈ H.We investigate some conditions for which the problem concerned has a unique solution for all q ∈ H(i.e.,T has the GUS-property).Several sufficient conditions and several necessary conditions are given.In particular,we provide two suficient and necessary conditions of T having the GUS-property.Our approach is based on properties of the Jordan product and the technique from functional analysis,which is different from the pioneer works given by Gowda and Sznajder(2007) in the case of finite-dimensional spaces.
基金supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)
文摘In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms.
基金Supported by the National Natural Science Foundation of China(No.10671010)Specialized Research Fund for the Doctoral Program of Higher Education(200800040024)
文摘In this paper, we propose a theoretical framework of an infeasible interior-point algorithm for solving monotone linear cornplementarity problems over symmetric cones （SCLCP）. The new algorithm gets Newton-like directions from the Chen-Harker-Kanzow-Smale （CHKS） smoothing equation of the SCLCP. It possesses the following features： The starting point is easily chosen; one approximate Newton step is computed and accepted at each iteration; the iterative point with unit stepsize automatically remains in the neighborhood of central path; the iterative sequence is bounded and possesses （9（rL） polynomial-time complexity under the monotonicity and solvability of the SCLCP.
