On approximating shortest paths in weighted triangular tessellations

DOI10.1016/J.ARTINT.2023.103898MaRDI QIDQ6161478zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira

Publication date 27 June 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.artint.2023.103898

zbMATH Keywords

any-angle path planningshortest pathtessellationweighted region problem

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• A note on the unsolvability of the weighted region shortest path problem
• An algorithmic approach to some problems in terrain navigation
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Approximation algorithms for geometric shortest path problems
• Coordinated motion planning for two independent robots
• Detecting weakly simple polygons
• Determining approximate shortest paths on weighted polyhedral surfaces
• Fast optimal and bounded suboptimal Euclidean pathfinding
• scientific article; zbMATH DE number 1424295 (Why is no real title available?)
• On pseudolinear functions
• Optimal any-angle pathfinding in practice
• Pairwise symmetry reasoning for multi-agent path finding search
• Path Planning in 0/1/∞ Weighted Regions with Applications
• Path-length analysis for grid-based path planning
• Pseudolinearity and efficiency
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• Subdimensional expansion for multirobot path planning
• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
• The weighted region problem
• Triangulation refinement and approximate shortest paths in weighted regions

Cited in

(3)

• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
• Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
• Spanner for the 0/1/ weighted region problem

This page was built for publication: On approximating shortest paths in weighted triangular tessellations

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