Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control最新文献_第3页

Decoding Output Sequences for Discrete-Time Linear Hybrid Systems. 离散时间线性混合系统的解码输出序列。

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-05-04 DOI: 10.1145/3501710.3519530

M. Narasimhamurthy, S. Sankaranarayanan

{"title":"Decoding Output Sequences for Discrete-Time Linear Hybrid Systems.","authors":"M. Narasimhamurthy, S. Sankaranarayanan","doi":"10.1145/3501710.3519530","DOIUrl":"https://doi.org/10.1145/3501710.3519530","url":null,"abstract":"In this paper, we study the “decoding” problem for discrete-time, stochastic hybrid systems with linear dynamics in each mode. Given an output trace of the system, the decoding problem seeks to construct a sequence of modes and states that yield a trace “as close as possible” to the original output trace. The decoding problem generalizes the state estimation problem, and is applicable to hybrid systems with non-determinism. The decoding problem is NP-complete, and can be reduced to solving a mixed-integer linear program (MILP). In this paper, we decompose the decoding problem into two parts: (a) finding a sequence of discrete modes and transitions; and (b) finding corresponding continuous states for the mode/transition sequence. In particular, once a sequence of modes/transitions is fixed, the problem of “filling in” the continuous states is performed by a linear programming problem. In order to support the decomposition, we “cover” the set of all possible mode/transition sequences by a finite subset. We use well-known probabilistic arguments to justify a choice of cover with high confidence and design randomized algorithms for finding such covers. Our approach is demonstrated on a series of benchmarks, wherein we observe that relatively tiny fraction of the possible mode/transition sequences can be used as a cover. Furthermore, we show that the resulting linear programs can be solved rapidly by exploiting the tree structure of the set cover.","PeriodicalId":194680,"journal":{"name":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127684559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Verification of machine learning based cyber-physical systems: a comparative study 基于网络物理系统的机器学习验证:比较研究

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-05-04 DOI: 10.1145/3501710.3519540

Arthur Clavière, Laura Altieri Sambartolomé, E. Asselin, C. Garion, C. Pagetti

引用次数: 0

SOCKS: A Stochastic Optimal Control and Reachability Toolbox Using Kernel Methods SOCKS:一个使用核方法的随机最优控制和可达性工具箱

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-03-12 DOI: 10.1145/3501710.3519525

Adam J. Thorpe, Meeko Oishi

{"title":"SOCKS: A Stochastic Optimal Control and Reachability Toolbox Using Kernel Methods","authors":"Adam J. Thorpe, Meeko Oishi","doi":"10.1145/3501710.3519525","DOIUrl":"https://doi.org/10.1145/3501710.3519525","url":null,"abstract":"We present SOCKS, a data-driven stochastic optimal control toolbox based in kernel methods. SOCKS is a collection of data-driven algorithms that compute approximate solutions to stochastic optimal control problems with arbitrary cost and constraint functions, including stochastic reachability, which seeks to determine the likelihood that a system will reach a desired target set while respecting a set of pre-defined safety constraints. Our approach relies upon a class of machine learning algorithms based in kernel methods, a nonparametric technique which can be used to represent probability distributions in a high-dimensional space of functions known as a reproducing kernel Hilbert space. As a nonparametric technique, kernel methods are inherently data-driven, meaning that they do not place prior assumptions on the system dynamics or the structure of the uncertainty. This makes the toolbox amenable to a wide variety of systems, including those with nonlinear dynamics, black-box elements, and poorly characterized stochastic disturbances. We present the main features of SOCKS and demonstrate its capabilities on several benchmarks.","PeriodicalId":194680,"journal":{"name":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129157668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence 一个更简单的选择:最小化过渡系统模交替模拟等价

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-03-03 DOI: 10.1145/3501710.3519534

G. D. Gleizer, Khushraj Madnani, M. Mazo

引用次数: 0

ETCetera: beyond Event-Triggered Control 等等:超越事件触发控制

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-03-03 DOI: 10.1145/3501710.3519523

Giannis Delimpaltadakis, G. D. Gleizer, Ico M. Van Straalen, M. Mazo

引用次数: 3

Elliptical Slice Sampling for Probabilistic Verification of Stochastic Systems with Signal Temporal Logic Specifications 具有信号时序逻辑规范的随机系统的概率验证椭圆切片抽样

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-02-28 DOI: 10.1145/3501710.3519506

Guy Scher, Sadra Sadraddini, Russ Tedrake, H. Kress-Gazit

引用次数: 3

Temporal Robustness of Stochastic Signals 随机信号的时间鲁棒性

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2022-02-05 DOI: 10.1145/3501710.3519504

Lars Lindemann, Alena Rodionova, George J. Pappas

{"title":"Temporal Robustness of Stochastic Signals","authors":"Lars Lindemann, Alena Rodionova, George J. Pappas","doi":"10.1145/3501710.3519504","DOIUrl":"https://doi.org/10.1145/3501710.3519504","url":null,"abstract":"We study the temporal robustness of stochastic signals. This topic is of particular interest in interleaving processes such as multi-agent systems where communication and individual agents induce timing uncertainty. For a deterministic signal and a given specification, we first introduce the synchronous and the asynchronous temporal robustness to quantify the signal’s robustness with respect to synchronous and asynchronous time shifts in its sub-signals. We then define the temporal robustness risk by investigating the temporal robustness of the realizations of a stochastic signal. This definition can be interpreted as the risk associated with a stochastic signal to not satisfy a specification robustly in time. In this definition, general forms of specifications such as signal temporal logic specifications are permitted. We show how the temporal robustness risk is estimated from data for the value-at-risk. The usefulness of the temporal robustness risk is underlined by both theoretical and empirical evidence. In particular, we provide various numerical case studies including a T-intersection scenario in autonomous driving.","PeriodicalId":194680,"journal":{"name":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128662799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks Fast BATLLNN:两级晶格神经网络的快速盒分析

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2021-11-17 DOI: 10.1145/3501710.3519533

James Ferlez, Haitham Khedr, Yasser Shoukry

引用次数: 8

Verifying Switched System Stability With Logic 用逻辑验证交换系统的稳定性

Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2021-11-02 DOI: 10.1145/3501710.3519541

Yong Kiam Tan, Stefan Mitsch, André Platzer

{"title":"Verifying Switched System Stability With Logic","authors":"Yong Kiam Tan, Stefan Mitsch, André Platzer","doi":"10.1145/3501710.3519541","DOIUrl":"https://doi.org/10.1145/3501710.3519541","url":null,"abstract":"Switched systems are known to exhibit subtle (in)stability behaviors requiring system designers to carefully analyze the stability of closed-loop systems that arise from their proposed switching control laws. This paper presents a formal approach for verifying switched system stability that blends classical ideas from the controls and verification literature using differential dynamic logic (dL), a logic for deductive verification of hybrid systems. From controls, we use standard stability notions for various classes of switching mechanisms and their corresponding Lyapunov function-based analysis techniques. From verification, we use dL’s ability to verify quantified properties of hybrid systems and dL models of switched systems as looping hybrid programs whose stability can be formally specified and proven by finding appropriate loop invariants, i.e., properties that are preserved across each loop iteration. This blend of ideas enables a trustworthy implementation of switched system stability verification in the KeYmaera X prover based on dL. For standard classes of switching mechanisms, the implementation provides fully automated stability proofs, including searching for suitable Lyapunov functions. Moreover, the generality of the deductive approach also enables verification of switching control laws that require non-standard stability arguments through the design of loop invariants that suitably express specific intuitions behind those control laws. This flexibility is demonstrated on three case studies: a model for longitudinal flight control by Branicky, an automatic cruise controller, and Brockett’s nonholonomic integrator.","PeriodicalId":194680,"journal":{"name":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0