Path planning in a weighted planar subdivision under the Manhattan metric
From MaRDI portal
Publication:6184991
DOI10.1007/s00373-023-02744-7OpenAlexW4391034205MaRDI QIDQ6184991
Mansoor Davoodi, Ashkan Safari
Publication date: 29 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02744-7
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Rectilinear shortest paths in the presence of rectangular barriers
- Path planning with objectives minimum length and maximum clearance
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Shortest paths among transient obstacles
- A note on the unsolvability of the weighted region shortest path problem
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Determining approximate shortest paths on weighted polyhedral surfaces
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Path Planning in 0/1/∞ Weighted Regions with Applications
- An optimal algorithm for intersecting line segments in the plane
- The weighted region problem
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Fibonacci heaps and their uses in improved network optimization algorithms
- On finding approximate optimal paths in weighted regions
- Planning Algorithms
- Faster shortest-path algorithms for planar graphs
This page was built for publication: Path planning in a weighted planar subdivision under the Manhattan metric
