ME 561 - Convex Methods in Control

Spring 2020

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Convex Methods in ControlME561B52251LCD41000 - 1150 M W  1214 Siebel Center for Comp Sci Geir E Dullerud

Official Description

Use of convex optimization in analysis and control of dynamical systems; robust control methods and the use of semidefinite programming; linear matrix inequalities, operator theory, model reduction, H-2 and H-infinity optimal control, S-procedure and integral quadratic constraints, structured singular value and mu-synthesis, and Markovian jump systems; applications in control design. Course Information: Prerequisite: ECE 515.

Detailed Course Description

Use of convex optimization in analysis and control of dynamical systems; robust control methods and the use of semidefinite programming; linear matrix inequalities, operator theory, model reduction, H-2 and H-infinity optimal control, S-procedure and integral quadratic constraints, structured singular value and mu-synthesis, and Markovian jump systems; applications in control design. Prerequisite: ECE 515.

TEXTBOOK: Dullerud, G. E. and F. Paganini, A Course in Robust Control Theory: A Convex Approach, 2000, New York: Springer-Verlag.

TOPICS:

1. Introduction

2. Semidefinite programming and sum-of-squares

3. Gramians and balanced realizations

4. Model reduction

5. Stabilization theory

6. H2 synthesis

7. H-infinity synthesis

8. Decentralized and distributed control theory

Last updated

9/25/2018