-
11.发明申请公开(公告)号：US20220130244A1
公开(公告)日：2022-04-28
申请号：US17079050
申请日：2020-10-23
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF
IPC: G08G1/0967 , H04W4/44
Abstract: A method, an apparatus, and a computer program product may be provided for requesting traffic data. The apparatus may determine at least one map area comprising road segments, said map area having at least one map area identifier, determine road segment identifiers for the road segments of the at least one map area, send to a data service, a request for traffic data, said request identifying the map area, and receive from the data service, a subtree data structure set, the subtree data structure set comprising a plurality of subtree data structures, said subtree data structures in the set corresponding to traffic ranges. The apparatus may associate a road segment in a corresponding traffic range based on the road segment identifier satisfying one subtree data structure of the traffic range and provide the traffic range as traffic data for the road segment to a navigation application.
-
12.发明申请公开(公告)号：US20220092092A1
公开(公告)日：2022-03-24
申请号：US17110999
申请日：2020-12-03
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF
Abstract: A method, an apparatus, and a computer program product for updating a map database are disclosed herein. The method comprises identifying a bounding box specifying a region of a map and obtaining a plurality of map area identifiers and the corresponding map area content based on the bounding box. The method may further include generating a subtree data structure, wherein the subtree data structure encodes a plurality of digests based on the plurality of map area identifiers and the corresponding map area content and transmitting a map update request comprising the generated subtree data structure. The method may further include receiving map update data for at least a portion of the plurality of map area identifiers and the corresponding map area content and updating the map database based on the received map update data.
-
13.发明申请公开(公告)号：US20210173415A1
公开(公告)日：2021-06-10
申请号：US16709513
申请日：2019-12-10
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF
Abstract: An approach is provided for dynamic obstacle data in a collision probability map. The approach, for example, involves monitoring a flight of an aerial vehicle through a three-dimensional (3D) space that is partitioned into 3D shapes of varying resolutions. The approach also involves detecting an entry of the aerial vehicle into one 3D shape of the plurality of 3D shapes. The approach further involves, on detecting an exit of the aerial vehicle form the one 3D shape, recording a 3D shape identifier (ID) of the one 3D shape and at least one of a first timestamp indicating the entry, a second timestamp indicating the exit, a duration of stay in the one 3D shape, dimensions of the aerial vehicle, or a combination thereof as a dynamic obstacle observation record. The approach further involves transmitting the dynamic obstacle observation record to another device (e.g., a server for creating the collision probability map).
-
14.发明申请公开(公告)号：US20210172740A1
公开(公告)日：2021-06-10
申请号：US16709556
申请日：2019-12-10
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF
Abstract: An approach is provided for aerial route calculation in a three-dimensional (3D) space. The approach, for example, involves receiving a request to route an aerial vehicle through the 3D space from a start location to a target location. The 3D is represented as 3D shapes (e.g., cubes). The approach also involves matching the start location and the target location respectively to a start shape and a target shape in the 3D space. The approach further involves computing a route through the 3D shapes from the start shape to the target shape based on a collision probability determined based on a first probability of survival due to volume-related factors, a second probability of survival due to aerial-vehicle-related factors, or a combination.
-
公开(公告)号：US20210097057A1
公开(公告)日：2021-04-01
申请号：US16584280
申请日：2019-09-26
Applicant: HERE GLOBAL B.V.
Inventor： Raul CAJIAS , Daniel ROLF
Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises determining an update candidate node, wherein the update candidate node is associated with a node identifier and a first node digest; sending the node identifier and the first node digest to an update data service; and receiving, from the update data service, a response containing one of node digests of the child nodes of the update candidate node at the update data service; or updated content corresponding to the update candidate node. The method may further include updating the map database based on the received response.
-
Patent Agency Ranking
公开(公告)号：US20180174445A1
公开(公告)日：2018-06-21
申请号：US15383822
申请日：2016-12-19
Applicant: HERE GLOBAL B.V.
Inventor： Daniel ROLF
CPC classification number: G08G1/0129 , G01C21/32 , G01C21/3492 , G01C21/3691 , G08G1/0112 , G08G1/0141
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.
-
17.发明申请公开(公告)号：US20230092888A1
公开(公告)日：2023-03-23
申请号：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
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.
-
18.发明申请公开(公告)号：US20220129488A1
公开(公告)日：2022-04-28
申请号：US17079002
申请日：2020-10-23
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF
Abstract: A method, a system, and a computer program product may be provided for providing traffic data to a client device. The system may receive from the client device, a request for traffic data corresponding to road segments of at least one map area, said request identifying the at least one map area and determine road segment identifiers corresponding to each of the road segments of the at least one map area and determine traffic data for at least a portion of the road segment identifiers, said traffic data obtained from a traffic data source. The system may further determine a plurality of traffic ranges based on the obtained traffic data and generate a subtree data structure set, each subtree data structure of the subtree data structure set corresponding to a traffic range of the plurality of traffic ranges, wherein each subtree data structure encodes road segment identifiers corresponding to the respective traffic range.
-
公开(公告)号：US20210381847A1
公开(公告)日：2021-12-09
申请号：US17118104
申请日：2020-12-10
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF , David Falla Cepeda
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 one or more intermediate segment anchor points and encoded server-provided route fragments for a requested route between an origin and a destination; identifying one or more intermediate segments corresponding to the one or more intermediate segment anchor points; generating a route between the origin and the destination, the route including the one or more intermediate segments and a plurality of client-generated route fragments; encoding each client-generated route fragment by application of an XOR algorithm to the client-generated route fragment road segments; comparing the encoded client-generated route fragments to the encoded server-provided route fragments; and providing navigational assistance for traveling along the route in response to the encoded client-generated route fragments corresponding with the encoded server-provided route fragments.
-
公开(公告)号：US20210381838A1
公开(公告)日：2021-12-09
申请号：US17118048
申请日：2020-12-10
Applicant: HERE Global B.V.
Inventor： Raul CAJIAS , Daniel ROLF , David Falla Cepeda
IPC: G01C21/34
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.
-
-
-
-
-
-
-
-
-
Search Results
36
records
(took 0.028 seconds)
