Recent services for car navigation include selection s 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 definit ion of complexity. We focus on the complexity of ro ad 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 comput e the least complex path on the underly ing road network. First results show differing routes comparing to shortest path based on Dijkstra’s Algorithm.     «

Recent services for car navigation include selection s 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 definit ion of complexity. We focus on the complexity of ro ad intersections, which is experienced by vehicle drivers with the turning motion itself in selected crossroads. Therefo...     »