Systems and methods for a PDA with forced layer switching based on memory constraints

• US 6,694,256 B1
• Filed: 10/11/2002
• Issued: 02/17/2004
• Est. Priority Date: 12/20/2001
• Status: Active Grant

• Current Assignee: Garmin Limited
• Original Assignee: Garmin Limited
• Inventors: Childs, Michael E., Beesley, Darin J.
• Primary Examiner(s): Beaulieu, Yonel
• Application Number:
  US10/269,316
• Time in Patent Office: 494 Days
• Field of Search: 701/25, 701/208, 701/202, 701/209
• US Class Current: 701/209
• CPC Class Codes: G01C 21/3446 Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes

Abstract

Systems, devices and methods are provided for more efficient use of RAM and other resources in connection with a route calculation algorithm which quickly obtains a best or reasonable best path between two locations. A PDA includes forced layer switching capabilities. The PDA includes a processor and a memory adapted to communicate with the processor. The memory has cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations. The plurality of thoroughfares are organized in a hierarchy of detail levels. The processor operates on a route calculation algorithm to find a path between any two of the number of locations and the route calculation algorithm dynamically forces switching between different levels in the hierarchy of detail levels based on a set of criteria.

Claims

1. A personal digital assistant (PDA), comprising:

a calendar function;

an address book function;

a processor operable to communicate with a memory, the memory having cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations;

wherein the plurality of thoroughfares are organized in a hierarchy of detail levels; and

wherein the processor operates on a route calculation algorithm to find a path between any two of the number of locations, and wherein the route calculation algorithm forces switching between different levels in the hierarchy of detail levels based on a set of criteria.

2. The device of claim 1, wherein the memory includes a memory having a size of 512 Kilobytes or less.

3. The device of claim 1, wherein the hierarchy of detail levels includes a hierarchy of ever-decreasing detail levels such that a lowest level includes the greatest amount of detail.

4. The device of claim 1, wherein the set of criteria includes:

a number of jump segments requirement;

a distance requirement;

a minimum memory usage requirement;

a maximum memory usage requirement; and

an at least one jump segment requirement.

5. The device of claim 4, wherein the distance requirement includes a minimum distance requirement, the minimum distance requirement being at least 3 kilometers.

6. The device of claim 4, wherein the set of criteria are independently variable in order to tailor an aggressiveness with which the route calculation algorithm forces switching between different levels in the hierarchy of detail levels.

7. The device of claim 1, wherein PDA device includes a telecommunications functionality operable for transmitting voice data.

8. The device of claim 7, wherein the PDA includes a Bluetooth capability.

9. A handheld multifunction device with forced layer switching based on memory constraints, comprising:

a calendar function;

an address book function;

a processor operable to communicate with a memory, the memory having cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations;

wherein the plurality of types of thoroughfares are contained in a data structure organized in a hierarchy of detail layers; and

wherein the processor operates on a route calculation algorithm and the hierarchy of detail layers to find a convergence between any two of the number of locations, and wherein the route calculation algorithm forces switching to another layer in the hierarchy of detail layers based on a set of criteria, the set of criteria including a maximum memory usage requirement and an at least one jump segment requirement.

10. The device of claim 9, wherein the hierarchy of detail layers includes a hierarchy of ever-decreasing details such that a lowest layer includes the greatest amount of detail.

11. The device of claim 10, wherein the maximum memory usage requirement for the lowest layer is no greater than 35% of available space on the memory.

12. The device of claim 9, wherein the set of criteria further includes:

a number of jump segments requirement;

a distance requirement; and

a minimum memory usage requirement.

13. The device of claim 12, wherein the minimum memory usage requirement at a greatest layer of detail in the hierarchy of detail layers is at least 2% of available space on the memory.

14. The device of claim 9, wherein the presence of a type of thoroughfare in any given layer of the hierarchy of detail layers is determined by a traversability of the thoroughfare.

15. The device of claim 9, wherein the device further includes a display in communication with the processor and the memory and adapted to display a solution between any two of the number of locations.

16. A navigation aid method for forced layer switching based on memory constraints in a PDA, comprising:

in a PDA memory, organizing data indicative of thoroughfares of a plurality of types according to a hierarchy of detail layers, the thoroughfares of the plurality of types connecting a number of locations;

using a route calculation algorithm to find a convergence between any two of the number of locations; and

wherein using the route calculation algorithm includes forcing layer switching to another layer in the hierarchy of detail layers by assigning a set of criteria to the algorithm, the set of criteria including a maximum memory usage requirement and an at least one jump segment requirement.

17. The method of claim 16, wherein organizing in memory data indicative of thoroughfares of a plurality of types according to a hierarchy of detail layers includes organizing the thoroughfares of a plurality of types by layers ever-decreasing detail such that a lowest layer includes the greatest amount of detail.

18. The method of claim 17, wherein assigning a maximum memory usage requirement includes assigning a maximum memory usage requirement for the lowest layer equal to or less than 35% of available space on the memory.

19. The method of claim 18, wherein assigning a set of criteria to the algorithm includes assigning a set of criteria which further includes:

a number of jump segments requirement;

a distance requirement; and

a minimum memory usage requirement.

20. The method of claim 19, wherein the set of criteria are independently variable at each layer in the hierarchy of detail layers.

21. The method of claim 19, wherein assigning the minimum memory usage requirement at a greatest layer of detail in the hierarchy of detail layers is at least 2% of available space on the memory.

22. The method of claim 19, wherein organizing in memory data indicative of thoroughfares of a plurality of types according to a hierarchy of detail layers includes organizing the thoroughfares of a plurality of types by a traversability of the thoroughfares.

23. The method of claim 16, wherein the method includes a computer-accessible medium having executable instructions stored thereon capable of directing a processor to perform the method.

24. A navigation aid method for forced layer switching in a PDA, comprising:

in a PDA, using a data structure indicative of thoroughfares of a plurality of types organized according to a hierarchy of detail layers and having node locations connecting the thoroughfares of the plurality of types;

beginning at a first node location, evaluating a number of adjacent nodes for a convergence between a first node location and a second node location;

for each evaluated adjacent nodes, evaluating a next adjacent node;

maintaining a list of nodes having a jump segment to a next layer in the hierarchy of detail layers and maintaining a running total of nodes explored from a given jump segment node; and

forcing a layer switch in the hierarchy of detail layers based on a set of criteria.

25. The method of claim 24, wherein forcing a layer switch in the hierarchy of detail layers based on a set of criteria includes forcing a layer switch when at least one jump segment has been found and a maximum memory allowance has been utilized for a given layer, the maximum memory allowance for each given layer being independently variable.

26. The method of claim 25, wherein the method further includes preventing a layer switch in the hierarchy of detail layers until a requisite number of jump segments have been found in combination with a requisite number in the running total of nodes explored from a given jump segment node, a minimum distance from the first node location has been explored, and a minimum memory space has been utilized for a given layer.

27. The method of claim 26, wherein, in the method, forcing a layer switch preempts preventing a layer switch.

28. The method of claim 26, wherein the requisite number of jump segments in combination with a requisite number in the running total of nodes explored from a given jump segment node, the minimum distance from the first node location that has been explored, and the minimum memory space utilization are all independently variable for each given layer.

29. The method of claim 28, wherein each given layer includes a number of alternatives for the requisite number of jump segments and requisite number in the running total of nodes explored from a given jump segment node combinations.

30. The method of claim 24, wherein the method further includes, simultaneous with evaluating a number of adjacent nodes beginning at a first node location, beginning at a second node location and evaluating a number of adjacent nodes thereto for a convergence between a first node location and the second node location.

31. The device of claim 30, wherein the method further includes selecting a solution from a number of convergences between the first node location and the second node location.

32. A PDA navigation system for forced layer switching, comprising:

a server having a processor and memory, the memory having cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations, and wherein the plurality of types of thoroughfares are contained in a data structure organized in a hierarchy of detail layers;

wherein the processor operates on a route calculation algorithm and the hierarchy of detail layers to find a convergence between any two of the number of locations; and

wherein the route calculation algorithm dynamically forces switching to another layer in the hierarchy of detail layers based on a set of criteria, the set of criteria including a maximum memory usage requirement which is independently variable on a per layer basis.

33. The navigation system of claim 32, wherein the system further includes:

a mass data storage adapted to store navigation data; and

a PDA operable to communicate with and retrieve navigation data from the server via a communication channel, wherein the PDA includes a display operable to display a convergence between any two of the number of locations.

34. The navigation system of claim 33, wherein the communication channel includes a wireless channel.

35. The navigation system of claim 33, wherein the server includes a processor which is operable to respond to a request from the PDA by performing calculations on the cartographic data and transmitting results to the PDA.

36. The navigation system of claim 33, wherein the PDA is operable to communicate with and retrieve navigation data from the server using cellular communication technology.

37. A personal digital assistant (PDA), comprising:

a calendar function;

an address book function;

a processor operable to communicate with a memory, the memory having cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations;

means for organizing the plurality of thoroughfares in a hierarchy of detail levels;

means for operating on a route calculation algorithm to find a path between any two of the number of locations; and

means for a forced switching between different levels in the hierarchy of detail levels based on a set of criteria.