CaltechAUTHORS
  A Caltech Library Service

Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts

Chen, Yuxiao and Anderson, James and Kalsi, Karan and Low, Steven H. and Ames, Aaron D. (2019) Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts. In: 2019 American Control Conference (ACC). IEEE , Piscataway, NJ, pp. 1027-1034. ISBN 978-1-5386-7926-5. https://resolver.caltech.edu/CaltechAUTHORS:20190201-135605069

[img] PDF - Submitted Version
See Usage Policy.

1190Kb

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

Abstract

This paper presents an assume-guarantee reasoning approach to the computation of robust invariant sets for network systems. Parameterized signal temporal logic (pSTL) is used to formally describe the behaviors of the subsystems, which we use as the template for the contract. We show that set invariance can be proved with a valid assume-guarantee contract by reasoning about individual subsystems. If a valid assume-guarantee contract with monotonic pSTL template is known, it can be further refined by value iteration. When such a contract is not known, an epigraph method is proposed to solve for a contract that is valid, -an approach that has linear complexity for a sparse network. A microgrid example is used to demonstrate the proposed method. The simulation result shows that together with control barrier functions, the states of all the subsystems can be bounded inside the individual robust invariant sets.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://ieeexplore.ieee.org/document/8814437PublisherArticle
https://arxiv.org/abs/1810.10636arXivDiscussion Paper
ORCID:
AuthorORCID
Anderson, James0000-0002-2832-8396
Low, Steven H.0000-0001-6476-3048
Ames, Aaron D.0000-0003-0848-3177
Additional Information:© 2019 AACC. This work is supported by the Battelle Memorial Institute, Pacific Northwest Division, Grant #424858.
Funders:
Funding AgencyGrant Number
Battelle Memorial Institute424858
Record Number:CaltechAUTHORS:20190201-135605069
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190201-135605069
Official Citation:Y. Chen, J. Anderson, K. Kalsi, S. H. Low and A. D. Ames, "Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts," 2019 American Control Conference (ACC), Philadelphia, PA, USA, 2019, pp. 1027-1034. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8814437&isnumber=8814292
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92573
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:01 Feb 2019 22:53
Last Modified:03 Oct 2019 20:46

Repository Staff Only: item control page