专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2010000706A1 A METHOD OF RESOLVING A LOCATION FROM ENCODED DATA REPRESENTATIVE THEREOF 审中-公开
标题翻译：从编码数据表示中解析位置的方法
公开(公告)号：WO2010000706A1
公开(公告)日：2010-01-07
申请号：PCT/EP2009/058130
申请日：2009-06-29
申请人： TOMTOM INTERNATIONAL B.V. , BASELAU, Sven , PETZOLD, Lars , SCHAEFER, Ralf-Peter
发明人： BASELAU, Sven , PETZOLD, Lars , SCHAEFER, Ralf-Peter
IPC分类号： G08G1/09 , G01C21/00 , G09B29/10
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.
摘要翻译：本发明提供了一种从代表编码器数字地图中的节点的位置参考点的有序列表中分离位置的方法，并且每个具有表示在这些节点处发出或入射的所述编码器数字地图中的特定线或段的属性的方法。该方法包括以下步骤：（i）对于每个位置参考点，识别存在于第二数字地图中的至少一个候选节点，并且使用该位置参考点的可用属性来识别存在于第二数字地图中的至少一个候选线或段所述第二数字地图从所述候选节点发出或发生在所述候选节点，（ii）在所述第二数字地图之间执行路线搜索，所述路线搜索在：（a）所述至少一个候选节点中的至少一个和从其发出的对应的候选线或段，并且（b）出现在列表中的下一个位置参考点的候选节点中的至少一个以及从其发出或入射到其中的对应候选线或片段，并且从所述第二数字图中提取每一行或片段形成部分在所述候选节点之间确定的路由，（iii）对于直到并包括fi的每个连续的一对位置参考点重复步骤（ii）列表中出现nal位置参考点。优选地，路由搜索是最短路径路由搜索，最优选地在相应的连续的候选节点对上运行，并且包括确保该对节点中的第一对节点的对应的线或段形成由其产生的路由的一部分的手段。

2. 发明申请

WO2010000707A1 AN EFFICIENT LOCATION REFERENCING METHOD 审中-公开
标题翻译：高效的位置参考方法
公开(公告)号：WO2010000707A1
公开(公告)日：2010-01-07
申请号：PCT/EP2009/058131
申请日：2009-06-29
申请人： TomTom International B.V. , PETZOLD, Lars , SCHAEFER, Ralf-Peter , BASELAU, Sven
发明人： PETZOLD, Lars , SCHAEFER, Ralf-Peter , BASELAU, Sven
IPC分类号： G08G1/09 , G01C21/00 , G09B29/10
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）如果尚未存储，则将最后一行或段存储在路径搜索列表中的路径列表中。最优选地，所使用的算法是最短路径算法。

3. 发明申请

WO2012095456A3 AN EFFICIENT LOCATION REFERENCING METHOD 审中-公开
公开(公告)号：WO2012095456A3
公开(公告)日：2012-07-19
申请号：PCT/EP2012/050372
申请日：2012-01-11
申请人： TOMTOM DEVELOPMENT GERMANY GMBH , BASELAU, Sven , PETZOLD, Lars , BERNDT, Axel
发明人： BASELAU, Sven , PETZOLD, Lars , BERNDT, Axel
IPC分类号： G01C21/34 , G09B29/10 , G01C21/26
摘要： A method of encoding a continuous path within a road network is described, the path 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, wherein said lines and/or segments have one or more attributes associated therewith. The method involves storing a start position in a route search list, and 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. The path is determined according to an algorithm utilising an attribute of said lines or segments. The attribute may be a lowest functional road class (LFRC) of the path to be encoded or a part thereof.

4. 发明授权

EP2297719B1 AN EFFICIENT LOCATION REFERENCING METHOD 有权转让
标题翻译：有效的定位参考方法
公开(公告)号：EP2297719B1
公开(公告)日：2016-01-13
申请号：EP09772407.4
申请日：2009-06-29
申请人： TomTom International B.V.
发明人： PETZOLD, Lars , SCHAEFER, Ralf-Peter , BASELAU, Sven
IPC分类号： G01C21/34 , G09B29/10
CPC分类号： G01C21/34 , G09B29/106

5. 发明公开

EP2304704A1 A METHOD OF RESOLVING A LOCATION FROM ENCODED DATA REPRESENTATIVE THEREOF 有权转让
标题翻译：方法用于解决的网站从代表编码数据
公开(公告)号：EP2304704A1
公开(公告)日：2011-04-06
申请号：EP09772406.6
申请日：2009-06-29
申请人： TomTom International B.V.
发明人： BASELAU, Sven , PETZOLD, Lars , SCHAEFER, Ralf-Peter
IPC分类号： G08G1/09 , G01C21/00 , G09B29/10
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.

6. 发明公开

EP2297719A1 AN EFFICIENT LOCATION REFERENCING METHOD 有权转让
标题翻译：有效的定位参考方法
公开(公告)号：EP2297719A1
公开(公告)日：2011-03-23
申请号：EP09772407.4
申请日：2009-06-29
申请人： TomTom International B.V.
发明人： PETZOLD, Lars , SCHAEFER, Ralf-Peter , BASELAU, Sven
IPC分类号： G08G1/09 , G01C21/00 , G09B29/10
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）如果尚未存储，则将最后一行或段存储在所述路径搜索列表中的路径列表中。最优选地，所使用的算法是最短路径算法。

7. 发明授权

EP2304704B1 A METHOD OF RESOLVING A LOCATION FROM ENCODED DATA REPRESENTATIVE THEREOF 有权转让
标题翻译：方法用于解决的网站从代表编码数据
公开(公告)号：EP2304704B1
公开(公告)日：2016-06-29
申请号：EP09772406.6
申请日：2009-06-29
申请人： TomTom International B.V.
发明人： BASELAU, Sven , PETZOLD, Lars , SCHAEFER, Ralf-Peter
IPC分类号： G01C21/34 , G09B29/10
CPC分类号： G01C21/34 , G09B29/106

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式