论文部分内容阅读
在实际交通行为中,不可避免地存在着交叉口时间延迟,而且交通管制信息如交叉口转向限制也普遍存在,这些交通特征使得常规的最短路算法难以满足车辆导航系统路线规划的要求。提出基于“节点-弧段-特征”的数据结构存储方案,能够完整描述路网的平面拓扑和交通特征属性;针对具有交叉口转向限制和交叉口延迟等特征的交通网络,首先采用对偶图方法构造等效网络,在等效网络中采用常规的最短路算法计算最优路线,然后将它转化为原道路网中的行车路线。试验证明这种方法能够有效解决包含交通特征的车辆导航系统路线规划问题.
In the actual traffic behavior, there is inevitably the time delay of the intersection, and traffic control information such as intersection steering restrictions are also ubiquitous. These traffic characteristics make the conventional shortest path algorithm difficult to meet the requirements of the route planning of the vehicle navigation system. A data structure storage scheme based on “node-arc-feature” is proposed, which can completely describe the topology of the road network and the characteristics of traffic features. For the traffic network with the characteristics of intersection turning restrictions and intersection delays, the dual graph method Construct the equivalent network, calculate the optimal route in the equivalent network by using the conventional shortest path algorithm, and then convert it into the driving route in the original road network. Experiments prove that this method can effectively solve the route planning problem of vehicle navigation system including traffic characteristics.