From Bellman to Dijkstra: set-oriented construction of globally optimal controllers
From MaRDI portal
Publication:5131684
Recommendations
Cites work
- A fast marching level set method for monotonically advancing fronts.
- A note on two problems in connexion with graphs
- A set oriented approach to global optimal control
- A set oriented approach to optimal feedback stabilization
- A subdivision algorithm for the computation of unstable manifolds and global attractors
- Efficient algorithms for globally optimal trajectories
- Global optimal control of perturbed systems
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1552394 (Why is no real title available?)
- scientific article; zbMATH DE number 1779223 (Why is no real title available?)
- Optimization-Based Stabilization of Sampled-Data Nonlinear Systems via Their Approximate Discrete-Time Models
- Ordered upwind methods for static Hamilton–Jacobi equations
- Relaxing Dynamic Programming
- The convergence problem for differential games
- To Sample or not to Sample: Self-Triggered Control for Nonlinear Systems
- Validated numerics. A short introduction to rigorous computations.
This page was built for publication: From Bellman to Dijkstra: set-oriented construction of globally optimal controllers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131684)