Publikation:

Route Planning for Bicycles : Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2012

Autor:innen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

MCCLUSKEY, Lee, ed.. Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling : [Atibaia, São Paulo, Brazil, June 25 - 29, 2012]. Palo Alto, Calif.: AAAI Press, 2012, pp. 234-242. ISBN 978-1-57735-562-5

Zusammenfassung

We consider the problem of computing shortest paths subject to an additional resource constraint such as a hard limit on the (positive) height difference of the path. This is typically of interest in the context of bicycle route planning, or when energy consumption is to be limited. So far, the exact computation of such constrained shortest paths was not feasible on large networks; we show that state-of-the-art speed-up techniques for the shortest path problem, like contraction hierarchies, can be instrumented to solve this problem efficiently in practice despite the NP-hardness in general.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Route Planning; Constrained Shortest Path; Contraction Hierarchy

Konferenz

The Twenty-Second International Conference on Automated Planning and Scheduling, 25. Juni 2012 - 29. Juni 2012, Atibaia, São Paulo, Brazil
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690STORANDT, Sabine, 2012. Route Planning for Bicycles : Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy. The Twenty-Second International Conference on Automated Planning and Scheduling. Atibaia, São Paulo, Brazil, 25. Juni 2012 - 29. Juni 2012. In: MCCLUSKEY, Lee, ed.. Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling : [Atibaia, São Paulo, Brazil, June 25 - 29, 2012]. Palo Alto, Calif.: AAAI Press, 2012, pp. 234-242. ISBN 978-1-57735-562-5
BibTex
@inproceedings{Storandt2012Route-46633,
  year={2012},
  title={Route Planning for Bicycles :  Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy},
  url={https://www.aaai.org/ocs/index.php/ICAPS/ICAPS12/paper/view/4502},
  isbn={978-1-57735-562-5},
  publisher={AAAI Press},
  address={Palo Alto, Calif.},
  booktitle={Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling : [Atibaia, São Paulo, Brazil, June 25 - 29, 2012]},
  pages={234--242},
  editor={McCluskey, Lee},
  author={Storandt, Sabine}
}
RDF
<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/server/rdf/resource/123456789/46633">
    <dcterms:abstract xml:lang="eng">We consider the problem of computing shortest paths subject to an additional resource constraint such as a hard limit on the (positive) height difference of the path. This is typically of interest in the context of bicycle route planning, or when energy consumption is to be limited. So far, the exact computation of such constrained shortest paths was not feasible on large networks; we show that state-of-the-art speed-up techniques for the shortest path problem, like contraction hierarchies, can be instrumented to solve this problem efficiently in practice despite the NP-hardness in general.</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/46633"/>
    <dcterms:title>Route Planning for Bicycles :  Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy</dcterms:title>
    <dc:creator>Storandt, Sabine</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2012</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-08-07T08:37:20Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-08-07T08:37:20Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.
https://www.aaai.org/ocs/index.php/ICAPS/ICAPS12/paper/view/4502

Prüfdatum der URL

2019-05-17

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen