公开(公告)号：US20210364316A1

公开(公告)日：2021-11-25

申请号：US17109406

申请日：2020-12-02

Applicant: HERE Global B.V.

Inventor： Raul Cajias ,  Daniel Rolf

IPC: G01C21/00

Abstract: A first category encoding data structure encoding map version agnostic identifiers of traversable map elements (TMEs) within a zone of interest and associated with a first category is received. The first category encoding data structure was provided by a network apparatus. The first category encoding data structure is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. The first category encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus determines a respective category associated with each of one or more TMEs within the zone of interest based at least in part on whether the TME satisfies the first category encoding data structure. The mobile apparatus performs at least one navigation function based at least in part on the respective category associated with each of the one or more TMEs within the zone of interest.

公开(公告)号：US11047699B2

公开(公告)日：2021-06-29

申请号：US16419560

申请日：2019-05-22

Applicant: HERE Global B.V.

Inventor： Daniel Rolf ,  Raul Cajias

IPC: G01C21/34 ,  G08G1/01 ,  G06F16/29 ,  G08G1/0968 ,  G06F16/33 ,  G01C21/36

Abstract: A route response provided by a network apparatus is received. The route response comprises route information and one or more delay bloom filters. The route response is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. A decoded route is determined based on the route information and the mobile version of the digital map. Based on the one or more delay bloom filters, an expected traffic delay for at least one adjacent segment of the decoded route is determined. An adjacent segment is a segment of the digital map that intersects the decoded route and is not a segment of the decoded route. The decoded route and the expected traffic delay for the at least one adjacent segment of the decoded route is provided via a user interface.

公开(公告)号：US10989545B2

公开(公告)日：2021-04-27

申请号：US16430670

申请日：2019-06-04

Applicant: HERE Global B.V.

Inventor： Daniel Rolf ,  Raul Cajias

IPC: G01C21/32 ,  G01C21/34 ,  G01C21/36 ,  G06F16/29

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin and a point-of-interest road segment corresponding to each of the points-of-interest; receiving intermediate points and corresponding intermediate segments for a route between the starting road segment and the point-of-interest road segments; generating at least one route between the starting road segment and a corresponding one of the point-of-interest road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving, in response to the route request, a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.

公开(公告)号：US20200370908A1

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

申请号：US16419610

申请日：2019-05-22

Applicant: HERE Global B.V.

Inventor： Raul Cajias ,  Daniel Rolf

IPC: G01C21/34 ,  G01C21/36 ,  G06F16/29 ,  G06F16/22 ,  G06F16/9537 ,  G06F16/9538

Abstract: A POI route response is received that comprises information identifying a starting location and a particular number of POIs, and a bloom filter encoding a route segment set defined by routes from the starting location to each of the particular number of POIs. The information identifying the starting location is used to identify a decoded starting segment of the mobile version of the digital map. Map information is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A first decoded route is determined based on the cost value assigned to the segments. The first decoded route is a route from the decoded starting segment to a first POI. The first decoded route is provided via a user interface of the mobile apparatus and/or a vehicle is controlled to traverse the first decoded route.

公开(公告)号：US10395520B2

公开(公告)日：2019-08-27

申请号：US15383822

申请日：2016-12-19

Applicant: HERE GLOBAL B.V.

Inventor： Daniel Rolf

IPC: G08G1/01 ,  G01C21/34

Abstract: A method, apparatus and computer program product are provided to more accurately construct a traffic model. In regards to a method, links of a second traffic model are categorized as being either observed or unobserved. A link is observed if a most likely route through a first traffic model transits over the link and includes at least a predetermined number of probe data points. Separately for an unobserved graph comprised of unobserved links and an observed graph comprised of observed links, the method determines a fastest path between common nodes that appear in each of the unobserved and observed graphs. In an instance in which the fastest path in the unobserved graph is at least as fast as the fastest path in the observed graph, a travel time penalty is added to a travel time of the unobserved link in a second traffic model, subsequent to the first traffic model.

公开(公告)号：US09863774B2

公开(公告)日：2018-01-09

申请号：US15148416

申请日：2016-05-06

Applicant: HERE Global B.V.

Inventor： Alex Gonopolskiy ,  Daniel Rolf

IPC: G01C21/32 ,  G01C21/30

CPC classification number: G01C21/32 ,  G01C21/30

Abstract: Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving updated map data comprises a plurality of links. One or more changed or new are identified links. The method further comprises determining a tiling of the updated map data and determining, based on the tiling of the updated map data, that a tile boundary between a first tile and a second tile intersects at least one of the one or more changed or new links. The method further comprises compiling a map update based on the updated map data, previous map data comprising at least one of the changed or new links intersected by the tile boundary, and the tiling, and providing the map update for at least the first tile.

公开(公告)号：US20170016733A1

公开(公告)日：2017-01-19

申请号：US14797794

申请日：2015-07-13

Applicant: HERE Global B.V.

Inventor： Daniel Rolf

IPC: G01C21/34 ,  G06F17/30

CPC classification number: G01C21/34 ,  G01C21/00 ,  G01C21/26 ,  G01C21/30 ,  G01C21/32 ,  G01C21/343 ,  G01C21/3446 ,  G01C21/3461 ,  G01C21/3469 ,  G01C21/3484 ,  G01C21/36 ,  G01C21/3611 ,  G01C21/367 ,  G06F3/041 ,  G06F17/30 ,  G06F17/30241 ,  G06F17/30628 ,  G06F17/30702 ,  G09B29/106

Abstract: A method and apparatus for indexing routes using similarity hashing. In an embodiment, a processor identifies a route wherein the route includes one or more links. The processor identifies a route attribute wherein the route attribute describes the route. The processor hashes the one or more links to determine a minimum link with a minimum hash value. The processor assigns the route attribute to the minimum link.

Abstract translation: 一种使用相似性散列索引路线的方法和装置。 在一个实施例中，处理器识别路由，其中​​路由包括一个或多个链路。 处理器识别路由属性，其中route属性描述路由。 处理器散列一个或多个链接以确定具有最小哈希值的最小链接。 处理器将route属性分配给最小链接。

公开(公告)号：US20160370193A1

公开(公告)日：2016-12-22

申请号：US14745652

申请日：2015-06-22

Applicant: HERE Global B.V.

Inventor： Mirko Maischberger ,  Daniel Rolf

IPC: G01C21/34

CPC classification number: G01C21/34 ,  G01C21/3446 ,  G08G1/09 ,  G08G1/096816

Abstract: Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with geographic data for each path segment along the route. The encoded navigation route is transmitted to the navigation device.

Abstract translation: 提供了用于确定导航路线的系统，装置和方法。 导航设备在起始位置和目的地位置之间请求路由。 路由请求由外部处理器接收以进行分析。 导航路由由外部处理器及其关联的地图版本确定。 然后，所确定的导航路线用沿着路线的每个路段的地理数据进行编码。 编码的导航路由被发送到导航设备。

公开(公告)号：US12265515B2

公开(公告)日：2025-04-01

申请号：US17109483

申请日：2020-12-02

Applicant: HERE Global B.V.

Inventor： Raul Cajias ,  Daniel Rolf

IPC: G06F16/29 ,  G01C21/00 ,  G01C21/34 ,  G01C21/36 ,  G06F16/22 ,  G06F16/2457 ,  G06F16/31 ,  H04L45/7459 ,  G06F16/2453

Abstract: A network apparatus determines a route from an origin traversable map element (TME) to a target TME. The route comprises a list of route TMEs to be traveled from the starting location to the target location. The network apparatus identifies adjacent TMEs to the route, wherein an adjacent TME is a TME of the digital map that intersects the route and is not a route TME; determines an expected traffic delay for each adjacent TME based on traffic data; separates the adjacent TMEs into a plurality of delay groups based on the corresponding expected traffic delays; generates delay encoding data structures; and provides the delay encoding data structures and information identifying the route. Each delay encoding data structure encodes a map version agnostic identifier for the adjacent TMEs of one of the delay groups and is a probabilistic data structure configured to not provide false negatives.

公开(公告)号：US11913792B2

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

申请号：US18057528

申请日：2022-11-21

Applicant: HERE GLOBAL B.V.

Inventor： Daniel Rolf ,  Raul Cajias

IPC: G01C21/32 ,  G06F16/29 ,  G01C21/36 ,  G08G1/0968 ,  G06V30/422

CPC classification number: G01C21/32 ,  G01C21/3644 ,  G06F16/29 ,  G06V30/422 ,  G08G1/096844

Abstract: Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.