@inproceedings{Behr2021Match-56522,
  year={2021},
  doi={10.4230/LIPIcs.GIScience.2021.II.12},
  title={Map Matching for Semi-Restricted Trajectories},
  number={208},
  isbn={978-3-95977-208-2},
  issn={1868-8969},
  publisher={Dagstuhl Publishing},
  address={Dagstuhl},
  series={Leibniz International Proceedings in Informatics (LIPIcs)},
  booktitle={11th International Conference on Geographic Information Science (GIScience 2021) – Part II.},
  editor={Janowicz, Krzysztof and Verstegen, Judith A.},
  author={Behr, Timon and van Dijk, Thomas C. and Forsch, Axel and Haunert, Jan-Henrik and Storandt, Sabine},
  note={Article Number: 12}
}

<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/56522">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56522/1/Behr_2-1tgwwag9angkh6.pdf"/>
    <dcterms:issued>2021</dcterms:issued>
    <dc:contributor>Haunert, Jan-Henrik</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-02-10T14:49:59Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Forsch, Axel</dc:creator>
    <dcterms:abstract xml:lang="eng">We consider the problem of matching trajectories to a road map, giving particular consideration to trajectories that do not exclusively follow the underlying network. Such trajectories arise, for example, when a person walks through the inner part of a city, crossing market squares or parking lots. We call such trajectories semi-restricted. Sensible map matching of semi-restricted trajectories requires the ability to differentiate between restricted and unrestricted movement. We develop in this paper an approach that efficiently and reliably computes concise representations of such trajectories that maintain their semantic characteristics. Our approach utilizes OpenStreetMap data to not only extract the network but also areas that allow for free movement (as e.g. parks) as well as obstacles (as e.g. buildings). We discuss in detail how to incorporate this information in the map matching process, and demonstrate the applicability of our method in an experimental evaluation on real pedestrian and bicycle trajectories.</dcterms:abstract>
    <dc:contributor>Forsch, Axel</dc:contributor>
    <dc:creator>Behr, Timon</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-02-10T14:49:59Z</dcterms:available>
    <dc:creator>Haunert, Jan-Henrik</dc:creator>
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>van Dijk, Thomas C.</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dc:contributor>van Dijk, Thomas C.</dc:contributor>
    <dc:creator>Storandt, Sabine</dc:creator>
    <dc:contributor>Behr, Timon</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56522/1/Behr_2-1tgwwag9angkh6.pdf"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56522"/>
    <dcterms:title>Map Matching for Semi-Restricted Trajectories</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>