Systems, functional data, and methods for generating a route
First Claim
Patent Images
1. A navigation system, comprising:
- a server adapted to generate a route from a starting location, one or more available locations, and an ending location, wherein each available location has an associated cost, and 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
a navigation device adapted to retrieve the route from the server via a communication channel.
0 Assignments
0 Petitions
Accused Products
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.
174 Citations
28 Claims
-
1. A navigation system, comprising:
-
a server adapted to generate a route from a starting location, one or more available locations, and an ending location, wherein each available location has an associated cost, and 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 a navigation device adapted to retrieve the route from the server via a communication channel. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A navigation system, comprising:
-
a mass storage device adapted to store navigation data; a server adapted to communicate with the mass storage device and 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 treap; and a navigation device adapted to retrieve the route from the server via a communication channel. - View Dependent Claims (11, 12, 13, 14, 15)
-
-
16. A navigation system, comprising:
-
a mass storage device adapted to store navigation data; a server adapted to communicate with the mass storage device and 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 treap; and a navigation device adapted to transmit the starting location and the ending location to the server and retrieve the route from the server via a wireless communication channel, the navigation device further including— a global positioning system (GPS) receiver for receiving signals transmitted from a plurality of GPS satellites; a processor for calculating, by triangulation, a position of the navigation device using the signals; a memory accessible by the processor for storing the route; and a display for displaying the route. - View Dependent Claims (17, 18, 19)
-
-
20. A navigation server for calculating a route between starting and ending locations and transmitting the route to a portable navigation device for navigating the route, the server comprising:
-
a mass storage device adapted to store navigation data; and a server processor adapted to communicate with the mass storage device and generate the route from the starting location, one or more available locations, and the 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 treap. - View Dependent Claims (21, 22, 23, 24)
-
-
25. A portable navigation device for navigating a route between starting and ending locations, the device comprising:
-
a global positioning system (GPS) receiver for receiving signals transmitted from a plurality of GPS satellites; a processor for calculating, by triangulation, the starting location using the signals; an input for receiving indication of the ending location from a user; a display for displaying the route between the starting and ending locations; and a transceiver for receiving the route from a server, wherein the server includes— a mass storage device adapted to store navigation data, and a server processor adapted to communicate with the mass storage device and generate the route from the starting location, one or more available locations, and the 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. - View Dependent Claims (26, 27, 28)
-
Specification