Unlock instant, AI-driven research and patent intelligence for your innovation.

Optimal group sequence path query method based on meeting point

A query method and path technology, applied in data processing applications, forecasting, computing and other directions, can solve problems such as low query efficiency, and achieve the effect of strong flexibility

Active Publication Date: 2020-02-21
SUN YAT SEN UNIV
View PDF6 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although this method can solve this multi-user query scenario, the query efficiency is very low, and the query time required when the target candidate points are large is unacceptable

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 group sequence path query method based on meeting point

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0032] A method for querying optimal group sequence paths based on meeting points, comprising the following steps:

[0033] S1: Initialize the OGSRM algorithm framework parameters λ, μ, h, ALGO-OSR and ALGO-AOSR;

[0034] S2: Initialize the optimal group order path variable routes to be empty;

[0035] S3: Use h to calculate the heuristic function values ​​of all meeting candidate points and arrange the candidate points in ascending order of their heuristic function values;

[0036] S4: Check each candidate point d in sequence according to the sequence of candidate points generated by S3, if the λ times of the heuristic function value of d is greater than or equal to the maximum value of the path in the current routes or all candidate points have been checked, go to S6, otherwise Continue to execute S4 after executing S5;

[0037] S5: The first μ×100% users use the ALGO-OSR algorithm to query, and the remaining users use the ALGO-AOSR algorithm to query. If the maximum value...

Embodiment 2

[0047] Such as figure 1 As shown, definition 1 (road network RN): road network RN=(V, E). The road network is an undirected graph, where V is the point set of RN, E is the edge set of RN, and the edge e belongs to E, and w(e) is expressed as the weight of e.

[0048] Definition 2 (Point of interest POI): A point of interest is a specific type of fixed point on the road network, and points of interest with the same type can be regarded as a type of point of interest.

[0049] figure 1 The POIs belonging to the supermarket category include {s1, s2, s3}, the POIs belonging to the gas station category include {g1, g2, g3}, and the POIs belonging to the restaurant category are {r1, r2}.

[0050] Definition 3 (Route): Define the route R in the road network=, where v1,v2,...,vn are

[0051] Definition 4 (optimal order path OSR): given a starting point s and end point d and the order of interest points that need to be visited sequentially C=, if a path R= exist and meet the inter...

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 an optimal group sequence path query method based on meeting points, and belongs to the technical field of path planning. According to the invention, optimal group sequence path query based on meeting points in a multi-user query scene can be efficiently processed. An OGSRM algorithm framework is provided, the framework can solve an optimal group order path based on meetingpoints and can also quickly solve a corresponding high-quality approximate solution, and in addition, the framework has very high flexibility and can use different candidate point heuristic functions, optimal order path algorithms and approximate optimal order path algorithms.

Description

technical field [0001] The present invention relates to the technical field of route planning, and more specifically, relates to a method for querying routes based on optimal group order of meeting points. Background technique [0002] With the maturity of location-based services, people can use more complex and personalized route query services, and optimal order route query is one of them. For example, user u starts from the starting point s, passes through banks and restaurants and finally arrives at the destination point d, the optimal path that meets the query requirements of user u is the optimal order path. [0003] Consider a multi-user path query scenario, such as user A and user B, user A starts from the starting point sA, needs to go through a bank, a supermarket, and finally meets user B in a restaurant, and user B needs to go to the gas station first when starting from the starting point sB You can meet user A in a restaurant after you stop. Now you need to cho...

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): G06Q10/04
CPCG06Q10/047Y02D10/00
Inventor 印鉴陈波朱怀杰
Owner SUN YAT SEN UNIV