Title :
Generalized L1-optimization problem: reduction to a finite-dimensional convex minimization
Author :
Barabanov, Andrey E. ; Sokolov, Andrei A.
Author_Institution :
St. Petersburg State Univ., Russia
Abstract :
The minimax compensator design problem is stated for a MIMO dynamic plant with a convex set of disturbances in l∞ space. The performance index is a convex function of the output. This is a generalization of the l1-optimal compensator design problem. The main result is a reduction of the problem to a convex minimization problem in a modified state-space of the system plant+measurement. The last problem can be easily solved by various methods including gradient algorithms. The reduction algorithm is the most complex part of the computations. It can be done on the basis of dynamic programming approach
Keywords :
MIMO systems; closed loop systems; compensation; control system synthesis; dynamic programming; linear systems; minimisation; performance index; state-space methods; MIMO dynamic plant; convex function; convex minimization; dynamic programming; finite-dimensional convex minimization; generalized L1-optimization problem; gradient algorithms; l1-optimal compensator design problem; minimax compensator design; modified state-space; performance index; reduction algorithm; Control systems; Convolution; Equations; Feedback loop; Linear feedback control systems; Minimax techniques; Performance analysis; Polynomials; Production; Transfer functions;
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
DOI :
10.1109/ACC.1995.529388
