Garmin Corporation

Darin J Beesley

Michael E Childs

Stephen C Robinson

Thomas H Walters

Min H Kao

Chunyen Liu

Jay Dee Krull

A method and apparatus are provided for estimating an impedance through a node at an intersection between roads in a roadway network. The impedance may be measured in time or distance, for example. Characteristic information describes at least one feature of the intersecting roads. One or more pieces of characteristic information may impact the impedance of traffic through an intersection and are used to estimate the impedance through the node. Examples of characteristic information are speed information, road-type, network routing level, intersection angle information, one-way, and cross traffic turn information. An impedance factor, or a cost, is assigned to each piece of characteristic information. The cost may be positive if the characteristic information adds impedance to the node, or negative if the characteristic information subtracts impedance from the node.

System and method for estimating impedance time through a road network

PDA systems, devices and methods are provided to account for insignificant route segments to enhance a route guidance experience. A PDA is provided according to one aspect. The PDA includes a processor and a memory adapted to communicate with the processor. The processor and memory are adapted to cooperate to provide route guidance that accounts for insignificant route segments. According to various embodiments, insignificant route segments are accounted for by nullifying and/or modifying route guidance maneuvers associated with the insignificant route segments. Other aspects are provided herein.

Guidance with feature accounting for insignificant roads

Systems, devices and methods are provided to account for insignificant route segments to enhance a route guidance experience. An electronic navigational aid device is provided according to one aspect. The device includes a processor and a memory adapted to communicate with the processor. The processor and memory are adapted to cooperate to provide route guidance that accounts for insignificant route segments. According to various embodiments, insignificant route segments are accounted for by nullifying and/or modifying route guidance maneuvers associated with the insignificant route segments. Other aspects are provided herein.

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. The navigational aid device includes forced layer switching capabilities. The navigational aid device 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.

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

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.

Systems, functional data, and methods for generating a route

A method for organizing roadway network data in a memory storage device is provided. A data set indicative of a roadway network is provided. Proximity criteria for intersection nodes between the roads in the roadway network is identified. The intersection nodes are grouped into a node block based on the proximity criteria. Node records which contain data indicative of the nodes are stored as a group in the node block in contiguous memory.

System and method for creating and organizing node records for a cartographic data map

Devices, systems, functional data and methods are provided for an improved route generation in navigational enabled devices. The navigational device with route generation capabilities includes a processor communicating with a memory. The memory includes a current location of the device, one or more available locations, and a destination of the device. A display communicates with the processor and is capable of communicating at least a portion of a generated route for the device. 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.

Systems, devices and methods are provided to compress data, and in particular to code and decode data. One aspect of the present subject matter is a data structure. The data structure includes a field representing a decoding structure to decode canonical Huffman encoded data, and a field representing a symbol table. The decoding structure includes a field representing an accelerator table to provide a 2-deep direct-index lookup to provide high-frequency symbols for high-frequency data and to provide bracketing indices for low-frequency data. The decoding structure also includes a field for a binary search table to provide a low-frequency symbol index using a binary search bounded by the bracketing indices provided by the accelerator table. The symbol table is adapted to provide a symbol associated with the low-frequency index.

System and method for compressing data

Devices, systems, functional data and methods are provided for packing n-dimensional data. The navigational device with n-dimensional data packing capabilities includes a processor communicating with a memory. Packing n-dimensional data within one or more coordinate data. Each coordinate data includes n-dimensional data and a control data. The control data are operable to determine which n-dimensional data are active within the coordinate data. Furthermore, each coordinate data are compressed or packed.

Systems, functional data, and methods to pack n-dimensional data in a PDA

PDA devices, systems, functional data and methods are provided for an improved route generation. A PDA with route generation capabilities includes a processor communicating with a memory. The memory includes a current location of the PDA, one or more available locations, and a destination of the PDA. A display communicates with the processor and is capable of communicating at least a portion of a generated route for the PDA. Available locations are repetitively inspected 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.

Growing community of inventors

Overland Park, KS, United States of America

Darin J Beesley