Level Set Methods for Computing Reachable Sets of Hybrid Systems with Differential Algebraic Equation Dynamics

نویسندگان

  • Ian M. Mitchell
  • Yoshihiko Susuki
چکیده

In previous work we demonstrated that reachability algorithms using level set methods and based on the Hamilton-Jacobi PDE can be adapted to systems whose dynamics are described by differential algebraic equations. Here we extend those results to hybrid systems. The only significant addition required is a mechanism for handling the state reset that occurs during discrete jumps between modes. We demonstrate the technique on a nonlinear power system voltage safety problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Uncertain Embedded Systems by Computing Reachable Sets Based on Zonotopes

Formal verification using reachability analysis has been shown to be useful for detecting design failures for controlled embedded systems, and thus to improve dependability. If the state space is hybrid, however, the growth of complexity with the dimension of the continuous dynamics limits the applicability significantly. This paper proposes an efficient approach to computing reachable sets for...

متن کامل

Overapproximating Reachable Sets by Hamilton-Jacobi Projections

In earlier work, we showed that the set of states which can reach a target set of a continuous dynamic game is the zero sublevel set of the viscosity solution of a time dependent Hamilton-Jacobi-Isaacs (HJI) partial differential equation (PDE). We have developed a numerical tool—based on the level set methods of Osher and Sethian— for computing these sets, and we can accurately calculate them f...

متن کامل

Validating a Hamilton-Jacobi Approximation to Hybrid System Reachable Sets

We develop a general framework for solving the hybrid system reachability problem, and indicate how several published techniques fit into this framework. The key unresolved need of any hybrid system reachability algorithm is the computation of continuous reachable sets; consequently, we present new results on techniques for calculating numerical approximations of such sets evolving under genera...

متن کامل

Verified Simulation of ODEs and DAEs in ValEncIA-IVP

ValEncIA-IVP is a verified solver for initial value problems for sets of ordinary differential equations which determines guaranteed enclosures of all reachable states. In this paper, we present its new features which allow for a wider application domain. They also improve the performance of ValEncIA-IVP. Especially for the simulation of asymptotically stable systems, we present a new exponenti...

متن کامل

Hybrid control synthesis for eventuality specifications using level set methods

This paper is concerned with the extraction of controllers for hybrid systems with respect to eventuality specifications. Given a hybrid system modelled by a hybrid automaton and a target set of states, the objective is to compute the maximal set of initial states together with the hybrid control policy such that all the trajectories of the controlled system reach the target in finite time. Due...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008