CaltechAUTHORS
  A Caltech Library Service

Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems

Ozay, Necmiye and Liu, Jun and Prabhakar, Pavithra and Murray, Richard M. (2013) Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems. In: 2013 American Control Conference (ACC). IEEE , Piscataway, NJ, pp. 6237-6244. ISBN 978-1-4799-0177-7. https://resolver.caltech.edu/CaltechAUTHORS:20131219-094019593

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20131219-094019593

Abstract

This work is motivated by the problem of synthesizing mode sequences for continuous-time polynomial switched systems in order to guarantee that the trajectories of the system satisfy certain high-level specifications expressed in linear temporal logic. We use augmented finite transition systems as abstract models of continuous switched systems. Augmented finite transition systems are equipped with liveness properties that can be used to enforce progress in accordance with the underlying dynamics. We then introduce abstraction and refinement relations that induce a preorder on this class of finite transition systems. By construction, the resulting preorder respects the feasibility (i.e., realizability) of the synthesis problem. Hence, existence of a discrete switching strategy for one of these abstract finite transition systems guarantees the existence of a mode sequence for the continuous system such that all of its trajectories satisfy the specification. We also present an algorithm, which can be implemented using sum-of-squares based relaxations, to compute such high fidelity abstract models in a computationally tractable way. Finally, these ideas are illustrated on an example.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6580816&isnumber=6579790PublisherArticle
ORCID:
AuthorORCID
Murray, Richard M.0000-0002-5785-7481
Additional Information:© 2013 AACC. This work was supported in part by IBM and UTC through iCyPhy Consortium, the FCRP consortium through MuSyC and a Caltech Center for the Mathematics of Information Fellowship.
Funders:
Funding AgencyGrant Number
IBMUNSPECIFIED
UTCUNSPECIFIED
iCyPhy ConsortiumUNSPECIFIED
FCRP Consortium Multiscale Systems Center (MuSyC)UNSPECIFIED
Caltech Center for the Mathematics of InformationUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number13794118
Record Number:CaltechAUTHORS:20131219-094019593
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20131219-094019593
Official Citation:Ozay, N.; Jun Liu; Prabhakar, P.; Murray, R.M., "Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems," American Control Conference (ACC), 2013 , vol., no., pp.6237,6244, 17-19 June 2013 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6580816&isnumber=6579790
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:43085
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:23 Dec 2013 20:00
Last Modified:03 Oct 2019 06:04

Repository Staff Only: item control page