An efficient algorithm for computing least cost paths with turn constraints
From MaRDI portal
(Redirected from Publication:293389)
Recommendations
- Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints
- A Shortest Path Algorithm Based on Limited Search Heuristics
- Route planning with turn restrictions: A computational experiment
- Publication:4792778
- Computing the shortest path: \(A^\ast\) search meets graph theory
Cites work
Cited in
(11)- Traversing a set of points with a minimum number of turns
- Solving an urban waste collection problem using ants heuristics
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- scientific article; zbMATH DE number 1870068 (Why is no real title available?)
- An algorithm to determine a path with minimal cost/capacity ratio
- Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
- Route planning with turn restrictions: A computational experiment
- Terracost: computing least-cost-path surfaces for massive grid terrains
- Trajectory planning for unmanned aerial vehicles: a network optimization approach
- Traversing a set of points with a minimum number of turns
- Customizable contraction hierarchies with turn costs
This page was built for publication: An efficient algorithm for computing least cost paths with turn constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293389)