Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (9): 164-167.

Previous Articles     Next Articles

Path-finding algorithm based on node degree and infinite incipient percolation cluster

ZHOU Yang, FAN Jianhua, WANG Zhiqin, ZHANG Jiehua   

  1. School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin 300384, China
  • Online:2013-05-01 Published:2016-03-28

基于节点度和最小支撑聚类的路径搜索算法

周  阳,樊建华,王志芹,张洁华   

  1. 天津理工大学 计算机与通信工程学院,天津 300384

Abstract: According to the complex network theory, an impedance function based on node degree and infinite incipient percolation cluster and a path-finding heuristic algorithm for urban road network is presented. The heuristic algorithm proposed in this paper can find a path which can avoid the roads where congestion may occur so that the risk of encountering congestion can be reduced, while the total length of the path is close to the theoretical shortest. The algorithm is utilized to implement a simple navigation program and the feasibility of the algorithm is tested through a group of actual road network data.

Key words: path-finding, heuristic, complex network, infinite incipient percolation cluster

摘要: 在复杂网络的理论基础上,基于节点度和最小支撑聚类构造了一个阻抗函数,利用该阻抗函数提出了一种可应用于城市路网的启发式路径搜索算法,该算法搜索到的路径可以在总路径长度接近理论最短的同时,通过避免取径可能发生拥堵的路段,从而降低遭遇拥堵情况的风险;根据该算法编程实现了一个简易导航程序,通过实际路网数据验证了算法的有效性。

关键词: 路径搜索, 启发式, 复杂网络, 最小支撑聚类