Method and apparatus for providing speculative navigation routing in incomplete offline maps

    公开(公告)号:US11761772B2

    公开(公告)日:2023-09-19

    申请号:US16665986

    申请日:2019-10-28

    CPC classification number: G01C21/3446 G01C21/3453

    Abstract: An approach is provided for speculative navigation routing in incomplete maps. The approach involves, for example, generating an offline navigation route to a destination using offline map data cached at a device. The approach also involves transmitting a routing request to a routing server for an online navigation route to the destination. The approach further involves providing the online navigation route or a portion of the online navigation route based on determining that the online navigation route or the portion of the online navigation is received within a timeout period. The approach further involves providing the offline navigation route or a portion of the offline navigation route generated during the timeout period based on determining that the online navigation route or the portion of the online navigation route is not received before the timeout period ends.

    Method, system, and computer program product for providing traffic data using subtree data structure

    公开(公告)号:US11675819B2

    公开(公告)日:2023-06-13

    申请号:US17079002

    申请日:2020-10-23

    CPC classification number: G06F16/29 G01C21/34 G06F16/2246 G06F16/2255

    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.

    Method, system, and computer program product for providing traffic data

    公开(公告)号:US11499838B2

    公开(公告)日:2022-11-15

    申请号:US16664392

    申请日:2019-10-25

    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 bloom filter set, each bloom filter of the bloom filter set corresponding to a traffic range of the plurality of traffic ranges, wherein each bloom filter encodes road segment identifiers corresponding to the respective traffic range.

    Method and apparatus for representing an aerial route in a three-dimensional space

    公开(公告)号:US11410560B2

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

    申请号:US16709477

    申请日:2019-12-10

    Abstract: An approach is provided for representing an aerial route in a three-dimensional (3D) space. The approach, for example, involves determining a root 3D shape encompassing an aerial route through a 3D space. The 3D space is partitioned into a hierarchy of 3D shapes, and the aerial route comprises a list of 3D shape identifiers (IDs) corresponding to the 3D shapes that form the aerial route. The approach also involves recursively comparing a respective 3D shape ID of the root 3D shape or child shapes of the root 3D shape to the list of 3D shape IDs of the aerial route. The approach further involves generating a traversal command list by selectively adding the respective 3D shape ID that matches a 3D shape ID of the aerial route or includes the 3D shape ID as a child 3D shape ID. The approach further involves providing the traversal command list as an output.

    PROVIDING INCREMENTAL UPDATES OF CATEGORICAL INFORMATION USING A PROBABILISTIC ENCODING DATA STRUCTURE

    公开(公告)号:US20210364317A1

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

    申请号:US17109430

    申请日:2020-12-02

    Abstract: Information corresponding to one or more traversable map elements (TMEs) within a zone of interest is accessed from the geographic database. A respective category of a plurality of categories is determined for each of the one or more TMEs based at least in part on the information corresponding to the TME. A first category encoding data structure is generated based at least in part on map version agnostic identifiers corresponding to TMEs determined to be in a first category of the plurality of categories, wherein the first category encoding data structure is a probabilistic data structure configured to not provide false negatives for TMEs within the zone of interest. The first category encoding data structure is provided such that a mobile apparatus receives the first category encoding data structure.

    ENCODING A ROUTE USING A PROBABILISTIC ENCODING DATA STRUCTURE

    公开(公告)号:US20210364303A1

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

    申请号:US17109466

    申请日:2020-12-02

    Abstract: A network apparatus determines a route from an origin TME to a target TME based on map data of a network version of a digital map. The route includes a list of route TMEs to be traveled from the origin TME to the target TME. The network apparatus accesses map version agnostic information identifying each TME of the list of route TMEs from the network version of the digital map; generates a map version agnostic identifier for each route TME of the list of route TMEs based on the accessed information; evaluates coding functions based at least on the map version agnostic identifier for each route TME to generate a coded identifier for each route TME; generates an encoding data structure based on the coded identifiers for the route TMEs; and provides the encoding data structure. The encoding data structure is a probabilistic data structure configured to not provide false negatives.

    Method and system for providing parking recommendations

    公开(公告)号:US11183062B2

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

    申请号:US16820217

    申请日:2020-03-16

    Abstract: A method and a system for providing a parking recommendation are disclosed herein. The method may include obtaining a route destination location from a user equipment, obtaining parking data for a pre-determined time period, wherein the parking data comprises a plurality of parked locations and a plurality of destination locations, and providing the parking recommendation based on a last mile model, wherein the last mile model is based on the route destination location and the obtained parking data, wherein the last mile model comprises a time-dependent distance threshold.

    Encoding parking search cruise routes using bloom filters

    公开(公告)号:US11150103B2

    公开(公告)日:2021-10-19

    申请号: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.

    Midpoint-based map-agnostic navigation routing

    公开(公告)号:US11125569B2

    公开(公告)日:2021-09-21

    申请号:US15899170

    申请日:2018-02-19

    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.

    Method, apparatus and computer program product for providing route guidance to multiple points of interest

    公开(公告)号:US10914607B2

    公开(公告)日:2021-02-09

    申请号:US15451571

    申请日:2017-03-07

    Abstract: A method, apparatus, and computer program product are therefore provided for providing a navigation user interface to a plurality of points of interest. Methods may include receiving an indication of a location; receiving an indication of a category of points of interest; identifying a plurality of points of interest associated with the category; generating point of interest specific routes from the location to each of the plurality of points of interest; identifying portions of the point of interest specific routes that are common to more than one point of interest; generating a plurality of consolidated routes, where multiple points of interest are located along at least one of the plurality of consolidated routes; and providing for presentation of the plurality of consolidated routes, where each of the plurality of consolidated routes is distinguished, based at least in part, on the number of points of interest that are located along the respective consolidated route.

Patent Agency Ranking