Encoding routes to POIs in proximity searches using bloom filters

    公开(公告)号:US11566911B2

    公开(公告)日:2023-01-31

    申请号:US16419579

    申请日:2019-05-22

    Abstract: A POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated with the new segment satisfies the query criteria, a POI route from the starting segment to the POI is extracted. Map version agnostic identifiers are generated for each segment of the POI routes. Each of the map version agnostic identifiers are coded using at least one coding function. A bloom filter having the coded map version agnostic identifiers as members is generated. The bloom filter is provided such that a mobile apparatus receives the bloom filter.

    Method and apparatus for providing dynamic obstacle data for a collision probability map

    公开(公告)号:US11550340B2

    公开(公告)日:2023-01-10

    申请号:US16709513

    申请日:2019-12-10

    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).

    Apparatus and methods for generating update data for a map database

    公开(公告)号:US11423062B2

    公开(公告)日:2022-08-23

    申请号:US16584367

    申请日:2019-09-26

    Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises receiving a node identifier and a first node digest of an update candidate node; obtaining, based on the node identifier, a second node digest of the update candidate node; comparing the first node digest and the second node digest of the update candidate node; and generating, based on the comparison, the update data for the map database, the update data containing one of an indication of unchanged content; node digests of the child nodes of the update candidate node; or updated content corresponding to the update candidate node.

    Decoding routes to pois in proximity searches using bloom filters

    公开(公告)号:US11193779B2

    公开(公告)日:2021-12-07

    申请号:US16419610

    申请日:2019-05-22

    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.

    DECODING A ROUTE ENCODED BY A PROBABILISTIC ENCODING DATA STRUCTURE

    公开(公告)号:US20210364318A1

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

    申请号:US17109447

    申请日:2020-12-02

    Abstract: A mobile apparatus receives a route response including information identifying a starting location and a target location of a route and an encoding data structure encoding the route. The encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus uses the information identifying the starting and target locations to identify a decoded origin traversable map element (TME) and a decoded target TME of the mobile version of the digital map for the route; accesses map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value; determines a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and performs at least one navigation function using the decoded route.

    Bloom filter multiple traffic-aware route encoding

    公开(公告)号:US11054277B2

    公开(公告)日:2021-07-06

    申请号:US16419540

    申请日:2019-05-22

    Abstract: A route is determined, by a network apparatus storing network version of the digital map, from a starting segment to a target segment. The route comprises a list of route segments from the starting location to the target location. Adjacent segments to the route are identified. An adjacent segment is a segment of the digital map that intersects the route and is not a route segment. An expected traffic delay is determined for each adjacent segment based on traffic data. The adjacent segments are separated into delay groups based on the corresponding expected traffic delays. Delay bloom filters are generated, wherein each delay bloom filter encodes a map version agnostic identifier for the adjacent segments of one of the plurality of delay groups. The delay bloom filters and information identifying the route are provided such that a mobile apparatus receives the delay bloom filters and the information identifying the route.

    ENCODING PARKING SEARCH CRUISE ROUTES USING BLOOM FILTERS

    公开(公告)号:US20200370916A1

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

    申请号:US16419645

    申请日:2019-05-22

    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.

    BLOOM FILTER ROUTE DECODING
    68.
    发明申请

    公开(公告)号:US20200370902A1

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

    申请号:US16419511

    申请日:2019-05-22

    Abstract: A route response is received by a mobile apparatus storing a mobile version of a digital map. The route response includes information identifying starting and target locations of a route and a bloom filter encoding a route segment set defined by the route. Decoded starting and target segments for the route are identified from the mobile version of the digital map based on the information identifying the starting and target locations. Map information is accessed for determining a cost value for segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A decoded route from the decoded starting segment to the decoded target segment is determined using a cost minimization route determination algorithm based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle is controlled to traverse the decoded route.

    Method, apparatus, and computer program product for map data agnostic route fingerprints

    公开(公告)号:US10794717B1

    公开(公告)日:2020-10-06

    申请号:US16430662

    申请日:2019-06-04

    Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems, and particularly, to identifying routes between an origin and one or more points-of-interest. Methods may include: receiving 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; identifying a point-of-interest road segment corresponding to each of the one or more points-of-interest; generating at least one route between the starting road segment and a corresponding one of the one or more point-of-interest road segments; generating a fingerprint for the at least one route; and providing the fingerprints in response to the route request.

    Stitching mixed-version map tiles in hybrid navigation for partial map updates

    公开(公告)号:US10378909B2

    公开(公告)日:2019-08-13

    申请号:US15148442

    申请日:2016-05-06

    Abstract: Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving a map update for at least a first tile comprising map update data. The map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile. A map region of interest is determined, wherein the map region of interest comprises at least a portion of the first tile. The previous map data for the one or more changed or new links intersected by the tile boundary is used or displayed when a map update for the second tile has not been received and is not used or displayed when a map update for the second tile has been received.

Patent Agency Ranking