Reachability of weakly nonlinear systems using Carleman linearization

08/23/2021
by   Marcelo Forets, et al.
0

In this article we introduce a solution method for a special class of nonlinear initial-value problems using set-based propagation techniques. The novelty of the approach is that we employ a particular embedding (Carleman linearization) to leverage recent advances of high-dimensional reachability solvers for linear ordinary differential equations based on the support function. Using a global error bound for the Carleman linearization abstraction, we are able to describe the full set of behaviors of the system for sets of initial conditions and in dense time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

Simulation-Based Reachability Analysis for High-Index Large Linear Differential Algebraic Equations

Reachability analysis is a fundamental problem for safety verification a...
research
07/13/2022

Reachability Analysis of a General Class of Neural Ordinary Differential Equations

Continuous deep learning models, referred to as Neural Ordinary Differen...
research
05/12/2021

Combining Set Propagation with Finite Element Methods for Time Integration in Transient Solid Mechanics Problems

The Finite Element Method (FEM) is the gold standard for spatial discret...
research
11/05/2022

Geometry of VAS reachability sets

Vector Addition Systems (VAS) or equivalently petri-nets are a popular m...
research
01/13/2021

Neuro-Reachability of Networked Microgrids

A neural ordinary differential equations network (ODE-Net)-enabled reach...
research
02/19/2019

Continuous Ordinary Differential Equations and Infinite Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...
research
02/19/2019

Continuous Ordinary Differential Equations and Ordinal Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...

Please sign up or login with your details

Forgot password? Click here to reset