Generalized Maneuvers in Route Planning

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057594" target="_blank" >RIV/00216224:14330/12:00057594 - isvavai.cz</a>
Result on the web
<a href="http://www.cai.sk/ojs/index.php/cai/article/view/1007" target="_blank" >http://www.cai.sk/ojs/index.php/cai/article/view/1007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-25929-6_15" target="_blank" >10.1007/978-3-642-25929-6_15</a>

Result language
angličtina
Original language name
Generalized Maneuvers in Route Planning
Original language description
We study an important practical aspect of the route planning problem in real-world road networks -- emph{maneuvers}. Informally, maneuvers represent various irregularities of the road network graph such as turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how to enhance Dijkstra's algorithm in order to solve route planning queries in this model without prioradjustments of the underlying road network graph.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F11%2F0196" target="_blank" >GAP202/11/0196: Well-structured combinatorial classes, width parameters, and design of efficient algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)