Affiliation:
1. University of North Carolina at Chapel Hill
Abstract
Reachable set computation is one of the primary techniques for safety verification of linear dynamical systems. In reality the underlying dynamics have uncertainties like parameter variations or modeling uncertainties. Therefore, the reachable set computation must consider the uncertainties in the dynamics to be useful
i.e
. the computed reachable set should be over or under approximation if not exact. This paper presents a technique to compute reachable set of linear dynamical systems with uncertainties. First, we introduce a construct called support of a matrix. Using this construct, we present a set of sufficient conditions for which reachable set for uncertain linear system can be computed efficiently; and safety verification can be performed using bi-linear programming. Finally, given a linear dynamical system, we compute robust reachable set, which accounts for all possible uncertainties that can be handled by the sufficient conditions presented. Experimental evaluation on benchmarks reveal that our algorithm is computationally very efficient.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference27 articles.
1. Reachability analysis of linear systems with uncertain parameters and inputs
2. Reachability analysis of nonlinear systems with uncertain parameters using conservative linearization
3. Hongxu Chen Sayan Mitra and Guangyu Tian. 2014. Motor-transmission drive system: A benchmark example for safety verification. In ARCH@CPSWeek. 9--18. Hongxu Chen Sayan Mitra and Guangyu Tian. 2014. Motor-transmission drive system: A benchmark example for safety verification. In ARCH@CPSWeek. 9--18.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献