Robust observer design via the GKYP lemma
Robust observer design via the GKYP lemma
This paper considers the robust observer design problem for linear time-invariant dynamic systems subject to external disturbances. In this paper, robustness against disturbances is considered within a finite frequency range, instead of the standard infinite frequency range solution; this is achieved via the well established Generalized Kalman-Yakubovich-Popov (GKYP) results. In order to obtain a convex optimization problem, Finsler's Lemma is used to pose the GKYP Lemma as minimization problem in the form of a Linear Matrix Inequality which represents a finite range version of the Bounded Real Lemma. In contrast to other GKYP LMI formulations, the results presented in this work may be considered more conservative, but may be argued to be more simple and tractable than existing formulations. The effectiveness of the proposed procedure is shown through a simulation example.
900-905
Herrera, David
8c26850d-9306-4571-88f2-223dfc106a95
Sofrony, Jorge
20f54d8e-0d5f-4a8a-be1e-61f4052f30ff
Turner, Matthew C.
6befa01e-0045-4806-9c91-a107c53acba0
2015
Herrera, David
8c26850d-9306-4571-88f2-223dfc106a95
Sofrony, Jorge
20f54d8e-0d5f-4a8a-be1e-61f4052f30ff
Turner, Matthew C.
6befa01e-0045-4806-9c91-a107c53acba0
Herrera, David, Sofrony, Jorge and Turner, Matthew C.
(2015)
Robust observer design via the GKYP lemma.
In ACC 2015 - 2015 American Control Conference.
vol. 2015-July,
IEEE.
.
(doi:10.1109/ACC.2015.7170848).
Record type:
Conference or Workshop Item
(Paper)
Abstract
This paper considers the robust observer design problem for linear time-invariant dynamic systems subject to external disturbances. In this paper, robustness against disturbances is considered within a finite frequency range, instead of the standard infinite frequency range solution; this is achieved via the well established Generalized Kalman-Yakubovich-Popov (GKYP) results. In order to obtain a convex optimization problem, Finsler's Lemma is used to pose the GKYP Lemma as minimization problem in the form of a Linear Matrix Inequality which represents a finite range version of the Bounded Real Lemma. In contrast to other GKYP LMI formulations, the results presented in this work may be considered more conservative, but may be argued to be more simple and tractable than existing formulations. The effectiveness of the proposed procedure is shown through a simulation example.
This record has no associated files available for download.
More information
Published date: 2015
Venue - Dates:
2015 American Control Conference, ACC 2015, , Chicago, United States, 2015-07-01 - 2015-07-03
Identifiers
Local EPrints ID: 439222
URI: http://eprints.soton.ac.uk/id/eprint/439222
PURE UUID: 00161010-4cb4-425a-bd1b-cb1c36e1b63f
Catalogue record
Date deposited: 07 Apr 2020 16:30
Last modified: 16 Mar 2024 06:55
Export record
Altmetrics
Contributors
Author:
David Herrera
Author:
Jorge Sofrony
Author:
Matthew C. Turner
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics