Login

Robust stability and contraction analysis of nonlinear systems via semidefinite optimization

Show simple item record

dc.contributor.advisor Pablo A. Parrilo. en_US
dc.contributor.author Aylward, Erin M en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US
dc.date.accessioned 2007-07-17T19:40:57Z
dc.date.available 2007-07-17T19:40:57Z
dc.date.copyright 2006 en_US
dc.date.issued 2006 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/37850
dc.description Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. en_US
dc.description This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. en_US
dc.description Includes bibliographical references (p. 107-110). en_US
dc.description.abstract A wide variety of stability and performance problems for linear and certain classes of nonlinear dynamical systems can be formulated as convex optimization problems involving linear matrix inequalities (LMIs). These formulations can be solved numerically with computationally-effcient interior-point methods. Many of the first LMI-based stability formulations applied to linear systems and the class of nonlinear systems representable as an interconnection of a linear system with bounded uncertainty blocks. Recently, stability and performance analyses of more general nonlinear deterministic systems, namely those with polynomial or rational dynamics, have been converted into an LMI framework using sum of squares (SOS) programming. SOS programming combines elements of computational algebra and convex optimization to provide e±cient convex relaxations for various computationally-hard problems. In this thesis we extend the class of systems that can be analyzed with LMI-based methods. en_US
dc.description.abstract (cont.) We show how to analyze the robust stability properties of uncertain non-linear systems with polynomial or rational dynamics, as well as a class of systems with external inputs, via contraction analysis and SOS programming. Specifically, we show how contraction analysis, a stability theory for nonlinear dynamical systems in which stability is designed incrementally between two arbitrary trajectories via a contraction metric, provides a useful framework for analyzing the stability of uncertain systems. Then, using SOS programming we develop an algorithmic method to search for contraction metrics for these systems. The search process is made computationally tractable by relaxing matrix deniteness constraints, the feasibility of which indicates the existence of a contraction metric, to SOS constraints on polynomial matrices. We illustrate our results through examples from the literature and show how our contraction-based approach offers advantages when compared with traditional Lyapunov analysis. en_US
dc.description.provenance Made available in DSpace on 2007-07-17T19:40:57Z (GMT). No. of bitstreams: 2 143987212.pdf: 703111 bytes, checksum: 6f880f407863ea1ca9d3bbd4e8776eef (MD5) 143987212-MIT.pdf: 675953 bytes, checksum: 3ddf40fbfbc9b6967bba6d3aa91225c1 (MD5) Previous issue date: 2006 en
dc.description.statementofresponsibility by Erin M. Aylward. en_US
dc.format.extent 110 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582
dc.subject Electrical Engineering and Computer Science. en_US
dc.title Robust stability and contraction analysis of nonlinear systems via semidefinite optimization en_US
dc.type Thesis en_US
dc.description.degree S.M. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US
dc.identifier.oclc 143987212 en_US

Files in this item

Files Size Format
Preview, non-printable (open to all) 703.1Kb application/pdf
Full printable version (MIT only) 675.9Kb application/pdf

This item appears in the following Collection(s)

Show simple item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links