Tight Continuous-Time Reachtubes for Lagrangian Reachability

We introduce continuous Lagrangian reachability (CLRT), a new algorithm for the computation of a tight and continuous-time reachtube for the solution flows of a nonlinear, time-variant dynamical system. CLRT employs finite strain theory to determine the deformation of the solution set from time $t_{i}$ to time $t_{i+1}$. We have developed simple explicit analytic formulas for the optimal metric for this deformation; this is superior to prior work, which used semi-definite programming. CLRT also uses infinitesimal strain theory to derive an optimal time increment $h_{i}$ between $t_{i}$ and $t_{i+1}$, nonlinear optimization to minimally bloat (i.e., using a minimal radius) the state set at time $t_{i}$ such that it includes all the states of the solution flow in the interval $[t_{i},\ t_{i+1}]$. We use $\delta$ -satisfiability to ensure the correctness of the bloating. Our results on a series of benchmarks show that CLRT performs favorably compared to state-of-the-art tools such as CAPD in terms of the continuous reachtube volumes they compute.

[1]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[2]  Xin Chen,et al.  Taylor Model Flowpipe Construction for Non-linear Hybrid Systems , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[3]  N. Nedialkov,et al.  Interval Tools for ODEs and DAEs , 2006, 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006).

[4]  Chuchu Fan,et al.  Bounded Verification with On-the-Fly Discrepancy Computation , 2015, ATVA.

[5]  Raymond T. Pierrehumbert,et al.  Large-scale horizontal mixing in planetary atmospheres , 1991 .

[6]  Matthias Althoff,et al.  An Introduction to CORA 2015 , 2015, ARCH@CPSWeek.

[7]  Radu Grosu,et al.  Lagrangian Reachabililty , 2017, CAV.

[8]  Julien Alexandre Dit Sandretto,et al.  Validated Explicit and Implicit Runge-Kutta Methods , 2016 .

[9]  John N. Maidens,et al.  Reachability Analysis of Nonlinear Systems Using Matrix Measures , 2015, IEEE Transactions on Automatic Control.

[10]  Edmund M. Clarke,et al.  δ-Complete Decision Procedures for Satisfiability over the Reals , 2012, IJCAR.

[11]  Mo Chen,et al.  Hamilton-Jacobi reachability: A brief overview and recent advances , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[12]  Martin Berz,et al.  Rigorous integration of flows and ODEs using taylor models , 2009, SNC '09.

[13]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

[14]  Ian M. Mitchell,et al.  Overapproximating Reachable Sets by Hamilton-Jacobi Projections , 2003, J. Sci. Comput..

[15]  Martin Berz,et al.  Verified Integration of ODEs and Flows Using Differential Algebraic Methods on High-Order Taylor Models , 1998, Reliab. Comput..

[16]  J. Achenbach THE LINEARIZED THEORY OF ELASTICITY , 1973 .

[17]  Milan Hladík,et al.  Bounds on Real Eigenvalues and Singular Values of Interval Matrices , 2010, SIAM J. Matrix Anal. Appl..

[18]  D. Wilczak,et al.  Cr-Lohner algorithm , 2011 .

[19]  Martin Berz,et al.  COSY INFINITY Version 9 , 2006 .

[20]  Oded Maler,et al.  Systematic Simulation Using Sensitivity Analysis , 2007, HSCC.

[21]  S. Rump Computational error bounds for multiple or nearly multiple eigenvalues , 2001 .

[22]  James Kapinski,et al.  Locally optimal reach set over-approximation for nonlinear systems , 2016, 2016 International Conference on Embedded Software (EMSOFT).

[23]  J. Rohn Bounds on Eigenvalues of Interval Matrices , 1998 .