Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Navigation devices and methods carried out thereon

A technology for navigating a route and a destination, which is applied to a navigation device and its implementation field, and can solve problems such as increasing the time for determining a route.

Active Publication Date: 2013-02-27
TOMTOM INT BV
View PDF6 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, if the user wants to use a different cost function than the one for which the minimum cost data has been determined, the routing must be determined from scratch, significantly increasing the time taken to determine the route

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Navigation devices and methods carried out thereon
  • Navigation devices and methods carried out thereon
  • Navigation devices and methods carried out thereon

Examples

Experimental program
Comparison scheme
Effect test

example

[0294] Example: Assume 100x10x5 precincts with the following partition: 100 precincts at coarse level 0, 10 precincts at intermediate level 1, and 5 precincts at detailed level 2.

[0295] In the file at level 0, the section containing the neighbor list will contain:

[0296] • A number of 100 indicating the length of the list of 100 regions at level 0. The number of bits is calculated according to BitsRequired (required bits) (longestListLength-shortestListLength (longest list length-shortest list length)). Each number is relative to the shortest list at that stage (the shortest list is stored in the header).

[0297] • Next is the content of 100 lists (100 pairs). The first element of each pair is encoded on 7 bits (because there are 100 regions at level 0), and the second element of each pair is encoded on 4 bits (because there are 10 regions at level 1) .

[0298] In the file at level 1, the section containing the neighbor list will contain:

[0299] · · 100 x 10 = 10...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.

Description

[0001] Cross References to Related Applications [0002] This application claims priority to US Provisional Patent Application No. 61 / 282,927, filed April 23, 2010, which is hereby incorporated by reference in its entirety. technical field [0003] The present invention relates to computerized methods and related systems for determining routes using map data. Specifically, but not exclusively, the method may be used in navigation devices to facilitate route planning. Background technique [0004] Known route planning algorithms (e.g., Dijkstra's method, A * method or Moore / Pape method). However, these route planning algorithms can be somewhat slow. An example of how the speed of this route planning can be increased is shown in US 6 636 800, the teaching of which is hereby incorporated herein by reference. US 6 636 800 teaches preprocessing map data by dividing a map into regions and determining a tree of shortest paths (minimum cost paths) to each region of the map. Th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/34
CPCG01C21/3492G01C21/34G01C21/3446G01C21/3626G01C21/3453
Inventor 海科·席林埃格尼·高里洛莫里茨·希尔格安德列亚斯·普洛福斯于尔根·韦贝尔亚历山德鲁·谢尔伯内斯库
Owner TOMTOM INT BV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com