Cited in
(11)- Movement planning in the presence of flows
- Approximate Shortest Paths in Polygons with Violations
- Pseudo approximation algorithms with applications to optimal motion planning
- Adaptive and compact discretization for weighted region optimal path finding.
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Approximation algorithms for shortest descending paths in terrains
- An experimental study of weighted \(k\)-link shortest path algorithms
- Shortest Gently Descending Paths
- On finding approximate optimal paths in weighted regions
- Determining approximate shortest paths on weighted polyhedral surfaces
- Fundamentals of Computation Theory
This page was built for software: BUSHWHACK
