Threshold abandoning strategy in hierarchical route-finding algorithm
一种分层寻路算法中的域值放弃策略

In order to determine when to give up hierarchical route-finding algorithm, we put forward a kind of threshold abandoning strategy. When the estimated distance between original point and destination is shorter than the abandoning threshold, shortest route algorithm will be adopted, otherwise hierarchical route-finding algorithm will be adopted. Three parameters named estimate distance, abandoning threshold and abandoning factor were introduced to describe the new strategy, and abandoning threshold will be worked out by means of statistics. Experiments show that this new strategy can make more mutes adopted by drivers.