System and method for accelerating route search
First Claim
1. A method, comprising:
- determining, by a device, whether a quantity of nodes in a set of nodes satisfies a first threshold;
clustering, by the device and based on determining that the quantity of nodes satisfies the first threshold, the set of nodes into a plurality of subgroups so that;
a quantity of nodes in each subgroup is no greater than a second threshold, anda maximum distance between any two nodes of a same subgroup is no greater than a third threshold,the second threshold and the third threshold being determined based on a computing capability of the device;
determining, by the device, intra group cost information for the plurality of subgroups,the intra group cost information being associated with a shortest path among all pairs of nodes that belong to a same subgroup;
determining, by the device, inter group cost information,the inter group cost information being associated with a shortest path between nodes of two subgroups; and
building, by the device and based on determining the intra group cost information and the inter group cost information, a graph of the set of nodes.
3 Assignments
0 Petitions
Accused Products
Abstract
A method for finding an approximation to the all-pairs shortest travel path between a number of predetermined nodes, comprising clustering nodes of an original road network into a plurality of subgroups so that the number of nodes in each subgroup is no greater than a first predetermined threshold and the maximum distance between any two nodes of a subgroup is no greater than a second predetermined threshold; adding information of intra group shortest paths for all pairs in a same subgroup to a newly created higher level road network; adding information of inter group shortest paths for the plurality of subgroups to the same road network; and searching the same road network for the shortest travel path. In those cases in which the path returned is not exact, the path represents one in the original map, even if not necessarily the best one.
-
Citations
20 Claims
-
1. A method, comprising:
-
determining, by a device, whether a quantity of nodes in a set of nodes satisfies a first threshold; clustering, by the device and based on determining that the quantity of nodes satisfies the first threshold, the set of nodes into a plurality of subgroups so that; a quantity of nodes in each subgroup is no greater than a second threshold, and a maximum distance between any two nodes of a same subgroup is no greater than a third threshold, the second threshold and the third threshold being determined based on a computing capability of the device; determining, by the device, intra group cost information for the plurality of subgroups, the intra group cost information being associated with a shortest path among all pairs of nodes that belong to a same subgroup; determining, by the device, inter group cost information, the inter group cost information being associated with a shortest path between nodes of two subgroups; and building, by the device and based on determining the intra group cost information and the inter group cost information, a graph of the set of nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer-readable medium storing instructions, the instructions comprising:
one or more instructions that, when executed by at least one processor, cause the at least one processor to; determine whether a quantity of nodes in a set of nodes satisfies a first threshold; cluster, based on determining that the quantity of nodes satisfies the first threshold, the set of nodes into a plurality of subgroups so that; a quantity of nodes in each subgroup is no greater than a second threshold, and a maximum distance between any two nodes of a same subgroup is no greater than a third threshold, the second threshold and the third threshold being determined based on a computing capability of the at least one processor; determine intra group cost information for the plurality of subgroups, the intra group cost information being associated with a shortest path among all pairs of nodes that belong to a same subgroup; determine inter group cost information, the inter group cost information being associated with a shortest path between nodes of two subgroups; and build, based on determining the intra group cost information and the inter group cost information, a graph of the set of nodes. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
18. A device comprising:
-
a memory; and at least one processor communicatively coupled to the memory to; determine whether a quantity of nodes in a set of nodes satisfies a first threshold; cluster, based on determining that the quantity of nodes satisfies the first threshold, the set of nodes into a plurality of subgroups so that; a quantity of nodes in each subgroup is no greater than a second threshold, and a maximum distance between any two nodes of a same subgroup is no greater than a third threshold, the second threshold and the third threshold being determined based on a computing capability of the device; determine intra group cost information for the plurality of subgroups, the intra group cost information being associated with a shortest path among all pairs of nodes that belong to a same subgroup; determine inter group cost information, the inter group cost information being associated with a shortest path between nodes of two subgroups; and build, based on determining the intra group cost information and the inter group cost information, a graph of the set of nodes. - View Dependent Claims (19, 20)
-
Specification