Connectivity-based Path Planning and Its Application to City Traffic Network
Qing Liu · Computer and Modernization · 2002
Proposes a connectivity-based method to solve the path planning and applies the method to the path planning for the city traffic network. With the method, it is regarded as the best weighted path whose number of connective layers between two nodes is minimal, the best path isn't the global best weighted path. To enhance the path searching quality, the edge, whose weight is big, is split into several edges, and some nodes are inserted. As a result, the obtained path is highly confidently the global best path or is very near to the global best path. The time complexity of the method is linear, the searching for path planning is conducted in the global, and the precise can be controlled by two Indexes, which can be used to determine how many nodes should be inserted. The application to the city transportation network demonstrates that the method is efficient and reliable.