On approximating shortest paths in weighted triangular tessellations
From MaRDI portal
Publication:6161478
DOI10.1016/j.artint.2023.103898OpenAlexW4323264966MaRDI QIDQ6161478
Rodrigo I. Silveira, Guillermo Esteban, David Orden, Prosenjit Bose
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103898
Cites Work
- Unnamed Item
- An algorithmic approach to some problems in terrain navigation
- On pseudolinear functions
- Coordinated motion planning for two independent robots
- Path-length analysis for grid-based path planning
- Pairwise symmetry reasoning for multi-agent path finding search
- Fast optimal and bounded suboptimal Euclidean pathfinding
- A note on the unsolvability of the weighted region shortest path problem
- Subdimensional expansion for multirobot path planning
- Optimal Any-Angle Pathfinding In Practice
- Approximation algorithms for geometric shortest path problems
- Pseudolinearity and efficiency
- Determining approximate shortest paths on weighted polyhedral surfaces
- Path Planning in 0/1/∞ Weighted Regions with Applications
- The weighted region problem
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
- Detecting Weakly Simple Polygons
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
This page was built for publication: On approximating shortest paths in weighted triangular tessellations
