An efficient algorithm for computing least cost paths with turn constraints
DOI10.1016/S0020-0190(98)00134-3zbMATH Open1339.68199OpenAlexW2093506709MaRDI QIDQ293389FDOQ293389
Authors: Ali Boroujerdi, Jeffrey Uhlmann 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001343?np=y
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
- scientific article; zbMATH DE number 1870068
- Computing the shortest path: \(A^\ast\) search meets graph theory
computational complexityrange searchingshortest pathsroutingDijkstra's algorithmleast cost pathsturn constraints
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cites Work
Cited In (9)
- Route planning with turn restrictions: A computational experiment
- Traversing a set of points with a minimum number of turns
- An algorithm to determine a path with minimal cost/capacity ratio
- Trajectory planning for unmanned aerial vehicles: a network optimization approach
- Traversing a set of points with a minimum number of turns
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- Title not available (Why is that?)
- Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
- Solving an urban waste collection problem using ants heuristics
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)
