Adaptive and compact discretization for weighted region optimal path finding.

DOI10.1007/B11926MaRDI QIDQ5900802zbMATH OpenOpenAlexFDO

Authors Zheng Sun, J. Reif

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11926

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• On finding approximate optimal paths in weighted regions
• An efficient approximation algorithm for weighted region shortest path problem
• Approximate shortest paths in anisotropic regions
• scientific article; zbMATH DE number 2080988
• The weighted region problem

Cited in

(8)

• On discretization methods for approximating optimal paths in regions with direction-dependent costs
• Path refinement in weighted regions
• Heuristic directional search optimal path algorithm based on the variable raster model
• An experimental study of weighted \(k\)-link shortest path algorithms
• Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
• Path Planning in 0/1/∞ Weighted Regions with Applications
• scientific article; zbMATH DE number 2080988 (Why is no real title available?)
• On finding approximate optimal paths in weighted regions

Describes a project that uses

Uses Software

• BUSHWHACK

This page was built for publication: Adaptive and compact discretization for weighted region optimal path finding.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900802)