scientific article; zbMATH DE number 1870068
From MaRDI portal
Publication:4792778
DOI10.1023/A:1020853410145zbMath1035.68692OpenAlexW1482690689MaRDI QIDQ4792778
Publication date: 17 February 2003
Published in: GeoInformatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020853410145
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
route planningshortest path algorithmlocation-based servicesturn restrictionspedestrian navigationturn costs
Computing methodologies and applications (68U99) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (7)
Combining discrete and continuous optimization to solve kinodynamic motion planning problems ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks ⋮ Optimal placement of wireless charging lanes in road networks ⋮ Route planning with turn restrictions: A computational experiment ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
Uses Software
This page was built for publication:
