A robust method for fast exploration of environments with moving obstacles
From MaRDI portal
Cites work
- A fast marching level set method for monotonically advancing fronts.
- A fast sweeping method for Eikonal equations
- A note on two problems in connexion with graphs
- A parallel two-scale method for eikonal equations
- An adaptive domain-decomposition technique for parallelization of the fast marching method
- Compact internal representation of dynamic situations: neural network implementing the causality principle
- Complementarity problems
- Efficient algorithms for globally optimal trajectories
- Fast Marching Methods
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Fast Sweeping Methods for Eikonal Equations on Triangular Meshes
- scientific article; zbMATH DE number 653075 (Why is no real title available?)
- scientific article; zbMATH DE number 976936 (Why is no real title available?)
- scientific article; zbMATH DE number 2238781 (Why is no real title available?)
- Limb movement in dynamic situations based on generalized cognitive maps
- On the complexity of time-dependent shortest paths
- Prediction-for-CompAction: navigation in social environments using generalized cognitive maps
- Static PDEs for time-dependent control problems
- Viscosity Solutions of Hamilton-Jacobi Equations
This page was built for publication: A robust method for fast exploration of environments with moving obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6853388)