KOPS - The Institutional Repository of the University of Konstanz

Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks

Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

BLUM, Johannes, Stefan FUNKE, Sabine STORANDT, 2018. Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks. The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18). New Orleans, Louisiana, Feb 2, 2018 - Feb 7, 2018. In: The Thirty-Second AAAI Conference on Artificial Intelligence, The Thirtieth Innovative Applications of Artificial Intelligence Conference, The Eighth AAAI Symposium on Educational Advances in Artificial Intelligence. Palo Alto, California:AAAI Press, pp. 6119-6126. eISSN 2374-3468. ISBN 978-1-57735-800-8

@inproceedings{Blum2018Subli-44520, title={Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks}, url={https://aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16271}, year={2018}, isbn={978-1-57735-800-8}, address={Palo Alto, California}, publisher={AAAI Press}, booktitle={The Thirty-Second AAAI Conference on Artificial Intelligence, The Thirtieth Innovative Applications of Artificial Intelligence Conference, The Eighth AAAI Symposium on Educational Advances in Artificial Intelligence}, pages={6119--6126}, author={Blum, Johannes and Funke, Stefan and Storandt, Sabine} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/44520"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-10T15:14:54Z</dcterms:available> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44520"/> <dc:creator>Funke, Stefan</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-10T15:14:54Z</dc:date> <dcterms:title>Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Storandt, Sabine</dc:contributor> <dc:language>eng</dc:language> <dcterms:issued>2018</dcterms:issued> <dc:creator>Storandt, Sabine</dc:creator> <dc:creator>Blum, Johannes</dc:creator> <dc:contributor>Blum, Johannes</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Funke, Stefan</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:abstract xml:lang="eng">Shortest path planning is a fundamental building block in many applications. Hence developing efficient methods for computing shortest paths in e.g. road or grid networks is an important challenge. The most successful techniques for fast query answering rely on preprocessing. But for many of these techniques it is not fully understood why they perform so remarkably well and theoretical justification for the empirical results is missing. An attempt to explain the excellent practical performance of preprocessing based techniques on road networks (as transit nodes, hub labels, or contraction hierarchies) in a sound theoretical way are parametrized analyses, e.g., considering the highway dimension or skeleton dimension of a graph. But these parameters tend to be large (order of Θ( √ n)) when the network contains grid-like substructures – which inarguably is the case for real-world road networks around the globe. In this paper, we use the very intuitive notion of bounded growth graphs to describe road networks and also grid graphs. We show that this model suffices to prove sublinear search spaces for the three above mentioned stateof- the-art shortest path planning techniques. For graphs with a large highway or skeleton dimension, our results turn out to be superior. Furthermore, our preprocessing methods are close to the ones used in practice and only require randomized polynomial time.</dcterms:abstract> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account