Modelling OpenStreetMap Data for Determination of the Fastest Route Under Varying Driving Conditions
Grzegorz M. Protaziuk , Robert Pątkowski , Robert Bembenik
AbstractWe propose a network graph for determining the fastest route under varying driving conditions based on OpenStreetMap data. The introduced solution solves the fastest point-to-point path problem. We present a method of transformation the OpenStreetMap data into a network graph and a few transformation for improving the graph obtained by almost directly mapping the source data into a destination model. For determination of the fastest route we use the modified version of Dijkstra’s algorithm and a time-dependent model of network graph where the flow speed of each edge depends on the time interval.
|Publication size in sheets||0.9|
|Book||Bembenik Robert, Skonieczny Łukasz, Protaziuk Grzegorz M., Kryszkiewicz Marzena, Rybiński Henryk (eds.): Intelligent Methods and Big Data in Industrial Applications, Studies in Big Data, vol. 40, 2019, Springer, ISBN 978-3-319-77603-3, [978-3-319-77604-0], 376 p., DOI:10.1007/978-3-319-77604-0|
|Keywords in English||OpenStreetMap data, time-dependent network graph, fastest path|
|Project||Development of new algorithms in the areas of software and computer architecture, artificial intelligence and information systems and computer graphics . Project leader: Arabas Jarosław,
, Phone: +48 22 234 7432, start date 01-06-2017, end date 31-10-2018, II/2017/DS/1, Completed
|Score||= 20.0, 02-02-2020, ChapterFromConference|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.