Matching geolocated positions in complex urban road networks

What is it about?

The process of matching geolocated data positions to known entities in a digital map is called "map-matching". The success or failure of this process may be affected by the magnitude of the positioning error (ranging from some centimeters to several meters according to the positioning technique) and by the complexity of the road network. We focus on the latter. In general, we assume that the road network is more complex in an urban environment: roads/streets are closer to each other and density is higher, leading to a higher amount of candidates to consider when trying to associate a geolocation to a road segment. In addition, the traffic flow is frequently interrupted, so that relying on speed information may not be valid sometimes. How are different map-matching algorithms affected by this complexity? How do they behave?

Featured Image