@inproceedings{Li2021Barri-56905,
  year={2021},
  doi={10.1145/3474717.3486797},
  title={Barrier-Free Pedestrian Routing with Contraction Hierarchies},
  isbn={978-1-4503-8664-7},
  publisher={Association for Computing Machinery},
  address={New York},
  booktitle={SIGSPATIAL '21: Proceedings of the 29th International Conference on Advances in Geographic Information Systems},
  pages={668--669},
  editor={Wang, Xiaofeng and Wang, Fusheng},
  author={Li, Ruoying and Storandt, Sabine and Müller, Uli and Weber, David}
}

<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/56905">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56905/1/Li_2-1csyb6mrbzecr7.pdf"/>
    <dcterms:issued>2021</dcterms:issued>
    <dcterms:title>Barrier-Free Pedestrian Routing with Contraction Hierarchies</dcterms:title>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-17T11:22:07Z</dc:date>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Li, Ruoying</dc:creator>
    <dc:contributor>Weber, David</dc:contributor>
    <dc:creator>Müller, Uli</dc:creator>
    <dcterms:abstract xml:lang="eng">We present a holistic approach for pedestrian routing that allows computing shortest paths that may have indoor and outdoor sections. Such routes arise, for example, when the destination is not just an address but a specific store in a large mall, or when one needs to get to a certain track at a large train station. Currently, map services as Google Maps or OSRM do not offer such functionality. We identify and overcome three main challenges for answering such complex route planning queries: (i) Pedestrian routing requires fine-grained data, as the location of stairs and elevators, building dventrances, building footprints, and elevation/level information. A single missing staircase can change the length of the computed path severely. (ii) Indoor routing has to be integrated carefully into classical path planning to allow the computation of sensible routes that may enter and exit buildings. (iii) Given the large amount of data to be considered in a query, acceleration techniques need to be applied in order to achieve interactive query times. Retrieving barrier-free routes for wheelchairs is also our important use case.</dcterms:abstract>
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56905/1/Li_2-1csyb6mrbzecr7.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56905"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-17T11:22:07Z</dcterms:available>
    <dc:creator>Weber, David</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Müller, Uli</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:creator>Storandt, Sabine</dc:creator>
    <dc:contributor>Li, Ruoying</dc:contributor>
  </rdf:Description>
</rdf:RDF>