1 / 18

Computing Reachable Sets via Toolbox of Level Set Methods

Computing Reachable Sets via Toolbox of Level Set Methods. Mo Chen mochen72@berkeley.edu Slides adapted from Michael Vitus and Jerry Ding. Toolbox of Level Set Methods. Ian Mitchell Professor at the University of British Columbia http://www.cs.ubc.ca/~mitchell/ MatLab Toolbox

demont
Download Presentation

Computing Reachable Sets via Toolbox of Level Set Methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Computing Reachable Sets via Toolbox of Level Set Methods Mo Chen mochen72@berkeley.edu Slides adapted from Michael Vitus and Jerry Ding

  2. Toolbox of Level Set Methods • Ian Mitchell • Professor at the University of British Columbia • http://www.cs.ubc.ca/~mitchell/ • MatLab Toolbox • http://www.cs.ubc.ca/~mitchell/ToolboxLS/index.html • Computes the backwards reachable set starting from some final target set • Fixed spacing Cartesian grid • Up to 4 or 5 dimensions

  3. Backwards Reachability [Mitchell, 2005]

  4. Problem Formulation • Dynamics: • System input: • Disturbance: • Target set: • Final conditions • Level set representation: • Eg. 2D unit disk centered at the origin:

  5. Backwards Reachable Set • Solution to a Hamilton-Jacobi PDE: where: • For theory, see lecture 8 notes • Terminal value HJ PDE • Converted to an initial value PDE by multiplying the Hamiltonian by

  6. Toolbox Formulation • Provide 3 items • Final target set • Hamiltonian function (multiplied by -1) • An upper bound on the partials functions

  7. Example: Double Integrator • Dynamics • Target set • Outside of the box • Coding: • Mostly setting up the environment in the toolbox

  8. Example: Double Integrator • Start from Examples\Reachability\air3D.m

  9. Example: Grid and Target Set • Set-up grid and target set • g.bdry: @addGhostExtrapolateusually • g.bdry: @addGhostPeriodicfor periodic dimensions

  10. Example: Double Integrator • Target set: define own function OR use pre-existing functions such as shapeCylinder, shapeRectangleByCorners • See Section 3.3 of toolbox manual

  11. Hamiltonian and Partial Functions • Hamiltonian:

  12. Hamiltonian and Partial Function • Partials:

  13. Hamiltonian and Partial Function • Set-up Hamiltonian • is written as deriv{i} • is written asgrid.xs{i}

  14. Example: Double Integrator • Set up partials function

  15. Results

  16. Additional Comments • Hamiltonian overestimated  reachable set underestimated • Partials function (Pages 50-51 of Toolbox manual) • Underestimation  numerical instability • Overestimation rounded corners or worst case underestimation of reachable set • Computation • The solver grids the state space • Tractable only up to 4-5 continuous states • Advanced: Can also define avoid sets • Toolbox • Coding: ~90% is setting up the environment

  17. Useful Dynamical Form for Partial Function • Pages 50-51 of Toolbox manual • Nonlinear system, linear input • Input constraints are hyperrectangles • Analytical optimal inputs: • Partials upper bound:

  18. Other Tools • Plotting utilities • Kernel\Helper\Visualization • visualizeLevelSet.m • spinAnimation.m • Initial condition helpers • Cylinders, hyperrectangles • Advice • Start with a small example • Look over air3D.m along with Section 2.6.1 of toolbox manual

More Related