Abstract | ||
---|---|---|
We propose an algorithm to over-approximate the reachable set of nonlinear systems with bounded, time-varying parameters and uncertain initial conditions. The algorithm is based on the conservative representation of the nonlinear dynamics by a differential inclusion consisting of a linear term and the Minkowsky sum of two convex sets. The linear term and one of the two sets are obtained by a conservative first-order over-approximation of the nonlinear dynamics with respect to the system state. The second set accounts for the effect of the time-varying parameters. A distinctive feature of the novel algorithm is the possibility to over-approximate the reachable set to any desired accuracy by appropriately choosing the parameters in the computation. We provide an example that illustrates the effectiveness of our approach.
|
Year | DOI | Venue |
---|---|---|
2018 | 10.1145/3178126.3178127 | HSCC |
Keywords | Field | DocType |
Reachability analysis, nonlinear systems, time-varying parameters, differential inclusions, attainable set computation, convergence | Differential inclusion,Convergence (routing),Applied mathematics,Nonlinear system,Computer science,Regular polygon,Reachability,Distinctive feature,Computation,Bounded function | Conference |
ISBN | Citations | PageRank |
978-1-4503-5642-8 | 0 | 0.34 |
References | Authors | |
27 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Matthias Rungger | 1 | 105 | 13.44 |
Majid Zamani | 2 | 245 | 19.41 |