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

Navigation route acquisition method, device and system

A technology of navigation route and acquisition method, applied in the field of navigation route acquisition, which can solve the problem of inability to support the needs of such products

Pending Publication Date: 2021-09-07
ALIBABA GRP HLDG LTD
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the existing technology based on single-path calculation targets cannot support such product requirements

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 route acquisition method, device and system
  • Navigation route acquisition method, device and system
  • Navigation route acquisition method, device and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] In a specific embodiment, in the navigation route acquisition method provided in the above embodiment, before performing the step of recalling the multi-calculated target navigation route, it may further include:

[0062] According to the route preference index carried in the route calculation request, determine the single route calculation target corresponding to the route preference index;

[0063] If there are more than two single-calculation targets determined, the step of recalling the multi-calculation target navigation route is executed.

[0064] In the embodiment of the present invention, the route preference index according to the user includes one or more of the following route preference indexes: the shortest travel time, the shortest driving distance, the least number of traffic lights, the least turning action, avoiding congestion, avoiding tolls, not going High speed and high speed priority. Different users have different route preferences. When a route c...

Embodiment 2

[0077] In a specific embodiment, the sorting of the multi-route target navigation route and the single-route target navigation route described in step S103 above to determine the recommended navigation route pushed to the user includes:

[0078] Input the at least one multi-path target navigation route and at least one single-calculation target navigation route into the trained sorting model, and output the sorting of the at least one multi-path target navigation route and at least one single-calculation target navigation route Score;

[0079] Sort according to the sorting score, and obtain the recommended navigation route pushed to the user.

[0080] In the embodiment of the present invention, the ranking score described may be that the ranking model calculates scores for the at least one multi-path target navigation route and the at least one single-calculation target navigation route, and outputs the ranking scores of each route. In the sorting model, sorting is performed ...

Embodiment 3

[0090] For a route calculation request, select a single-calculation target and use the Dijkstra algorithm to calculate the route. The single-calculation target navigation route obtained cannot meet the needs of the user for the navigation route when planning the route, because the user When using travel applications for navigation route planning, users have various requirements for routes. For example, users may consider road congestion, driving distance, driving time, and toll fees at the same time. Suppose, from the starting point s to the end point t, there are three routes p1, p2 and p3, wherein route p1={time=20 minutes, distance=10 kilometers}, route p2={time=12 minutes, distance=11 kilometers}, route p3={time=10 minutes, distance=18 kilometers}. If you choose the shortest single-calculated route target when performing route recall, and use the Dijkstra algorithm to calculate the route, you can recall the p1 route theoretically; choose the shortest single-calculated rout...

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 discloses a navigation route acquisition method, device and system. The method comprises the steps of: according to a route calculation request and at least one set of single-route calculation target weight combination, recalling a multi-route calculation target navigation route, wherein one set of single-route calculation target weight combination comprises weights corresponding to at least two single-route calculation targets respectively; recalling a single-route calculation target navigation route according to the route calculation request and the determined single-route calculation target; and sorting the multi-route calculation target navigation route and the single-route calculation target navigation route, and determining a recommended navigation route to be pushed to the user. According to the navigation route acquisition method, the problem that the obtained navigation route does not meet the navigation requirement of a user when the single-route target is used for recalling the single-route target navigation route in the prior art is solved.

Description

technical field [0001] The invention relates to the field of electronic map navigation, in particular to a navigation route acquisition method, device and system. Background technique [0002] In the prior art, the navigation route generally adopts the recall strategy of the single-calculated route target, sorts the multiple routes recalled for each single-calculated route target, and pushes them to the user. However, the route recalled according to the single calculation target recall strategy cannot realize the optimization of multiple route calculation targets at the same time, because the navigation route that satisfies multiple route calculation targets at the same time cannot be recalled preferentially according to the single calculation target target recall strategy. For example, when the route calculation goal is the shortest time or the shortest distance, the route with the shortest time or the shortest distance will be pushed to the user first, but it is not optima...

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/343G01C21/3461G01C21/3484G01C21/3492G01C21/3446
Inventor 赵睿刘岭岭徐龙飞程冉冀晨光刘凯奎
Owner ALIBABA GRP HLDG LTD
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