利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

6 条记录 (耗时 0.018 秒)

    NAVIGATION DEVICES AND METHODS CARRIED OUT THEREON
    3.
    发明公开
    NAVIGATION DEVICES AND METHODS CARRIED OUT THEREON 审中-公开
    导航设备和方法从那里进行

    公开(公告)号：EP3309514A1

    公开(公告)日：2018-04-18

    申请号：EP17197029.6

    申请日：2011-01-13

    申请人： TomTom International B.V. ,  TomTom Development Germany GmbH

    发明人： SCHILLING, Heiko ,  GAWRILOW, Ewgenij ,  HILGER, Moritz ,  PROFOUS, Andreas ,  WERBER, Jürgen ,  SERBANESCU, Alexandru

    IPC分类号： G01C21/32 ,  G01C21/34

    CPC分类号： G01C21/3453 ,  G01C21/00 ,  G01C21/32 ,  G01C21/34 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3626

    摘要： This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.

    摘要翻译： 本发明涉及一种使用包括多个可导航路径的地图数据确定路线的方法，地图数据被分成多个区域。 该方法包括使用至少一个处理装置来：在地图数据上接收起点和目的地以及选择多个成本函数中的一个，并使用地图数据和最小成本数据确定从起点到目的地的路线 标识地图数据区域之间的最小成本路径。 如果对于不同的成本函数在一对区域之间存在不同的最小成本路径并且确定路线包括从构成该区域的一对区域的最小成本路径中识别，则最小成本数据标识一对区域之间的多于一个最小成本路径 起点和目的地，最低成本路径对于选定成本函数具有最低成本。

    SYSTEM AND METHOD OF GENERATING A ROUTE ACROSS AN ELECTRONIC MAP
    4.
    发明公开
    SYSTEM AND METHOD OF GENERATING A ROUTE ACROSS AN ELECTRONIC MAP 有权
    系统和方法创建一个路由通过电子纪录

    公开(公告)号：EP2561315A1

    公开(公告)日：2013-02-27

    申请号：EP11709091.0

    申请日：2011-03-09

    申请人： TomTom International B.V. ,  TomTom Development Germany GmbH

    发明人： SCHILLING, Heiko ,  GAWRILOW, Ewgenij ,  HILGER, Moritz ,  PROFOUS, Andreas ,  WERBER, Jürgen ,  SERBANESCU, Alexandru

    IPC分类号： G01C21/34 ,  G08G1/0968

    CPC分类号： G01C21/34 ,  G08G1/096827

    摘要： A computerized method of generating a route 1000 from an origin position F1 to a destination position 706 across an electronic map 700 comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map 700, the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map 700; (2) calculating a first portion 1002 of a route from origin position toward the destination position 706 using a first routing method up to a predetermined threshold 1006 from the origin position F1, such that the first routing method uses the delay data so that the first portion 1002 of the route takes into account delays; and (3) calculating a second portion 1004 of the route beyond the predetermined threshold 1006 to the destination position 706 using a second routing method to further calculate the route to the destination position 1006.

    NAVIGATION DEVICES AND METHODS CARRIED OUT THEREON
    5.
    发明公开
    NAVIGATION DEVICES AND METHODS CARRIED OUT THEREON 审中-公开
    NAVIGATIONSVORRICHTUNGEN UND DARAUFAUSGEFÜHRTEVERFAHREN

    公开(公告)号：EP2561314A1

    公开(公告)日：2013-02-27

    申请号：EP11700415.0

    申请日：2011-01-13

    申请人： TomTom International B.V. ,  TomTom Development Germany GmbH

    发明人： SCHILLING, Heiko ,  GAWRILOW, Ewgenij ,  HILGER, Moritz ,  PROFOUS, Andreas ,  WERBER, Jürgen ,  SERBANESCU, Alexandru

    IPC分类号： G01C21/34 ,  G06Q10/00

    CPC分类号： G01C21/3453 ,  G01C21/00 ,  G01C21/32 ,  G01C21/34 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3626

    摘要： This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.

    摘要翻译： 本发明涉及使用包括多个可导航路径的地图数据确定路线的方法，该地图数据被划分为多个区域。 该方法包括使用至少一个处理装置：在地图数据上接收原点和目的地，并选择多个成本函数中的一个，并且使用地图数据和最小成本数据确定从原点到目的地的路线 其识别地图数据的区域之间的最小成本路径。 如果针对不同成本函数的一对区域之间存在不同的最小成本路径，则确定一个路线包括从包括该区域的一对区域的最小成本路径识别出最小成本数据，该最小成本数据标识一对区域之间的多于一个最小成本路径 起点和目的地，所选成本函数的最低成本路径具有最低成本。