An efficient algorithm for computing least cost paths with turn constraints

DOI10.1016/S0020-0190(98)00134-3zbMath1339.68199OpenAlexW2093506709MaRDI QIDQ293389

Ali Sharifi Boroujerdi, Jeffrey K. 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

zbMATH Keywords

computational complexityshortest pathsroutingrange searchingDijkstra's algorithmleast cost pathsturn constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Trajectory planning for unmanned aerial vehicles: a network optimization approach ⋮ Solving an urban waste collection problem using ants heuristics ⋮ Route planning with turn restrictions: A computational experiment

Cites Work

• Dynamic fractional cascading

This page was built for publication: An efficient algorithm for computing least cost paths with turn constraints