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

Experience based navigation algorithm

A navigation algorithm and experience technology, applied in the field of car navigation, can solve the problem of complex algorithm, not necessarily the most time-saving, etc., to achieve the effect of shortening the navigation time

Inactive Publication Date: 2016-12-14
佛山市天地行科技有限公司
View PDF5 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Most of the existing algorithms are not only complex, but also take the shortest spatial distance of the path as the most optimal goal. Wait for certain and uncertain factors, so the shortest path is not necessarily the most time-saving and meets user needs

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
  • Experience based navigation algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0019] The experience-based navigation algorithm provided by the present invention comprises the following steps:

[0020] Step 1: Search for the corresponding experience data according to the starting point and ending point, travel date, specific time period, and car owner's tail number. The starting point is also the starting point. The user manually inputs the specified starting point or uses the GPS positioning function to locate the user's current location and designates it as the starting point. The end point is the destination specified by the user input. According to the date of travel, check the traffic restrictions on the road with the tail number of the car on that day, and discard the restricted road sections to obtain the corresponding result path.

[0021] Step 2: Extract trips. Among the resulting routes, due to the serious traffic jam in the...

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

The invention provides an experience based navigation algorithm which is as follows: according to a current location and a destination, searching to obtain a corresponding result path; according to the obtained corresponding result path and travel time, matching with experience paths of different time dimensions; comparing mileages and time for the obtained experience paths, and ranking the mileage and time in ascending order; and according to demands, choosing a path having a minimum mileage or spending the shortest time. The experience based navigation algorithm has the advantages that lots of experience paths exist in database are called, limiting conditions of the real-time traffic status, traffic controls, peak commuting time frames and other information are taken into consideration, according to the destination inputted by a user, user's specific demands are overall considered, proper paths are matched for the user to choose, and the navigation time is shortened.

Description

technical field [0001] The invention relates to the technical field of car navigation, in particular to an experience-based navigation algorithm. Background technique [0002] There are many path navigation algorithms: A* algorithm, Dijkstra algorithm, Floyd algorithm and so on. [0003] A* algorithm: A* algorithm, A* (A-Star) algorithm is the most effective method for solving the shortest path in a static road network. The closer the estimated value is to the actual value, the better the evaluation function can be obtained; Dijkstra algorithm: Yes A typical single-source shortest path algorithm is used to calculate the shortest path from a node to all other nodes. The main feature is to expand from the starting point to the outer layer until it reaches the end; Algorithm for the shortest path between multiple source points in a given weighted graph. [0004] Most of the existing algorithms are not only complex, but also take the shortest spatial distance of the path as 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
IPC IPC(8): G01C21/34
CPCG01C21/3446G01C21/3492
Inventor 何芝
Owner 佛山市天地行科技有限公司
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