Automatic Topology Maintenance Approach for High-level Road Networks

Objective This paper presents an automatic topology maintenance approach for any extracted high-lev-el road network.Firstly,the minimum spanning tree(MST)is generated on dual graph of road net-works for maintaining the whole connectivity relationship.Secondly,the breadth-first search(BFS)and shortest path algorithm are applied to connect the dangling roads and rational roads,which areused to maintain the perceptual connecting relationship of the high-level road networks.An experi-ment was executed to verify the effectiveness of the approach.The experimental results show that themethod achieves good and effective topology maintenance results,reflecting the structural characteris-tic of a high-level network.Furthermore,a comparison analysis to original high-level roads before andafter topology maintenance was also carried out to show the rationalities of navigation path planning.