2026-09-19T06:10:52Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/353072022-01-13T07:54:36Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Munther A. Dahleh and Alexandre Megretski.
Tarraf, Danielle C. (Danielle Charles), 1974-
Massachusetts Institute of Technology. Dept. of Mechanical Engineering.
Massachusetts Institute of Technology. Department of Mechanical Engineering
2007-01-10T15:38:08Z
2007-01-10T15:38:08Z
2006
2006
http://hdl.handle.net/1721.1/35307
76279270
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2006.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 107-115).
Hybrid systems, describing interactions between analog and discrete dynamics, are pervasive in engineered systems and pose unique, challenging performance verification and control synthesis problems. Existing approaches either lead to computationally intensive and sometimes undecidable problems, or make use of highly specialized discrete abstractions with questionable robustness properties. The thesis addresses some of these challenges by developing a systematic, computationally tractable approach for design and certification of systems with discrete, finite-valued actuation and sensing. This approach is inspired by classical robust control, and is based on the use of finite state machines as nominal models of the hybrid systems. The development does not assume a particular algebraic or topological structure on the signal sets. The thesis adopts an input/output view of systems, proposes specific classes of inequality constraints to describe performance objectives, and presents corresponding 'small gain' type arguments for robust performance verification. A notion of approximation that is compatible with the goal of controller synthesis is defined. An approximation architecture that is capable of handling unstable systems is also proposed.
(cont.) Constructive algorithms for generating finite state machine approximations of the hybrid systems of interest, and for efficiently computing a-posteriori bounds on the approximation error are presented. Analysis of finite state machine models, which reduces to searching for an appropriate storage function, is also shown to be related to the problem of checking for the existence of negative cost cycles in a network, thus allowing for a verification algorithm with polynomial worst-case complexity. Synthesis of robust control laws is shown to reduce to solving a discrete, infinite horizon min-max problem. The resulting controllers consist of a finite state machine state observer for the hybrid system and a memoryless full state feedback switching control law. The use of this framework is demonstrated through a simple benchmark example, the problem of stabilizing a double integrator using switched gain feedback and binary sensing. Finally, some extensions to incremental performance objectives and robustness measures are presented.
by Danielle C. Tarraf.
Ph.D.
115 p.
669810 bytes
682404 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Mechanical Engineering.
A finite state machine framework for robust analysis and control of hybrid systems
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a7dadf06-e391-4aad-bc45-266fc83dd2c5">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A finite state machine framework for robust analysis and control of hybrid systems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2006</PublicationDate>
<Authors>
<Author>
<DisplayName>Tarraf, Danielle C. (Danielle Charles), 1974-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mechanical Engineering.</Keyword>
<Abstract>Hybrid systems, describing interactions between analog and discrete dynamics, are pervasive in engineered systems and pose unique, challenging performance verification and control synthesis problems. Existing approaches either lead to computationally intensive and sometimes undecidable problems, or make use of highly specialized discrete abstractions with questionable robustness properties. The thesis addresses some of these challenges by developing a systematic, computationally tractable approach for design and certification of systems with discrete, finite-valued actuation and sensing. This approach is inspired by classical robust control, and is based on the use of finite state machines as nominal models of the hybrid systems. The development does not assume a particular algebraic or topological structure on the signal sets. The thesis adopts an input/output view of systems, proposes specific classes of inequality constraints to describe performance objectives, and presents corresponding 'small gain' type arguments for robust performance verification. A notion of approximation that is compatible with the goal of controller synthesis is defined. An approximation architecture that is capable of handling unstable systems is also proposed.</Abstract>
<Abstract>(cont.) Constructive algorithms for generating finite state machine approximations of the hybrid systems of interest, and for efficiently computing a-posteriori bounds on the approximation error are presented. Analysis of finite state machine models, which reduces to searching for an appropriate storage function, is also shown to be related to the problem of checking for the existence of negative cost cycles in a network, thus allowing for a verification algorithm with polynomial worst-case complexity. Synthesis of robust control laws is shown to reduce to solving a discrete, infinite horizon min-max problem. The resulting controllers consist of a finite state machine state observer for the hybrid system and a memoryless full state feedback switching control law. The use of this framework is demonstrated through a simple benchmark example, the problem of stabilizing a double integrator using switched gain feedback and binary sensing. Finally, some extensions to incremental performance objectives and robustness measures are presented.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>