powered by:
MagicWare, s.r.o.

A robust version of the elimination lemma

Author:de Oliveira Mauricio, University of California San Diego, United States
Topic:2.5 Robust Control
Session:Fundamentals of Robust Control
Keywords: Elimination Lemma, Robust Filtering, Robust Control

Abstract

In this paper we extend the elimination lemma to hold for a set ofinequalities. The elimination lemma is a linear algebra result whichhas been successfully used to solve a large number of filtering andcontrol problems. We show that the obtained extension can be used toprovide alternative solutions to robust state feedback control androbust filtering problems when the uncertainty is described by aconvex polytope. We also investigate some conjectures which, if true,would be able to solve an open problem in dynamic output feedbackrobust control. We provide counter-examples to these conjectures.