ROUTE PLANNING IN URBAN ENVIRONMENT
X C, P Gaspart, M Bogaert · 1992
This paper presents the design and the implementation of a cost- effective and on-board route planning system. Map representation seems to be a crucial problem for route planning in urban environment. In the system described in this paper, an object-based representation is systematically used. It is derived from the standard GDF. All route data are hierarchically structured so that they can be loaded and unloaded according to a simple heuristic rule: full details are considered in the neighbourhood of departure and destination. Only major features are taken into account between them. The route searching is realized by an enhanced A algorithm. By using a new data structure for graph representation, a satisfactory result is achieved for shortest length route search as well as for least duration route search. Quick re-planning capability is a major requirement. A partial searching method is described which meets this requirement. Practical results and performances of route planning in a medium-scale Belgian city are presented and discussed. (A) For the covering abstract see IRRD 867248.