-
Notifications
You must be signed in to change notification settings - Fork 3
Examples
The exampleReluNN.m example demonstrates how a trained ReLu Neural Network (NN) can be represented as a hybrid zonotope. Given the weights and biases for a NN trained to approximate the function

|
The exampleDoubleIntegrator.m example demonstrates how the explicit feedback control policy for Model Predictive Control (MPC) can be represented as a hybrid zonotope. For a double-integrator system with 2 states, 1 input, state and input constraints, LQR-based terminal constraint, and a prediction horizon of 5 steps, the resulting hybrid zonotope has 80 continuous factors, 18 binary factors, and 60 constraints. A key step in generating this hybrid zonotope is determining bounds on the dual variables of the MPC optimization problem. Computing these bounds is computationally expensive and is a limiting factor in the scalability of this approach. If estimates of these bounds are known, these estimates can be provided to avoid this computational expense. However, if the provided bounds are too small, the resulting hybrid zonotope may not accurately reflect the feasible domain of the original MPC problem. Once these bounds are known, the construction of the hybrid zonotope is performed in mpQPMap using purely algebraic methods including Cartesian productions, halfspace intersections, and projections. |
|
|
The exampleTwoEquilibrium.m example demonstrates how hybrid zonotopes can be used to compute the reachable sets for a discrete-time Piece-Wise Affine (PWA) system using two different approaches. The first approach converts the PWA system into a Mixed Logical Dynamical (MLD) system (using HYSDEL) and then uses the stepMLD function to compute the reachable sets. The second approach uses the notion of state-update sets, where the PWA dynamics mapping the states at time step |
|
The exampleNonlinear.m demonstrates how nonlinear functions, and systems with nonlinear dynamics, can be outer-approximated to conduct closed-loop reachability analysis. In this example, a discrete-time system with 2 states and 1 input is considered, where the dynamics are nonlinear due to a

Note that this example takes roughly 25 minutes to run, but 99% of this time is spent plotting the 15 reachable sets due to the large number of non-empty leaves. All other calculations are performed in around 15 seconds.

