Systems, functional data, and methods for generating a route
AssigneeGarmin Ltd.
InventorsMichael Childs, Darin J. Beesley
Life of this patent
Estimating the term…
Abstract
Devices, systems, functional data and methods are provided for an improved route generation in navigational enabled devices. In generating the route, the available locations are inspected repetitively and locations adjacent to a last selected location are inserted into a first data structure such that the first location of the first data structure is always a least cost location associated with all adjacent locations comprising the first data structure. The first location is then optionally inserted into a second data structure. The generated route includes the current location, one or more first locations, and the destination.
Claims28
A navigational device, comprising:
- a processor;
- a memory in communication with the processor;
- a display in communication with the processor;
- wherein the device dynamically generates a route path using the processor and the memory from a moveable location associated with the device to a destination of the device by repetitively dynamically expanding one or more adjacent locations and inserting the adjacent locations into a first data structure wherein one or more first locations of the first data structure are associated with a then existing least cost location in the route path, the route path is dynamically generated from the moveable location, the first locations of the first data structure, and the destination;
- and
- wherein at least a portion of the route path is dynamically communicated to the display.
A navigation system, comprising:
- a mass storage device adapted to store navigation data;
- a server adapted to communicate with the mass storage;
- and
- a navigation device adapted to communicate with and retrieve navigation data from the server via a communication channel, wherein the navigation device includes a processor in communication with a memory, wherein the processor and memory cooperate to:
- generate a projected route from a starting location, one or more available locations, and an ending location, wherein each available location has an associated cost and each available location is evaluated as the projected route is constructed if an available location is adjacent to a last inserted available location and has a least cost when compared to costs associated with all available adjacent locations, wherein adjacent locations are inserted into a first data structure such that a first location of the first data structure is a least cost location of the data structure, and wherein the first data structure is a treat.
A computer-readable medium encoded with functional data to select an optimal route, comprising:
- a beginning node representative of an initial geographic location;
- a destination node representative of a desired geographic location;
- an optimal route, wherein the optimal route is a path starting with the beginning node and including one or more selected intermediate nodes and ending with the destination node;
- and
- one or more available nodes wherein each available node includes a cost associated with including each available node in the path as one of the selected intermediate nodes, wherein as one or more of the available nodes become available for inspection the available nodes are organized as a first data structure, wherein a least cost available node is a first node of the data structure and wherein the first data structure is a treap.
A method of generating a projected route, comprising:
- receiving an initial starting location and an ending location;
- identifying one or more available locations existing between the starting location and the ending location;
- beginning with the stating location and proceeding to the ending location initiating a first evaluation by selecting one or more adjacent locations from the available locations and as one or more of the adjacent locations are selected inserting each of the selected adjacent locations into a first data structure, wherein a first location of the first data structure is always associated with a least cost location of the first data structure and the first data structure is a treap;
- and
- generating the projected route from the starting location, one or more of the selected adjacent locations which occupy the first location of the first data structure, and the ending location.
Dependencies are inferred from the claim text.