【摘要】 按照规则格网进行索引时需要对跨格网的道路进行分割并维护相关的复杂关系(比如道路与交通规则,方向看板,车道连接之间的关系等),算法实现难度较高且会显著增加道路连接的结点数目,从而增加路径规划计算的量而影响性能.介绍了一种改进的格网索引算法,不需要分割跨规则格网的道路网络,而是根据道路网络中特定的连接拓扑关系(道路与结点之间的关系)对结点进行索引从而达到对道路的索引.更多还原

【Abstract】 We must split the road segments if they cross over two or more grids when we use regular grid to index the navigation road network.This due to many complex relationships(such as between road segments and traffic maneuvers,signpost,lane connectivity,etc) need to be maintained.It is difficult to implement by coding and this will obviously increase the count of nodes,and then reduce the performance of route calculating.We’ll improve the grid spatial index algorithm based on road network.It is just index on nodes and do not need to split the road segments.The index of road segments will follow with it’s from node(or to node).This avoids maintaining the complex relationships between road segments with other data.更多还原