System and method for accelerating route search
US10119826B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 19, 2015 |
| Grant date | Nov 6, 2018 |
| Priority date | — |
| Expiry date | May 19, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/047
- WIPO fieldMeasurement
- WIPO sectorInstruments
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.