Computer-controlled systems: theory and design (2nd ed.)
Computer-controlled systems: theory and design (2nd ed.)
Robust constrained model predictive control using linear matrix inequalities
Automatica (Journal of IFAC)
SIAM Journal on Control and Optimization
Brief paper: Razumikhin-type stability theorems for discrete delay systems
Automatica (Journal of IFAC)
Topological obstructions for vertex numbers of Minkowski sums
Journal of Combinatorial Theory Series A
Automatica (Journal of IFAC)
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
SIAM Journal on Control and Optimization
Flexible control Lyapunov functions
ACC'09 Proceedings of the 2009 conference on American Control Conference
Automatica (Journal of IFAC)
Technical Communique: Robust sampled-data stabilization of linear systems: an input delay approach
Automatica (Journal of IFAC)
Lyapunov Methods for Time-Invariant Delay Difference Inclusions
SIAM Journal on Control and Optimization
Technical communique: Cyclic invariance for discrete time-delay systems
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Hi-index | 22.15 |
Polytopic delay difference inclusions (DDIs) have received increasing attention recently, mostly due to their ability to model a wide variety of relevant processes, including networked control systems. One of the fundamental problems for DDIs that poses a non-trivial challenge is stabilization. This paper embraces the Razumikhin approach and provides several solutions to the stabilization problem as follows. Firstly, a method to synthesize a control Lyapunov-Razumikhin function (cLRF) is presented for unconstrained DDIs. Secondly, for constrained DDIs, a receding horizon controller based on the cLRF for the unconstrained system is proposed, along with a closed-loop stability analysis. Thirdly, it is shown that a tractable implementation of the developed control algorithm can be attained even for large delays, by means of an on-line Minkowski set addition. An advantageous feature of the developed methodology is that all the synthesis algorithms can be formulated as a low complexity semi-definite programming problem for quadratic cLRF candidates. A comparison with alternative synthesis methods demonstrates the advances provided by the developed theory.