Computing the least complex path for vehicle drivers based on classified intersections
Robert S. Sladewski, Andreas Keler, Andreas Divanis · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 2017
Recent services for car navigation include selections for computing the shortest, fastest or most economic route between origin and destination.Our idea is to compute the least complex route, which might be challenging, since there is no consistent definition of complexity.We focus on the complexity of road intersections, which is experienced by vehicle drivers with the turning motion itself in selected crossroads.Therefore, we define weights for different turning possibilities.In a case study in Le Havre, we compute the least complex path on the underlying road network.First results show differing routes comparing to shortest path based on Dijkstra's Algorithm.