会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Route selection system and method utilizing integrated crossings, a
starting route, and/or route numbers
    • 路线选择系统和方法利用综合交叉口,起始路线和/或路线号码
    • US6067499A
    • 2000-05-23
    • US523865
    • 1995-09-08
    • Takeshi YagyuYoshiki UeyamaMakoto FushimiYasuhiro Nakamura
    • Takeshi YagyuYoshiki UeyamaMakoto FushimiYasuhiro Nakamura
    • G01C21/34G06F19/00
    • G01C21/3415G01C21/34
    • A route selection data storage unit 7 stores route selection data which are created from original data describing a detailed road system. When a plurality of crossings and a plurality of roads which are expressed on the road system in the original data satisfy prescribed conditions, these crossings and roads are integrated with each other respectively and recorded in the route selection data. The route selection data include a passage link table, so that links which are deleted by integration of the crossings are not missed. The passage link table records links which are deleted due to the integration of the crossings but passed in practice with reference to approach and escape links as to the respective crossings integrated with each other. An optimum route search unit 6 searches for the optimum route between a starting place and a destination which are designated by a position detection unit and/or a spot input unit 5 through the route selection data. When the optimum route obtained through the search passes through the integrated crossings, the optimum route search unit 6 supplements the deleted links with corresponding passage links recorded in the passage link table.
    • 路线选择数据存储单元7存储从描述详细道路系统的原始数据创建的路线选择数据。 当在原始数据中在道路系统上表达的多个交叉路口和多条道路满足规定条件时,这些交叉口和道路分别相互集成并记录在路线选择数据中。 路线选择数据包括通道链接表,使得不会错过通过整合交叉而删除的链接。 通过链接表记录由于过境的整合而被删除的链接,但是在实践中通过参考彼此集成的各个交叉的接近和转义链接来通过。 最优路径搜索单元6通过路线选择数据搜索由位置检测单元和/或点输入单元5指定的起始位置和目的地之间的最佳路线。 当通过搜索获得的最佳路线通过综合交叉口时,最佳路线搜索单元6用通过链接表中记录的相应通行链路补充被删除的链接。
    • 2. 发明授权
    • Route selection method and system
    • 路线选择方法和系统
    • US06338021B1
    • 2002-01-08
    • US09671109
    • 2000-09-28
    • Takeshi YagyuMakoto FushimiYoshiki Ueyama
    • Takeshi YagyuMakoto FushimiYoshiki Ueyama
    • H04B7185
    • G01C21/3461
    • In a route selection process, an optimal route searcher 5 refers to a traffic light flag included in route selecting data stored in a second storage 4 to see whether a target intersection has any traffic light or not. When the optimal route searcher 5 determines that the target intersection has a traffic light s, a traffic light cost calculator 6 calculates a traffic light cost relevant to a waiting time due to the traffic light s. Based on the traffic light cost thus calculated by the traffic light cost calculator 6, the optimal route searcher 5 calculates a passage cost relevant to a time taken for passing the target intersection. In this manner, with consideration for the waiting time due to the traffic light, a time for going through an entire route can be estimated with higher correctness, thereby rendering the route thus searched more optimal.
    • 在路由选择处理中,最优路径搜索器5参照包含在存储在第二存储器4中的路径选择数据中的交通灯标志,以查看目标交叉路口是否具有任何交通灯。 当最佳路线搜索器5确定目标交叉点具有交通灯s时,交通灯成本计算器6计算由于交通灯s而与等待时间相关的交通灯费用。 基于由交通灯成本计算器6算出的交通灯成本,最优路径搜索器5计算与通过目标交叉点所需的时间相关的通行费用。 以这种方式,考虑到由于交通灯引起的等待时间,可以以更高的正确性来估计整个路线的时间,从而使得如此搜索的路线更加优化。
    • 3. 发明授权
    • Method and apparatus for searching a route
    • 用于搜索路线的方法和装置
    • US6072409A
    • 2000-06-06
    • US14588
    • 1998-01-28
    • Makoto FushimiTakeshi YagyuYoshiki Ueyama
    • Makoto FushimiTakeshi YagyuYoshiki Ueyama
    • G01C21/34G08G1/123
    • G01C21/3446G01C21/32G01C21/34G01C21/3492
    • In areas where composite intersection traffic regulation exits, nodes and links for use in the conventional network are separated into a plurality of nodes and links, respectively. For example, one node is separated into N1a to N1c, and one link is separated into L1a to L1c. Then, the whole road network is represented by separating the network into a road network (L1a, L2a, L3a, L4a, L5a, N1a, N2a) in view of entering links (L1a, L3a) which the composite intersection traffic regulation does not affect, and road networks .alpha. (L1b, L2b, L3b, L4b, N1b, N2b) and .beta. (L1c, L2c, L3c, L5c, N1c, N2c) in view of entering links (L4b, L5c) which the composite intersection traffic regulation affects, and one-way traffic regulations are set on suitable links to allow for a representation of the composite intersection transfer regulation. Use of such map data enables selections which are compliant with the composite intersection traffic regulation without requiring a specific processing at the time of the search processing.
    • 在复合交叉口交通管制出口的地区,常规网络中使用的节点和链路分别分成多个节点和链路。 例如,一个节点分成N1a到N1c,一个链路被分成L1a到L1c。 考虑到进入复合交叉路口交通管制不影响的链路(L1a,L3a),整个道路网络被表示为将该网络分成道路网(L1a,L2a,L3a,L4a,L5a,N1a,N2a) (L1b,L2b,L3b,L4b,N1b,N2b)和β(L1c,L2c,L3c,L5c,N1c,N2c)中的公路网络α(L1b,L2b,L3b,L4b,N1b,N2b) ,并且单向交通规则设置在适当的链路上,以允许表示复合交叉路口转移规则。 使用这样的地图数据可以实现符合复合交叉路口交通规则的选择,而不需要在搜索处理时的特定处理。
    • 5. 发明授权
    • Method and apparatus for searching a route
    • 用于搜索路线的方法和装置
    • US5899955A
    • 1999-05-04
    • US774322
    • 1996-12-24
    • Takeshi YagyuMakoto FushimiYoshiki Ueyama
    • Takeshi YagyuMakoto FushimiYoshiki Ueyama
    • G09B29/10G01C21/00G01C21/34G08G1/0969G06G7/78
    • G01C21/3446G08G1/0969
    • An optimum route searching device 5 conducts a search in a predetermined area on road network data on a lower hierarchical level to obtain minimum arrival costs to individual nodes in the search area and then selects a node located on an upper hierarchical level existing in from the search area. Then the optimum route searching device 5 obtains a remaining cost to a node common with the upper hierarchical level which first appears on the upper hierarchical level existing link. Then the optimum route searching device 5 obtains a minimum arrival cost from the starting point of the search to the common node on the basis of the minimum arrival cost to the selected node and the remaining cost to the common node. The minimum arrival cost to the common node obtained at this time is used as initial conditions for a route search performed on the road network data on the upper hierarchical level. This makes it possible to shift the search results on the lower hierarchical level to the upper hierarchical level without causing an abnormal route such as a U-turn path and a bypass path.
    • 最佳路径搜索装置5在较低等级的道路网数据的预定区域中进行搜索,以获得搜索区域中的各个节点的最小到达成本,然后选择位于从搜索中存在的上层次级别的节点 区。 然后,最优路由搜索装置5获得对于首先出现在上层分层级存在的链路上的与上层分级共同的节点的剩余成本。 然后,最优路由搜索装置5基于对所选节点的最小到达成本和到公共节点的剩余成本,从搜索起始点到公共节点获得最小到达成本。 将此时获得的公共节点的最小到达成本用作对上级路线上的道路网数据执行的路线搜索的初始条件。 这使得可以将较低层级的搜索结果转移到较高层级,而不会引起诸如U形路径和旁路路径的异常路由。
    • 8. 发明授权
    • Method and apparatus for searching a route
    • 用于搜索路线的方法和装置
    • US6014607A
    • 2000-01-11
    • US936914
    • 1997-09-25
    • Takeshi YagyuYasuhiro IharaYoshiki Ueyama
    • Takeshi YagyuYasuhiro IharaYoshiki Ueyama
    • G09B29/10G01C21/00G01C21/34G08G1/0969
    • G01C21/3446
    • Road network data is divided into a plurality of road network areas and one or a plurality of routes are obtained between the divided road network areas. The obtained routes are stored into a route data storage device 1. When a starting point and a destination are specified from a point input device 2, an area investigating device 3 investigates two road network areas to which the points belong. A route retrieving device 4 retrieves the route data corresponding to the combination of the obtained two road network areas from the route data storage device 1. A peripheral route searching device 8 searches for connecting routes in the road network areas to which the starting point and the destination belong, on the basis of the road network data stored in the road network data storage device 7. Further, the peripheral route searching device 8 produces the entire route from the starting point to the destination by using the route data retrieved from the route data storage device 1 and the connecting routes searched for in the vicinities of the starting point and the destination and presents the route to a user through an output device 6. This way, routes between arbitrary two road network areas are obtained in advance and stored as route data. When a starting point and a destination are specified, the route data between the corresponding road network areas are retrieved and a route from the starting point to the destination is presented on the basis of the retrieved route data. Thus the route can be searched for in an instant.
    • 道路网络数据被划分为多个道路网络区域,并且在划分的道路网络区域之间获得一条或多条路线。 所获得的路线被存储到路径数据存储装置1中。当从点输入装置2指定起点和目的地时,区域调查装置3调查点属于的两个道路网区域。 路线检索装置4从路线数据存储装置1检索与所获得的两个道路网络区域的组合相对应的路线数据。外围路径搜索装置8搜索起始点和起点的道路网络区域中的路线, 目的地是根据存储在道路网数据存储装置7中的道路网数据而构成的。此外,周边路径搜索装置8通过使用从路线数据检索出的路线数据,生成从起点到目的地的整个路线 存储装置1和在起点和目的地附近搜索的连接路线,并通过输出装置6向用户呈现路线。这样,预先获得任意两个道路网络区域之间的路线,并将其存储为路线 数据。 当指定起点和目的地时,检索对应的道路网络区域之间的路线数据,并且基于检索到的路线数据呈现从起始点到目的地的路线。 因此,可以立即搜索路线。