公开(公告)号：US06487497B2

公开(公告)日：2002-11-26

申请号：US09920493

申请日：2001-08-01

申请人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

发明人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

IPC分类号： G01C2130

CPC分类号： G01C21/3415 ,  G01C21/34 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3492

摘要： A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm. The gate identified as having a higher priority than any other gate in its respective search tree is expanded to determine one or more successor gates thereof. Each of these successor gates so formed is compared to the gates in the other search tree. The process of growing at least one of the search trees by expanding the gate in the search tree that has a higher priority than any other gate in the search tree is continued until a gate in one search tree corresponds to at least one gate in the other search tree.

摘要翻译： 一种用于与导航系统一起使用并与代表地理区域中的道路网络的地图数据库一起使用的路线计算的程序和方法。 路线计算程序适于在道路网络上的第一位置和道路网络上的第二位置之间找到至少一条解决路线。 路线计算程序包括与第一位置相关联的第一搜索树和与第二位置相关联的第二搜索树。 每个搜索树适用于保持门。 每个门代表道路网上的物理位置以及沿着道路网络上的路径从位置到另一位置的方向。 路线计算程序还包括与搜索树之一相关联的至少一个优先级队列。 基于使用搜索算法的评估，优先级队列将优先级分配给相关搜索树中的一个门。 被识别为具有比其相应搜索树中的任何其他门优先级高的门被扩展以确定其一个或多个后继门。 这些形成的这些后续门中的每一个与另一搜索树中的门相比较。 通过扩展搜索树中具有比搜索树中的任何其他门优先级更高的优先级的搜索树中的门来生长至少一个搜索树的过程继续进行，直到一个搜索树中的门对应于另一个搜索树中的至少一个门 搜索树。

公开(公告)号：US07054742B2

公开(公告)日：2006-05-30

申请号：US10651091

申请日：2003-08-28

申请人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

发明人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

IPC分类号： G01C21/36

CPC分类号： G01C21/3415 ,  G01C21/34 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3492

摘要： A method for route calculation using real time traffic conditions is disclosed. A transmission that includes weightings indicative of traffic conditions on roads is received. Then, a solution route is calculated by forming a list of road segments. The list is formed by expanding a search tree comprised of gates. Each gate represents a physical location on a road segment and an accessible direction relative thereto. Each gate to which a weighting applies is incremented by an amount indicated in the transmission. The solution route is determined by expanding the search tree, which includes determining and evaluating successor gates.

摘要翻译： 公开了一种使用实时交通状况进行路线计算的方法。 接收到包含表示道路交通状况的权重的变速器。 然后，通过形成道路段的列表来计算解决路线。 该列表是通过扩展由门组成的搜索树形成的。 每个门代表路段上的物理位置和相对于其的可访问方向。 加权应用的每个门增加传输中指示的量。 通过扩展搜索树来确定解决路线，搜索树包括确定和评估后续门。

公开(公告)号：US06678611B2

公开(公告)日：2004-01-13

申请号：US10259897

申请日：2002-09-27

申请人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

发明人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

IPC分类号： G01C2136

CPC分类号： G01C21/3415 ,  G01C21/34 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3492

摘要： A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm. The gate identified as having a higher priority than any other gate in its respective search tree is expanded to determine one or more successor gates thereof. Each of these successor gates so formed is compared to the gates in the other search tree. The process of growing at least one of the search trees by expanding the gate in the search tree that has a higher priority than any other gate in the search tree is continued until a gate in one search tree corresponds to at least one gate in the other search tree.

公开(公告)号：US06298303B1

公开(公告)日：2001-10-02

申请号：US09714314

申请日：2000-11-16

申请人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

发明人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

IPC分类号： G01C2100

CPC分类号： G01C21/3415 ,  G01C21/34 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3492

摘要： A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm. The gate identified as having a higher priority than any other gate in its respective search tree is expanded to determine one or more successor gates thereof. Each of these successor gates so formed is compared to the gates in the other search tree. The process of growing at least one of the search trees by expanding the gate in the search tree that has a higher priority than any other gate in the search tree is continued until a gate in one search tree corresponds to at least one gate in the other search tree.

摘要翻译： 一种用于与导航系统一起使用并与代表地理区域中的道路网络的地图数据库一起使用的路线计算的程序和方法。 路线计算程序适于在道路网上的第一位置和道路网络上的第二位置之间找到至少一条解决路线。 路线计算程序包括与第一位置相关联的第一搜索树和与第二位置相关联的第二搜索树。 每个搜索树适用于保持门。 每个门代表道路网上的物理位置以及沿着道路网络上的路径从位置到另一位置的方向。 路线计算程序还包括与搜索树之一相关联的至少一个优先级队列。 基于使用搜索算法的评估，优先级队列将优先级分配给相关搜索树中的一个门。 被识别为具有比其相应搜索树中的任何其他门优先级高的门被扩展以确定其一个或多个后继门。 这些形成的这些后续门中的每一个与另一搜索树中的门相比较。 通过扩展搜索树中具有比搜索树中的任何其他门优先级更高的优先级的搜索树中的门来生长至少一个搜索树的过程继续进行，直到一个搜索树中的门对应于另一个搜索树中的至少一个门 搜索树。

公开(公告)号：US06192314B1

公开(公告)日：2001-02-20

申请号：US09047698

申请日：1998-03-25

申请人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

发明人： Asta Khavakh ,  William McDonough ,  Oleg Voloshin ,  Yaoguang Wang

IPC分类号： G01C2100

CPC分类号： G01C21/3415 ,  G01C21/34 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3492

摘要： A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm. The gate identified as having a higher priority than any other gate in its respective search tree is expanded to determine one or more successor gates thereof. Each of these successor gates so formed is compared to the gates in the other search tree. The process of growing at least one of the search trees by expanding the gate in the search tree that has a higher priority than any other gate in the search tree is continued until a gate in one search tree corresponds to at least one gate in the other search tree.

公开(公告)号：US06565610B1

公开(公告)日：2003-05-20

申请号：US09248600

申请日：1999-02-11

申请人： Yaoguang Wang ,  David S. Lampert ,  Shashi Jasthi

发明人： Yaoguang Wang ,  David S. Lampert ,  Shashi Jasthi

IPC分类号： G06F1700

CPC分类号： G01C21/3673 ,  G06T11/60

摘要： A text placement program is disclosed. The text placement program provides for placement of text, such as names of geographic features, on a map image. A plurality of candidate locations for text placement are identified and provided to the text placement program. The text placement program evaluates each candidate location for text placement using an expression that includes a weighted clause of a first type indicative of whether the represented geographic feature is named at least once on the map image. If a candidate location being evaluated for text placement overlaps another candidate location, the expression for the candidate location being evaluated includes a weighted clause of a second type. One additional weighted clause of the second type is included for each occurrence of the candidate location overlapping another candidate location. For each candidate location, the text placement program evaluates the expression for two conditions: placement of text and no placement. The results of the two evaluations of the expression are compared and the condition that provides the greater result is selected. Optionally, the expression may include an additional weighted clause including a rank assigned to the represented geographic feature. The text placement program can be configured by adjusting the weightings assigned to the clause(s) of which it is formed.

摘要翻译： 公开了文本放置程序。 文本放置程序提供在地图图像上放置诸如地理特征的文本的文本。 识别文本放置的多个候选位置并将其提供给文本放置程序。 文本放置程序使用包含第一类型的加权子句的表达式来评估每个候选位置的文本放置，该表达式指示所表示的地理特征在地图图像上至少被命名一次。 如果被评估为文本放置的候选位置与另一候选位置重叠，则被评估的候选位置的表达式包括第二类型的加权子句。 对于候选位置的每次出现，包括与另一候选位置重叠的第二类型的另外一个加权子句。 对于每个候选位置，文本放置程序评估两个条件的表达式：放置文本和不放置。 比较表达式的两个评估结果，并选择提供更大结果的条件。 可选地，表达式可以包括包括分配给所表示的地理特征的等级的附加加权子句。 可以通过调整分配给其形成的子句的权重来配置文本放置程序。