On finding approximate optimal paths in weighted regions
From MaRDI portal
Publication:5468868
DOI10.1016/j.jalgor.2004.07.004zbMath1103.68144OpenAlexW2112346596MaRDI QIDQ5468868
Publication date: 28 April 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.07.004
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Related Items
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM, An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures, Navigating Weighted Regions with Scattered Skinny Tetrahedra, An approximation algorithm for computing shortest paths in weighted 3-d domains, Fastest-path planning for direction-dependent speed functions, Algorithms for approximate shortest path queries on weighted polyhedral surfaces, Path planning in a weighted planar subdivision under the Manhattan metric, Approximating generalized distance functions on weighted triangulated surfaces with applications, A survey of geodesic paths on 3D surfaces, Pasting gauges. I: Shortest paths across a hyperplane, GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST, APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS, FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS, Line facility location in weighted regions, Approximation algorithms for shortest descending paths in terrains, Shortest Gently Descending Paths, A COVERING PROJECTION FOR ROBOT NAVIGATION UNDER STRONG ANISOTROPY, Path refinement in weighted regions, Line Segment Facility Location in Weighted Subdivisions, On discretization methods for approximating optimal paths in regions with direction-dependent costs
Uses Software
