On discretization methods for approximating optimal paths in regions with direction-dependent costs

DOI10.1016/j.ipl.2005.10.007zbMath1178.68615OpenAlexW2048876543MaRDI QIDQ1045920

Zheng Sun, Tian-Ming Bu

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

zbMATH Keywords

optimizationcomputational geometryapproximation algorithmsrobotic path planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (3)

SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ 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

This page was built for publication: On discretization methods for approximating optimal paths in regions with direction-dependent costs