COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR PLANNING A ROUTE
2 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.
-
Citations
39 Claims
-
1-19. -19. (canceled)
-
20. A computer-implemented method, the method comprising the following operations performed by at least one processor:
-
obtaining information identifying origin nodes disposed along a travel route, the origin nodes providing options for departing from the travel route to a destination node; computing first costs for travelling between the origin nodes and the destination node through at least one intermediate node; identifying a corresponding one of the origin nodes associated with a minimum of the computed first costs; and determining a path between the corresponding origin node and the destination node, the determined path comprising the at least one intermediate node. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27, 28, 29)
-
-
30. An apparatus, comprising:
-
a storage device that stores a set of instructions; and at least one processor coupled to the storage device and operative with the set of instructions to; obtain information identifying origin nodes disposed along a travel route, the origin nodes providing options for departing from the travel route to a destination node; compute first costs for travelling between the origin nodes and the destination node through at least one intermediate node; identify a corresponding one of the origin nodes associated with a minimum of the computed first costs; and determine a path between the corresponding origin node and the destination node, the determined path comprising the at least one intermediate node. - View Dependent Claims (32, 33, 34, 35, 36, 37, 38)
-
-
31. The apparatus of 30, wherein:
-
the travel route comprises a route traversed in a geographic region; the destination node comprises a point of interest in the geographic region; and the determined path comprises one or more roads in the geographic region.
-
-
39. A tangible, non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform a method comprising:
-
obtaining information identifying origin nodes disposed along a travel route, the origin nodes providing options for departing from the travel route to a destination node; computing costs for travelling between the origin nodes and the destination node through at least one intermediate node; identifying a corresponding one of the origin nodes associated with a minimum of the computed first costs; and determining a path between the corresponding origin node and the destination node, the determined path comprising the at least one intermediate node.
-
Specification