Optimality and robustness in path-planning under initial uncertainty
From MaRDI portal
Cites work
- \(H^ \infty\)-optimal control and related minimax design problems. A dynamic game approach.
- A fast marching level set method for monotonically advancing fronts.
- A fast sweeping method for Eikonal equations
- A parallel two-scale method for eikonal equations
- A second order discontinuous Galerkin fast sweeping method for eikonal equations
- A third order accurate fast marching method for the eikonal equation in two dimensions
- Adaptive deep learning for high-dimensional Hamilton-Jacobi-Bellman equations
- An efficient algorithm for determining the convex hull of a finite planar set
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
- Another efficient algorithm for convex hulls in two dimensions
- Causal domain restriction for eikonal equations
- Controlled Markov processes and viscosity solutions
- Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games. II: The finite horizon case
- Deterministic control of randomly-terminated processes
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Efficient algorithms for globally optimal trajectories
- Efficient fast marching with Finsler metrics
- Fast Marching Methods
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications
- Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
- Fast two-scale methods for eikonal equations
- scientific article; zbMATH DE number 4205918 (Why is no real title available?)
- scientific article; zbMATH DE number 653075 (Why is no real title available?)
- Lectures on stochastic programming. Modeling and theory
- Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
- Mean Field Games for Modeling Crowd Motion
- Numerical methods for mean field games and mean field type control
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Optimal stopping with a probabilistic constraint
- Ordered line integral methods for computing the quasi-potential
- Ordered line integral methods for solving the eikonal equation
- Ordered upwind methods for static Hamilton–Jacobi equations
- Planning and acting in partially observable stochastic domains
- Riemannian fast-marching on cartesian grids, using Voronoi's first reduction of quadratic forms
- Risk-Sensitive Markov Decision Processes
- Shortest paths without a map
- Some improvements for the fast sweeping method
- Stochastic shortest path problems with recourse
- SympOCnet: Solving Optimal Control Problems with Applications to High-Dimensional Multiagent Path Planning Problems
- Technical Note—Dynamic Programming and Probabilistic Constraints
- Tensor decomposition methods for high-dimensional Hamilton-Jacobi-Bellman equations
- Two approaches to stochastic optimal control problems with a final-time expectation constraint
- Uniformly accurate discontinuous Galerkin fast sweeping methods for eikonal equations
- Viscosity Solutions of Hamilton-Jacobi Equations
This page was built for publication: Optimality and robustness in path-planning under initial uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972725)
