Using barefoot with different maps? about barefoot HOT 3 CLOSED

May I ask, why do you need two versions of a/the map? - Apart from that, if a road is included in both verions of the raw map data it will have the same OSM id in barefoot. However, there are often multiple roads with the same OSM id. Therefore, if there is also no new connection of the road to some other road, the road's source and target points will also have the same OSM ids in both versions. A point on that road (road point) can then be matched. However, barefoot's map data structure as is does not provide an efficient search for roads by source or target ids. Therefore, you can either add such a data structure and match it; or, alternatively, perform a radius search on the road map and iterate through the result set to find a road in verion 2 that has the same source and target id as the road in verison 1. With that road and the fraction of the road point, you can now create a road point on version 2 that matches the point. That is then exactly the same as in verion 2, if the road's geomety is the same; and it is still a match on the road network if the geometry changed.

from barefoot.

Thank you for your response. I thought as well about finding the road in the new map but it adds more complexity and is bug prone. So I think we’ll go for the simple solution by just starting over again from the beginning of the trajectory.

In fact, the case happens only when we update the raw map data (by importing a new .pbf). Our matchers could be in situations in which they start with the new map and have to continue an on-going matching. So if the ids are not the same across maps, or missing, it could be an error.

Thanks again for your help. Have a nice day!

from barefoot.

To open this issue again instead of writing a new. It often occurs that a map is updated over time. New priorities, changing streets polylines etc. Then the stored kState from previous vehicles can not find the Candid or find the wrong id. Because the IDs have changed, the identifier for a segment (street) should occure twice forward and backward. Could you use the given vector for this problem?

from barefoot.