Ensuring Safety of Nonlinear Sampled Data Systems through Reachability (Extended Version)

In sampled data systems the controller receives periodically sampled state feedback about the evolution of a continuous time plant, and must choose a constant control signal to apply between these updates; however, unlike purely discrete time models the evolution of the plant between updates is important. In contrast, for systems with nonlinear dynamics existing reachability algorithms|based on Hamilton-Jacobi equations or viability theory|assume continuous time state feedback and the ability to instantaneously adjust the input signal. In this paper we describe an algorithm for determining an implicit surface representation of minimal backwards reach tubes for nonlinear sampled data systems, and then construct switched, set-valued feedback controllers which are permissive but ensure safety for such systems. The reachability algorithm is adapted from the Hamilton-Jacobi formulation proposed in Ding and Tomlin (2010). We show that this formulation is conservative for sampled data systems. We implement the algorithm using approximation schemes from level set methods, and demonstrate it on a modied double integrator.

[1]  P. Saint-Pierre,et al.  Set-Valued Numerical Analysis for Optimal Control and Differential Games , 1999 .

[2]  John Lygeros,et al.  Controllers for reachability specifications for hybrid systems , 1999, Autom..

[3]  M. Branicky,et al.  Solving hybrid control problems: level sets and behavioral programming , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[4]  Joshua A. Levine,et al.  Sampling-based planning, control and verification of hybrid systems , 2000 .

[5]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Hybrid Control , 2002, HSCC.

[6]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[7]  John Lygeros,et al.  On reachability and minimum cost optimal control , 2004, Autom..

[8]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[9]  Ian M. Mitchell,et al.  A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems , 2005, HSCC.

[10]  A. Vladimirsky Static PDEs for time-dependent control problems , 2006 .

[11]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[12]  Lydia E. Kavraki,et al.  Hybrid Systems: From Verification to Falsification , 2007, CAV.

[13]  Ian M. Mitchell Comparing Forward and Backward Reachability as Tools for Safety Analysis , 2007, HSCC.

[14]  Edmund M. Clarke,et al.  The Birth of Model Checking , 2008, 25 Years of Model Checking.

[15]  Lydia E. Kavraki,et al.  Hybrid systems: from verification to falsification by combining motion planning and discrete search , 2007, CAV.

[16]  Claire J. Tomlin,et al.  Robust reach-avoid controller synthesis for switched nonlinear systems , 2010, 49th IEEE Conference on Decision and Control (CDC).

[17]  Jean-Pierre Aubin,et al.  Viability Theory: New Directions , 2011 .