Fastest-path planning for direction-dependent speed functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- An Introduction to the Geometry of Numbers
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An efficient algorithm for determining the convex hull of a finite planar set
- Approximate Shortest Paths in Anisotropic Regions
- Deterministic Minimal Time Vessel Routing
- Fermat's principle, Huygens' principle, Hamilton's optics and sailing strategy
- Introduction to algorithms
- Movement planning in the presence of flows
- On Some Distance Problems in Fixed Orientations
- On finding approximate optimal paths in weighted regions
- Optimal path finding in direction, location, and time dependent environments
- Stochastic optimization and yacht racing
- The weighted region problem
- Visibility graphs and obstacle-avoiding shortest paths
- Yacht velocity prediction using mathematical programming
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(5)- Directing the Search in the Fast Forward Planning
- Quickest paths in anisotropic media
- scientific article; zbMATH DE number 5488832 (Why is no real title available?)
- A covering projection for robot navigation under strong anisotropy
- Optimal path finding in direction, location, and time dependent environments
This page was built for publication: Fastest-path planning for direction-dependent speed functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368729)
