On discretization methods for approximating optimal paths in regions with direction-dependent costs
From MaRDI portal
Publication:1045920
DOI10.1016/j.ipl.2005.10.007zbMath1178.68615MaRDI QIDQ1045920
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.007
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25: Approximation algorithms
68T40: Artificial intelligence for robotics
Related Items
Approximation algorithms for shortest descending paths in terrains, SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM, Shortest Gently Descending Paths
Cites Work
- Unnamed Item
- Movement planning in the presence of flows
- Determining approximate shortest paths on weighted polyhedral surfaces
- The weighted region problem
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- On finding approximate optimal paths in weighted regions
- Fundamentals of Computation Theory
- Approximating shortest paths on weighted polyhedral surfaces