论文部分内容阅读
提出了一种基于连接特性的路径规划算法 ,并针对城市交通网络的路径规划进行算法的验证和应用研究。该算法利用网络的连接特性 ,求取最少连接层数的路径作为较优的全局路径 ,这样获得的全局路径不是加权最少路径。为了提高算法精度 ,在权较大的两点之间插入新的结点 ,这样获得的路径是全局最优路径的可信度很高。这种算法的时间复杂度是线性的 ,即O(N) ,而且通过适当增大模型 ,可以控制路径规划的精度 ,并提出了控制精度的两个指数。经过对城市交通网络的具体例子的计算及分析 ,表明该方法快速、可靠及有效。
A path planning algorithm based on connectivity characteristics was proposed and the algorithm was verified and applied to the path planning of urban traffic network. The algorithm takes advantage of the connection characteristics of the network and obtains the path with the least number of connection layers as the optimal global path. The global path obtained in this way is not the weighted least path. In order to improve the accuracy of the algorithm, a new node is inserted between two larger weights. The obtained path is highly credible in the global optimum path. The time complexity of this algorithm is linear, ie O (N), and by appropriately increasing the model, the path planning accuracy can be controlled and two indices of control accuracy are proposed. After the calculation and analysis of the concrete example of urban traffic network, it shows that the method is fast, reliable and effective.