-
公开(公告)号：US11821739B2
公开(公告)日：2023-11-21
申请号：US17118048
申请日：2020-12-10
Applicant: HERE Global B.V.
Inventor： Raul Cajias , Daniel Rolf , David Falla Cepeda
IPC: G01C21/34
CPC classification number: G01C21/3446
Abstract: Provided herein is a method of generating low bandwidth map format agnostic routes between origins and destinations for route communication between different map formats or versions using reduced bandwidth. Methods may include: receiving an indication of a route request between an origin and a destination; generating a route between the origin starting road segment and the destination target road segment, the route including a plurality of road segments; identifying one or more intermediate segments from the plurality of road segments, each intermediate segment having an anchor point; generating a plurality of route fragments from the route; encoding each route fragment by applying an XOR algorithm to identifiers of route fragment road segments of a respective route fragment; and providing the encoded route fragments and one or more anchor points of the one or more intermediate segments in response to the route request.
-
2.发明授权公开(公告)号：US11796322B2
公开(公告)日：2023-10-24
申请号：US16664358
申请日：2019-10-25
Applicant: HERE GLOBAL B.V.
Inventor： Daniel Rolf , Raul Cajias
CPC classification number: G01C21/30 , G01C21/34 , G01C21/3446 , G01C21/3453 , G01C21/38 , G01C21/3804 , G01C21/3815 , G06F16/2379 , G06F16/29 , G06F16/958 , G01C21/3461 , G01C21/3492 , G01C21/3819 , G01C21/3822 , G01C21/3885
Abstract: An apparatus, a method and a computer program product are provided for updating link information on a client device. The method may include determining at least one map area comprising one or more links, the map area having at least one map area identifier, Sending to a data service, a request for at least one categorized link. Receiving, from the data service, at least one bloom filter, the at least one bloom filter encoding the at least one categorized link, determining one or more link identifiers for the one or more links in the map area and associating candidate link of the one or more links to the at least one categorized link, based on the link identifier of the at least one candidate link satisfying the at least one received bloom filter, to update the link information on the client device.
-
3.发明授权公开(公告)号：US11644333B2
公开(公告)日：2023-05-09
申请号：US16664318
申请日：2019-10-25
Applicant: HERE GLOBAL B.V.
Inventor： Daniel Rolf , Raul Cajias
CPC classification number: G01C21/367 , G01C21/3453 , G01C21/3673 , G01C21/3676 , G06F16/29
Abstract: An apparatus, method and computer program product are provided for generating map data of categorized links. The method may include receiving a request for at least one categorized link in a map area and obtaining at least one categorized link in the map area, based on the request. The method may further include determining link identifiers corresponding to each link of the at least one categorized link, and generating at least one bloom filter, wherein the at least one bloom filter encodes link identifiers corresponding to each link of the at least one categorized link.
-
公开(公告)号：US11578989B2
公开(公告)日：2023-02-14
申请号：US16419645
申请日：2019-05-22
Applicant: HERE Global B.V.
Inventor： Raul Cajias , Daniel Rolf
Abstract: A parking cruise request is received. A network version starting segment is identified and a route determination algorithm is expended starting at the network version starting segment. When the route determination algorithm is expanded to a new segment, a cost value is determined for the new segment based at least on the likelihood of finding parking on the new segment. Responsive to determining that the likelihood of finding parking along the cruise route does satisfy the threshold probability requirement, map version agnostic identifiers for each segment of the cruise route are generated. Each of the map version agnostic identifiers are coded using at least one coding function to generate coded map version agnostic identifiers. A bloom filter having the coded map version agnostic identifiers as members is generated. A parking cruise route response comprising the bloom filter is provided such that a mobile apparatus receives the parking cruise route response.
-
公开(公告)号：US11187546B2
公开(公告)日：2021-11-30
申请号：US16419689
申请日：2019-05-22
Applicant: HERE Global B.V.
Inventor： Daniel Rolf , Raul Cajias
IPC: G01C21/34 , G06F16/22 , G06F16/9537 , G06F16/29 , G01C21/20
Abstract: A route is determined comprising a list of route segments to be traveled from the network version starting segment to the network version target segment. Map version agnostic information identifying each segment of the list of route segments is accessed from the network version of the digital map. A map version agnostic identifier is generated for each route segment of the list of route segments based on the accessed map version agnostic information. The map version agnostic identifier for each route segment is coded using at least one coding function to generate at least one coded map version agnostic identifier for each route segment. A bloom filter is generated based on the coded map version agnostic identifiers for each route segment. The bloom filter is provided such that a mobile apparatus receives the bloom filter.
-
Patent Agency Ranking
公开(公告)号：US20210364308A1
公开(公告)日：2021-11-25
申请号：US17109483
申请日：2020-12-02
Applicant: HERE Global B.V.
Inventor： Raul Cajias , Daniel Rolf
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.
-
公开(公告)号：US20210364301A1
公开(公告)日：2021-11-25
申请号：US17109500
申请日：2020-12-02
Applicant: HERE Global B.V.
Inventor： Raul Cajias , Daniel Rolf
Abstract: A mobile apparatus receives a route response comprising an encoded route and one or more delay encoding data structures. The delay encoding data structures are probabilistic data structures configured to not provide false negatives. The mobile apparatus determines a decoded route based on the encoded route and a mobile version of a digital map; determines an expected traffic delay for at least one adjacent traversable map element (TME) of the decoded route based on the one or more delay encoding data structures; and performs one or more navigation functions based at least on the expected traffic delay for the at least one adjacent segment of the decoded route. An adjacent TME is a TME of the digital map that intersects the decoded route and is not a TME of the decoded route.
-
8.发明授权公开(公告)号：US11112251B2
公开(公告)日：2021-09-07
申请号：US16558631
申请日：2019-09-03
Applicant: HERE Global B.V.
Inventor： Daniel Rolf , Raul Cajias
IPC: G01C21/30 , G06F16/29 , G01C21/34 , H03K19/21 , G08G1/0968
Abstract: Provided herein is a method of generating and communicating map version agnostic road identifiers. Methods may include: providing an indication of a route request between an origin and a destination; receiving a list of road link identifiers in response to the route request; in response to the first road link identifier not corresponding to a road link identifier of a network of road link identifiers: applying an XOR function to the first road link identifier and a subsequent road link identifier in the list of road link identifiers; in response to a result of the XOR function applied to the first road link identifier and the subsequent identifier corresponding with a road link identifier of the network of road link identifiers, adding the road link identifier of the network of road link identifiers to the route.
-
公开(公告)号：US10861333B1
公开(公告)日：2020-12-08
申请号：US16430666
申请日：2019-06-04
Applicant: HERE Global B.V.
Inventor： Raul Cajias , Daniel Rolf
IPC: G08G1/0968 , G01C21/32 , G01C21/34
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 a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or more intermediate points; establishing a route between the starting road segment and the target road segment, the route including a plurality of 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 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.
-
公开(公告)号：US20200370911A1
公开(公告)日：2020-11-26
申请号：US16419560
申请日：2019-05-22
Applicant: HERE Global B.V.
Inventor： Daniel Rolf , Raul Cajias
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.
-
-
-
-
-
-
-
-
-
Search Results
74
records
(took 0.026 seconds)
