Determining alternative routes
First Claim
1. A method of determining a route between two locations, comprising:
- receiving a start location and a destination location at a computing device;
determining, by the computing device, an optimal route between the start location and the destination location using a map routing service of the computing device;
determining a plurality of alternative routes between the start location and the destination location by the map routing service of the computing device using the optimal route and a plurality of admissibility criteria comprising limited sharing, local optimality, and uniformly bounded stretch, wherein the limited sharing admissibility criteria is that a percentage of edges shared by the alternative route and the optimal route is less than a predetermined percentage;
ranking, by the computing device, the plurality of alternative routes using each of the plurality of admissibility criteria; and
outputting the ranked plurality of alternative routes by the computing device.
3 Assignments
0 Petitions
Accused Products
Abstract
Alternative routes to an optimal route may be determined and presented to a user via a computing device. Alternative routes are selected from candidate routes that meet admissibility criteria. In an implementation, admissibility of a candidate route (in order for it to be considered an alternative route) may be determined based on three criteria: “limited sharing”, “local optimality”, and “stretch” such as “uniformly bounded stretch”. Limited sharing refers to the amount of difference between the alternative route and the optimal route, local optimality refers to lack of unnecessary detours, and uniformly bounded stretch refers to a length of the shortest path to travel between two points on the alternative route.
26 Citations
19 Claims
-
1. A method of determining a route between two locations, comprising:
-
receiving a start location and a destination location at a computing device; determining, by the computing device, an optimal route between the start location and the destination location using a map routing service of the computing device; determining a plurality of alternative routes between the start location and the destination location by the map routing service of the computing device using the optimal route and a plurality of admissibility criteria comprising limited sharing, local optimality, and uniformly bounded stretch, wherein the limited sharing admissibility criteria is that a percentage of edges shared by the alternative route and the optimal route is less than a predetermined percentage; ranking, by the computing device, the plurality of alternative routes using each of the plurality of admissibility criteria; and outputting the ranked plurality of alternative routes by the computing device. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of determining a route between two locations, comprising:
-
determining, by a computing device, an optimal route between a start location and a destination location using a map routing service of the computing device; determining a plurality of single via paths between the start location and the destination location by the computing device; evaluating the single via paths against a plurality of admissibility criteria, by the computing device, wherein the plurality of admissibility criteria includes limited sharing, and the limited sharing criteria is that a percentage of edges shared by an alternative route and the optimal route is less than a predetermined percentage; outputting, by the computing device, a plurality of alternative routes based on the single via paths of the plurality of single via paths that are admissible with respect to the admissibility criteria, wherein the plurality of alternative routes are ranked by the computing device using each of the plurality of admissibility criteria. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A system comprising:
a processor configured to; determine a plurality of candidate routes between a start location and a destination location; prune the candidate routes to eliminate a portion of the candidate routes; rank the remaining candidate routes that remain after pruning based on each of a plurality of admissibility criteria; and output the highest ranked remaining candidate route that meets the plurality of admissibility criteria, wherein the admissibility criteria comprise limited sharing, local optimality, and stretch, wherein the limited sharing admissibility criteria is that a percentage of edges shared by an alternative route and the optimal route is less than a predetermined percentage. - View Dependent Claims (15, 16, 17, 18, 19)
Specification