This paper surveys some signi ̄cant applications of interval analysis to robust control ̄eld. Interval analysis is specially powerful in bounding the ranges of functions while providing mathematically rigorous results. This capability is especially welcome in robust control, since a variety of analysis and design problems can be cast in the evaluation of the range of functions over intervals. To...

The H∞ control problem was posed by G. Zames in 1981 [1], and solved by P. Apkarian and D. Noll in 2006 [2]. In this treatise we present the rational of H∞ control, give a short history, and recall the milestones reached before our 2006 solution. We also discuss the recent Matlab function hinfstruct, based on work by Apkarian, Noll and Gahinet (TheMathworks) and available in the Robust Control ...

The objective of the paper is to design the robust discrete H∞ controller for dc motor position control using Frequency-Domain Robust Controller Design Toolbox. In this paper, the time performance characteristics of 2 and 3 order controller has been compared by taking dc motor as a design example. The paper aims at demonstrating and simple modelling and robust discrete control synthesis strateg...

Abstract--This paper proposes an optlmlzatmn-based approach to the robust 7-to~ control problem of uncertain contmuous or dmcrete-tlme linear tzme-mvariant systems with different tzme-varying delays m the state vector and control input of the dynamic equation and controlled output Sufficient delay-dependent conditions are derived for the control stabflmatmn problem, where both the sine of the t...

In this paper, the delay-dependent robust control problem is considered for time-delay systems with polytopic uncertainty. Robust stabilizing controller and robust H∞ controller are designed by using a parameter-dependent Lyapunov function that can reduce the conservativeness when used in robust performance analysis and synthesis problems for polytopic systems. Furthermore, multichannel H∞ dyna...

Many robust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x, ) 0, ∈ D}. This set typically contains an infinite and uncountable number of inequalities, and it has been proved that the related robust feasibility problem is numerically hard to solve in general. In this pap...