-
公开(公告)号：EP2297719B1
公开(公告)日：2016-01-13
申请号：EP09772407.4
申请日：2009-06-29
CPC分类号： G01C21/34 , G09B29/106
-
2.发明公开
公开(公告)号：EP2304704A1
公开(公告)日：2011-04-06
申请号：EP09772406.6
申请日：2009-06-29
CPC分类号： G01C21/34 , G09B29/106
摘要： The invention provides a method of resolving a location from an ordered list of location reference points being representative of nodes in an encoder digital map and each having attributes representative of a specific line or segment in said encoder digital map emanating from or incident at those nodes. The method comprises the steps of (i) for each location reference point, identifying at least one candidate node existing in a second digital map, and, using the available attributes of that location reference point, identifying at least one candidate line or segment existing in said second digital map emanating from or incident at said candidate node, (ii) performing a route search within said second digital map between: (a) at least one of said at least one candidate node and the corresponding candidate line or segment emanating therefrom or incident thereat, and (b) at least one of a candidate node for the next location reference point appearing in the list and the corresponding candidate line or segment emanating therefrom or incident thereat, and extracting from said second digital map each line or segment forming part of the route so determined between said candidate nodes, (iii) repeating step (ii) for each consecutive pair of location reference points up to and including the final location reference point appearing in the list. Preferably, the route search is a shortest path route search, most preferably operating on respective pairs of successive candidate nodes, and includes a means of ensuring that the corresponding line or segment of the first of the pair of nodes forms part of the route resulting therefrom.
-
公开(公告)号：EP2297719A1
公开(公告)日：2011-03-23
申请号：EP09772407.4
申请日：2009-06-29
CPC分类号： G01C21/34 , G09B29/106
摘要： A efficient method of encoding a continuous path within a road network is described. Ideally the path to be encoded is capable of being completely represented within a digital map and expressible as a path list of lines and/or segments existing in said digital map and consecutively ordered. The method comprises the steps of: (i) storing a start position in a route search list, said start position being one of: (a) the line or segment first appearing in said path list or, where the start node of said first line or segment is artificial, the first line or segment appearing in said digital map having a real start node and which leads directly to said first line or segment optionally through other artificial nodes, or (b) a most recently identified deviation line or segment also appearing in said path list; (ii) determining a path from the start node of the start position and including said start position to an end node of the last line or segment in the path list within said digital map, said path being determined according to an algorithm, (iii) comparing the shortest path so determined to the path list for identity, and in the absence of identity, identifying at least one deviation line or segment being part of the path list and having a start node representative of an intersection in said digital map but not being the line or segment first appearing in said path list, and if such deviation line or segment does not terminate at the end node of the last line or segment appearing in the path list, repeating step (i) using said deviation line or segment, and (iv) Storing the last line or segment in the path list in said route search list if not already stored. Most preferably, the algorithm used is a shortest path algorithm.
摘要翻译： 描述了对道路网络内的连续路径进行编码的有效方法。 理想地，要被编码的路径能够被完全地表示在数字地图内并且可被表示为存在于所述数字地图中并且被连续地排序的线和/或段的路径列表。 该方法包括以下步骤：（i）将开始位置存储在路线搜索列表中，所述开始位置是以下之一：（a）首先出现在所述路径列表中的线路或段，或者在所述第一线路的起始节点 或段是人造的，出现在所述数字地图中的第一行或段具有实际起始节点并且可选地通过其他人工节点直接导向所述第一行或段，或者（b）也出现的最近识别的偏离行或段 在所述路径列表中; （ii）确定从所述开始位置的开始节点并且包括所述开始位置到所述数字地图内的路径列表中的最后一行或段的结束节点的路径，所述路径根据算法确定，（iii） 将如此确定的最短路径与用于标识的路径列表进行比较，并且在不存在同一性的情况下，识别作为路径列表一部分的至少一个偏差线或分段，并且具有代表所述数字地图中的交叉点但不是 该线或段首先出现在所述路径列表中，并且如果这种偏离线或段并未终止于出现在路径列表中的最后一行或段的末端节点，则使用所述偏差线或段重复步骤（i），以及 （iv）如果尚未存储，则将最后一行或段存储在所述路径搜索列表中的路径列表中。 最优选地，所使用的算法是最短路径算法。
-
4.发明授权
公开(公告)号：EP2304704B1
公开(公告)日：2016-06-29
申请号：EP09772406.6
申请日：2009-06-29
CPC分类号： G01C21/34 , G09B29/106
-
-
-
搜索结果
4 条记录 (耗时 0.011 秒)
