Verizon Patent and Licensing Inc.

Hayden Sean White

Nathan M Robinson

Jefferson Ray Tan Hidayat

Faiza Tajammul

Johanna Emily Read

Brendan Ryan Bycroft

Hughan J Ross

A system described herein may provide a technique for the generation of a node map using contraction hierarchy techniques in a manner that accounts for multi-link constraints. Multi-link constraints may include a sequence of two or more links through the node map, and paths that include such multi-link constraints may be associated with an additional cost based on such inclusion. Shortcut links that represent paths through nodes contracted out of the node map may be associated with portions of multi-link constraints. Paths through such shortcut links, where such paths include the remainder of the multi-link constraint, may be considered as including the multi-link constraint, and the cost of such paths may be calculated accordingly. The costs of links and/or paths, including paths that include multi-link constraints, may be used in determining a path from a source node to a target node of the node map.

Systems and methods for optimal path determination using contraction hierarchies with multi-link constraints

A system may perform a search from a source node of a node map to a target node of the node map. Performing the search may include identifying a first path, starting at the source node, that enters a particular constraint region, and identifying a second path, starting at the source node, that does not enter the particular constraint region. The system may select the second path as a path from the source node to the target node, based on identifying that the first path enters the particular constraint region and that the second path does not enter the particular constraint region. The system may cease exploring nodes via the first path when the second path is identified as reaching the target node, and not including a constraint associated with the particular constraint region.

Conditional region-based costing in contraction hierarchies

A system described herein may provide a technique for a determination of a path through a node map using one or more searches. The nodes may be associated with respective priorities. A first search may be performed from a first node in ascending order of priority. A second search may be performed from a second node in ascending order of priority, until a third node, traversed during the first search is reached. A third search may be performed from the third node, in descending order of priority, until the first node is reached. The third search may be restricted only to nodes traversed during the first search. A path that is based on the second and third searches may be provided in response to a navigation request from a starting point associated with the second node to a destination associated with the first node.

Systems and methods for cost-based forward search based on precomputed bidirectional search

A device can determine scenario information associated with a plurality of route planning scenarios. The scenario information can include information that describes, for each route planning scenario of the plurality of route planning scenarios, a condition or a configuration based on which a respective route plan is to be generated. The device can calculate, based on a plurality of route plans corresponding to the plurality of route planning scenarios, a set of metrics associated with the plurality of route planning scenarios. The set of metrics can be calculated based on a single user interaction with a user interface. The device can provide information associated with the set of metrics. The providing the information associated with the set of metrics can cause an action, associated with at least one route plan of the plurality of route plans, to be automatically performed.

Growing community of inventors

Christchurch, New Zealand

Hayden Sean White