Optimal ordered path query method based on interest point preference

A query method and technology of interest points, applied in the field of optimal ordered path query based on interest point preferences, can solve problems such as filtering-updating cannot be achieved

Pending Publication Date: 2021-03-16
SUN YAT SEN UNIV +1
View PDF1 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this patent cannot realize the filtering-updating process will be repeated until the optimal ordered path that satisfies the user's query requirements is found

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
  • Optimal ordered path query method based on interest point preference
  • Optimal ordered path query method based on interest point preference
  • Optimal ordered path query method based on interest point preference

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 2

[0042] image 3 is another road network example, in this road network, such as image 3 As shown in (a), the point of interest p 1 ,p 2 belongs to category c 1 , point of interest p 3 ,p 4 ,p 5 Belongs to category 2. All points of interest are rated as 100. The user gives the starting position of the query v s , the termination position v d , and the category score threshold is constrained as CT={1 ,70>,2 , 90>}. The weight of the dotted edge in the graph is the lower bound of the distance between the corresponding interest point pairs after node embedding using a suitable reference point for the graph. This example focuses on the execution flow of the loop optimal subpath.

[0043] In the filtering stage of the cyclic optimal sub-path, the guide path R is calculated using the distance lower bound and dynamic programming p ={v s ,p 1 ,p 3 , v d}, its cost is 50, such as image 3 (b) shown. Then in the update phase, expand according to the guide path, calculate...

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 optimal ordered path query method based on interest point preferences. The optimal ordered path query method based on interest point preferences can efficiently solve the problem of optimal ordered path query of a user under different interest point preferences. The method comprises a reference point inverted index and a cyclic optimal sub-path algorithm. The method comprises the following steps: firstly, selecting reference points for a road network, performing node embedding on interest points by using the reference points to obtain corresponding distance vectors, and constructing a reference point inverted index; the results are then searched using the cyclically optimal sub-paths. The cyclic optimal sub-path algorithm comprises two stages of filtering and updating, in the filtering stage, a guide path is rapidly obtained through the optimal sub-path algorithm based on dynamic planning, and then path extension is carried out according to the guide path in the updating stage. And the filtering and updating process is circularly carried out until the optimal ordered path meeting the query requirements of the user is found.

Description

technical field [0001] The present invention relates to the technical field of route planning, and more specifically, relates to an optimal ordered route query method based on interest point preference. Background technique [0002] With the development of smart phones and other devices and the wide application of big data, points of interest in urban road networks usually have ratings, and points of interest with higher scores tend to have better consumption quality. At the same time, users continue to put forward more personalized route query requirements, such as querying an optimal route starting from s to d, passing through restaurants, theaters and gas stations in succession, and specifying the scores of restaurants, theaters and gas stations visited respectively Not less than 4.0, 4.5 and 4.3. This kind of query that satisfies the user is the optimal ordered path query method based on the preference of points of interest. [0003] The optimal ordered path was first ...

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): G06F16/29G06F16/22G06F16/2455G06F16/9537
CPCG06F16/29G06F16/2228G06F16/2455G06F16/9537
Inventor 印鉴黎文彬朱怀杰刘威杨婵
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap