CPC G01C 21/20 (2013.01) [G01C 21/383 (2020.08); G01C 21/3881 (2020.08)] | 17 Claims |
1. A runtime pathfinding method for determining the shortest path between a start point and end point in a geo grid of level-n comprised of cells, comprising the steps of:
(a) determining, at runtime, a first child level cell associated with the start point;
(b) determining, at runtime, a second child level cell associated with the end point;
(c) determining, at runtime a first shortest path between the first child level cell associated with the start point and a first parent cell edge nearest to the start point;
(d) determining, at runtime a second shortest path between the second child level cell and a second parent cell edge nearest to the end point;
(e) extracting a pre-computed and cached shortest path between the first nearest parent cell edge and the second nearest parent cell edge;
(f) constructing, at runtime, the shortest path between the start point and the end point by adding cell paths obtained in (c), (d) and (e); and
(g) outputting the constructed shortest path between the start point and the end point.
|