Publikation: Algorithms for Matching and Predicting Trajectories
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2013
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
MÜLLER-HANNEMANN, Matthias, ed., Renato WERNECK, ed.. 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 84-95. ISBN 978-1-61197-291-7. Available under: doi: 10.1137/1.9781611972917.9
Zusammenfassung
We consider the following two problems: Map Matching: Given a sequence of (imprecise) location measurements from a mobile user moving on a road network, determine the most likely path in the network this user has travelled along. Prediction of Trajectories: Given the path of where a mobile user has moved along in a road network up to now, predict where he will travel along in the near future.
Our map matching algorithm is simple and efficient even in case of very imprecise measurements like GSM-localizations and allows for the real-time tracking of a large number of mobile users on modest hardware. Our proposed path prediction algorithm is equally simple but yields extremely accurate predictions at a very low computational cost.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
The Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 22. Jan. 2011, San Francisco, California
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
EISNER, Jochen, Stefan FUNKE, Andre HERBST, Andreas SPILLNER, Sabine STORANDT, 2013. Algorithms for Matching and Predicting Trajectories. The Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX). San Francisco, California, 22. Jan. 2011. In: MÜLLER-HANNEMANN, Matthias, ed., Renato WERNECK, ed.. 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 84-95. ISBN 978-1-61197-291-7. Available under: doi: 10.1137/1.9781611972917.9BibTex
@inproceedings{Eisner2013-12-18Algor-45936,
year={2013},
doi={10.1137/1.9781611972917.9},
title={Algorithms for Matching and Predicting Trajectories},
isbn={978-1-61197-291-7},
publisher={SIAM},
address={Philadelphia, PA},
booktitle={2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
pages={84--95},
editor={Müller-Hannemann, Matthias and Werneck, Renato},
author={Eisner, Jochen and Funke, Stefan and Herbst, Andre and Spillner, Andreas and 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/45936">
<dc:contributor>Storandt, Sabine</dc:contributor>
<dcterms:issued>2013-12-18</dcterms:issued>
<dc:contributor>Spillner, Andreas</dc:contributor>
<dc:creator>Storandt, Sabine</dc:creator>
<dc:creator>Funke, Stefan</dc:creator>
<dc:creator>Spillner, Andreas</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>Algorithms for Matching and Predicting Trajectories</dcterms:title>
<dcterms:abstract xml:lang="eng">We consider the following two problems: Map Matching: Given a sequence of (imprecise) location measurements from a mobile user moving on a road network, determine the most likely path in the network this user has travelled along. Prediction of Trajectories: Given the path of where a mobile user has moved along in a road network up to now, predict where he will travel along in the near future.<br /><br />Our map matching algorithm is simple and efficient even in case of very imprecise measurements like GSM-localizations and allows for the real-time tracking of a large number of mobile users on modest hardware. Our proposed path prediction algorithm is equally simple but yields extremely accurate predictions at a very low computational cost.</dcterms:abstract>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Funke, Stefan</dc:contributor>
<dc:language>eng</dc:language>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-29T07:39:11Z</dc:date>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/45936"/>
<dc:contributor>Eisner, Jochen</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-29T07:39:11Z</dcterms:available>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Herbst, Andre</dc:creator>
<dc:creator>Eisner, Jochen</dc:creator>
<dc:contributor>Herbst, Andre</dc:contributor>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
