Apparatus and method for route searching
First Claim
Patent Images
1. A computer implemented method of performing a one-to-many route search on digital map data, said digital map data comprising a plurality of links connected by nodes representing navigable paths of a network, the method comprising:
- searching the map data using a one-to-many route planning algorithm to explore links from a departure node so as to determine a reachable area for the departure node, said searching comprising;
determining a first cost for each explored link using a cost function associated with the route planning algorithm; and
determining a second cost for each explored link using an objective function, such that each node reached by the route planning algorithm has a first accumulated cost and a second accumulated cost, wherein the first accumulated cost is the minimum accumulation of first costs for links forming a route from the departure node to the node, wherein the second accumulated cost is the accumulation of second costs for the links forming the route from the departure node to the node, and wherein the reachable area is based on a predetermined second accumulated cost value, such that a node is identified as unreachable when the second accumulated cost for the node exceeds the predetermined second accumulated cost value,wherein the searching of the map data is limited to a search boundary, wherein the first accumulated cost value defining the search boundary is based upon the first accumulated cost of the first unreachable node identified by the searching of the map data,the method further comprising;
causing a representation of the determined reachable area to be displayed on a display device.
4 Assignments
0 Petitions
Accused Products
Abstract
Embodiments of the present invention provide a one-to-many route searching method comprising searching map data to select links to form a plurality of routes from a departure node according to a cost function, and determining an extent of each route according to an objective function, wherein the searching of the map data is performed to a search boundary based upon a cost of an unreachable node.
-
Citations
17 Claims
-
1. A computer implemented method of performing a one-to-many route search on digital map data, said digital map data comprising a plurality of links connected by nodes representing navigable paths of a network, the method comprising:
-
searching the map data using a one-to-many route planning algorithm to explore links from a departure node so as to determine a reachable area for the departure node, said searching comprising;
determining a first cost for each explored link using a cost function associated with the route planning algorithm; and
determining a second cost for each explored link using an objective function, such that each node reached by the route planning algorithm has a first accumulated cost and a second accumulated cost, wherein the first accumulated cost is the minimum accumulation of first costs for links forming a route from the departure node to the node, wherein the second accumulated cost is the accumulation of second costs for the links forming the route from the departure node to the node, and wherein the reachable area is based on a predetermined second accumulated cost value, such that a node is identified as unreachable when the second accumulated cost for the node exceeds the predetermined second accumulated cost value,wherein the searching of the map data is limited to a search boundary, wherein the first accumulated cost value defining the search boundary is based upon the first accumulated cost of the first unreachable node identified by the searching of the map data, the method further comprising; causing a representation of the determined reachable area to be displayed on a display device. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computing device, comprising one or more processors and a memory storing digital map data, said digital map data comprising a plurality of links connected by nodes representing navigable paths of a network, the one or more processors being arranged to perform a one-to-many route search on the digital map data by:
-
searching the map data using a one-to-many route planning algorithm to explore links from a departure node so as to determine a reachable area for the departure node, said searching comprising;
determining a first cost for each explored link using a cost function associated with the route planning algorithm; and
determining a second cost for each explored link using an objective function, such that each node reached by the route planning algorithm has a first accumulated cost and a second accumulated cost, wherein the first accumulated cost is the minimum accumulation of first costs for links forming a route from the departure node to the node, wherein the second accumulated cost is the accumulation of second costs for the links forming the route from the departure node to the node, and wherein the reachable area is based on a predetermined second accumulated cost value, such that a node is identified as unreachable when the second accumulated cost for the node exceeds the predetermined second accumulated cost value, wherein the searching of the map data is limited to a search boundary, wherein the first accumulated cost value defining the search boundary is based upon the first accumulated cost of the first unreachable node identified by the searching of the map data; andcausing a representation of the determined reachable area to be displayed on a display device.
-
-
15. A computer implemented method of performing a one-to-many route search on digital map data, said digital map data comprising a plurality of links connected by nodes representing navigable paths of a network, the method comprising:
-
searching the map data using a one-to-many route planning algorithm to explore links from a departure node representative of a current location of a user so as to determine a reachable area for the departure node, said searching comprising;
determining a first cost for each explored link using a cost function associated with the route planning algorithm; and
determining a second cost for each explored link using an objective function, such that each node reached by the route planning algorithm has a first accumulated cost and a second accumulated cost, wherein the first accumulated cost is the minimum accumulation of first costs for links forming a route from the departure node to the node, wherein the second accumulated cost is the accumulation of second costs for the links forming the route from the departure node to the node, and wherein the reachable area is based on a predetermined second accumulated cost value, such that a node is identified as unreachable when the second accumulated cost for the node exceeds the predetermined second accumulated cost value,the method further comprising; obtaining the locations of points of interest (POI) in a region around the departure node, each POI being associated with the nearest node of the map data; checking, for nodes associated with a POI reached by the route planning algorithm, the reachability of the POI from the departure node, so as to identify at least one POI as reachable; obtaining availability information for the at least one reachable POI; using the obtained availability information for a current time or an expected arrival time at each of the at least one reachable POI, so as to identify at least one reachable POI as available; determining a route from the departure node to an available POI using the map data; and generating instructions to guide the user along the determined route. - View Dependent Claims (16, 17)
-
Specification