CN110426052A - Method for obtaining path, system, equipment and computer readable storage medium - Google Patents

Method for obtaining path, system, equipment and computer readable storage medium Download PDF

Info

Publication number
CN110426052A
CN110426052A CN201910606071.9A CN201910606071A CN110426052A CN 110426052 A CN110426052 A CN 110426052A CN 201910606071 A CN201910606071 A CN 201910606071A CN 110426052 A CN110426052 A CN 110426052A
Authority
CN
China
Prior art keywords
target
access
path
function
benefit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910606071.9A
Other languages
Chinese (zh)
Other versions
CN110426052B (en
Inventor
周红磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Property and Casualty Insurance Company of China Ltd
Original Assignee
Ping An Property and Casualty Insurance Company of China Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ping An Property and Casualty Insurance Company of China Ltd filed Critical Ping An Property and Casualty Insurance Company of China Ltd
Priority to CN201910606071.9A priority Critical patent/CN110426052B/en
Publication of CN110426052A publication Critical patent/CN110426052A/en
Application granted granted Critical
Publication of CN110426052B publication Critical patent/CN110426052B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3461—Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of method for obtaining path, system, equipment and computer readable storage mediums.Method for obtaining path includes obtaining multiple target access places；The different routing diameter to be selected of multiple access order is formed according to multiple target access places, each routing diameter to be selected includes target access time and the access order in each target access place；It is scored according to the target access time in each target access place of each routing diameter to be selected and access order using the interests that preset interests function calculates each routing diameter to be selected；Interests are scored into highest routing diameter to be selected as target access path.Interests scoring is the numerical value for being quantified degree of fitting, route order resonable degree and the waiting time of the congestion level of each routing diameter to be selected, target access time and suitable access time, recommend user, the programme path in the way of this intelligent decision, user can access according to the access time each target access place of ordered pair in target access path, improve user and go out line efficiency.

Description

Path acquisition method, system, device and computer readable storage medium
Technical Field
The present invention relates to the field of path planning technologies, and in particular, to a method, a system, a device, and a computer-readable storage medium for acquiring a path.
Background
In the related art, the navigation system basically adopts an optimal path algorithm (dijkstra, Floyd-Warshall, etc.), which are planning algorithms that are both single-destination and static. The multi-destination planning and the real-time change of the road traffic flow (namely the weight of the path is influenced by factors such as flow congestion) make the navigation system of the existing static algorithm very weak, greatly influence the traveling efficiency of the user, and possibly cause the extra difficulty that survey personnel reach the survey area.
Disclosure of Invention
The embodiment of the invention provides a path acquisition method, a system, equipment and a computer readable storage medium.
In a first aspect, an embodiment of the present invention provides a path obtaining method, including:
acquiring a plurality of target access places;
forming a plurality of paths to be selected with different access orders according to a plurality of target access points, wherein each path to be selected comprises target access time and an access order of each target access point;
calculating benefit scores of the paths to be selected by using a preset benefit function according to target access time and access sequence of target access points of the paths to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating congestion degree, a second benefit sub-function for evaluating fitting degree of the target access time and proper access time, a third benefit sub-function for evaluating reasonability degree of route order and a fourth benefit sub-function for evaluating waiting time;
and taking the path to be selected with the highest profit score as a target access path.
In some embodiments, the calculating the benefit score of each to-be-selected path according to the target access time and the access order of each target access point of each to-be-selected path by using a preset benefit function includes:
according to each path R to be selectediEach target access location liThe access time and the access sequence of the route to be selected are obtained, and access data corresponding to each target access place of each path to be selected are obtained;
and substituting the access data corresponding to each target access point of each path to be selected into the interest function to obtain the interest score of each path to be selected.
In certain embodiments, the interest function F (R)i)＝a*F1(Ri)+b*F2(Ri)+c*F3(Ri)+d*F4(Ri) Wherein a is a first coefficient variable corresponding to the first interest sub-function, b is a second coefficient variable corresponding to the second interest sub-function, c is a third coefficient variable corresponding to the third interest sub-function, d is a fourth coefficient variable corresponding to the fourth interest sub-function,
the step of substituting the access data corresponding to the target access points of the paths to be selected into the profit function to obtain the profit scores of the paths to be selected comprises:
acquiring coefficient data including a first coefficient variable value a corresponding to the first coefficient variable, a second coefficient variable value B corresponding to the second coefficient variable, a third coefficient variable value C corresponding to the third coefficient variable, and a fourth coefficient variable value D corresponding to the fourth coefficient variable;
substituting the coefficient data and the access data corresponding to each target access point of each path to be selected into the interest function F (R)i) And obtaining the benefit score of each path to be selected.
In some embodiments, the calculating the benefit score of each to-be-selected path according to the target access time and the access order of each target access point of each to-be-selected path by using a preset benefit function includes:
dividing each path to be selected into a plurality of sub paths to be selected according to the access sequence;
and calculating the benefit subfunction scores of the sub paths to be selected of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of the target access points of the paths to be selected, and taking the sum of the benefit subfunction scores of the sub paths to be selected of the paths to be selected as the benefit score of the paths to be selected.
In some embodiments, the forming a plurality of paths to be selected with different access orders according to the plurality of target access points includes:
obtaining an access sequence requirement, wherein the access sequence requirement comprises an access sequence of at least two target access points;
and arranging the target access places according to different access orders according to the access order requirements to obtain a plurality of access order chains, and taking access paths corresponding to the access order chains as paths to be selected.
In some embodiments, the path acquisition method includes:
acquiring a plurality of target positions and starting points;
dividing the target locations into N groups to be planned according to the sequence of the distances from the target locations to the starting point from near to far, wherein each group to be planned comprises at least 2 target locations;
sequentially taking the target location in each group to be planned as the target access location according to the sequence from near to far from the starting point and obtaining a corresponding target access path;
and sequentially connecting the target access paths corresponding to the groups to be planned according to the sequence from the near to the far from the starting point to obtain the target path.
In some embodiments, the first benefits subfunctionWherein, pop (l)i)＝n(li) N (total), where n is the number of target access points, n (l)i) Visit location l for a targetiN (total) is the total number of persons in the area where the target visit place is located;
the second interests sub-functionWherein, a distribution function of the number of the historically visited persons at each time corresponding to the target visiting location li, G (t)i；ti，σ2) For a target access time tiTarget visit location liThe proper access reference function of G (t)i；ti，σ2) Obeying a Gaussian distribution with σ as the target visit location liThe standard deviation of the number of historical visitors at N time points, at least one time point in the N time points and the target visit time tiCorresponding;
the third interest subfunction F3(Ri)＝(puni(Ri)+pbin(Ri)+ptri(Ri))/3，
Wherein,
p(li) To access a path R to be selectediTarget visit location l iniProbability of p (l)i|li-1) Visiting location l for visiting targeti-1Thereafter visiting the target visit location liProbability of p (l)i|li-1 li-2) Visiting location l for visiting targeti-1And a target visit location li-2Thereafter visiting the target visit location liThe probability of (d); and
the fourth benefits subfunctionWherein, vserverfor obtaining a target visit location l from historical dataiThe average queuing speed of (a) is,visit location l for a targetiWith the target visit location li-1A distance between vmoveFor obtaining a target visit location l from historical dataiWith the target visit location li-1Average speed of the road in between.
In a second aspect, an embodiment of the present invention further provides a path obtaining system, including:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a plurality of target access places;
the path to be selected determining module is used for forming a plurality of paths to be selected with different access orders according to the target access points, and each path to be selected comprises the target access time and the access order of each target access point;
the calculation module is used for calculating benefit scores of the paths to be selected by utilizing a preset benefit function according to the target access time and the access sequence of each target access point of each path to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating the congestion degree, a second benefit sub-function for evaluating the fitting degree of the target access time and the proper access time, a third benefit sub-function for evaluating the reasonability degree of the route rank and a fourth benefit sub-function for evaluating the waiting time;
and the first execution module is used for taking the path to be selected with the highest profit score as the target access path.
In a third aspect, an embodiment of the present invention further provides an apparatus, including a processor, a memory, and an information recommendation program stored on the memory and executable by the processor, where the information recommendation program, when executed by the processor, implements the instructions of the steps in the path obtaining method according to any one of the foregoing embodiments.
In a fourth aspect, the present invention further provides a computer-readable storage medium, on which a path acquisition program is stored, wherein the path acquisition program, when executed by a processor, implements the path acquisition method described in any one of the above.
According to the technical scheme of the embodiment of the invention, a plurality of target access places are obtained; forming a plurality of paths to be selected with different access orders according to a plurality of target access points, wherein each path to be selected comprises target access time and an access order of each target access point; calculating benefit scores of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of each target access point of each path to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating the congestion degree, a second benefit sub-function for evaluating the fitting degree of the target access time and the proper access time, a third benefit sub-function for evaluating the reasonableness degree of the route order and a fourth benefit sub-function for evaluating the waiting time; and taking the path to be selected with the highest profit score as a target access path. Therefore, the benefit score is a numerical value obtained by quantifying the congestion degree of each path to be selected, the fitting degree of the target access time and the appropriate access time, the reasonable degree of the route order and the waiting time, each path to be selected is evaluated by the benefit score obtained by the benefit function, the path to be selected with the highest benefit score is selected as the target access path and recommended to the user, and therefore the user can access each target access place according to the access sequence of the target access path, and the travel efficiency of the user is improved.
Drawings
Some drawings to which embodiments of the present invention relate will be described below.
FIG. 1 is a schematic structural diagram of an apparatus according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a path obtaining method according to an embodiment of the present invention;
FIG. 3 is another schematic flow chart of a path obtaining method according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart illustrating a path obtaining method according to an embodiment of the present invention;
FIG. 5 is a schematic flow chart of a path obtaining method according to an embodiment of the present invention;
fig. 6 is a schematic flowchart of a path obtaining method according to an embodiment of the present invention;
FIG. 7 is a schematic structural diagram of a path acquisition system according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of a path acquisition system according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of another structure of a path acquisition system according to an embodiment of the present invention;
fig. 10 is a schematic diagram of another structure of the path acquisition system according to the embodiment of the present invention.
Detailed Description
The embodiments of the present invention will be described below with reference to the drawings.
Referring to fig. 1, fig. 1 is a schematic diagram of a hardware structure of an apparatus 100 according to an embodiment of the present invention. The device 100 includes a processor 101, a memory 102, an input output interface 103, and one or more programs stored in the memory 102 and configured to be executed by the processor 101, the programs including instructions to perform the steps of the path acquisition method of any of the following embodiments. The device 100 may be a server device or a terminal device. The memory 102 may be a high-speed RAM memory, or may be a non-volatile memory (e.g., a disk memory), and the memory 102 may optionally be a storage device independent of the processor 101. The input/output interface 103 may optionally include a USB interface, a standard wired interface, and a wireless interface (e.g., WI-FI interface).
Referring to fig. 2, fig. 2 is a schematic flow chart of a path obtaining method according to an embodiment of the present invention, where the path obtaining method includes, but is not limited to, the following steps:
01. acquiring a plurality of target access places;
the path acquisition method of the embodiment of the invention can be realized by the path acquisition system of the embodiment of the invention, and when a user needs to go to a plurality of places in continuous time, the plurality of places can be input by the path acquisition system and set as target access places.
02. Forming a plurality of paths to be selected with different access orders according to a plurality of target access points, wherein each path to be selected comprises target access time and an access order of each target access point;
after the path acquisition system acquires a plurality of target access points and starting points, a plurality of paths to be selected with different access orders are obtained by arranging the plurality of target access points according to different orders. The user can also set the departure time and the starting point through the path acquisition system. When the user inputs a starting point, the starting point input by the user is used as the starting point of the path to be selected, and when the user does not input the starting point, the path acquisition system defaults to use the current position as the starting point. The access time of each target access point of each path to be selected can be determined according to the relative position between every two adjacent target access points in each path to be selected, the starting time and the starting position. The user may or may not input the departure time. When the user inputs the departure time, the target access time can be a 24h or 12h system time point; when the user does not input the departure time, the target access time is a relative time difference with respect to the departure time point.
A visit order requirement can be obtained, the visit order requirement comprising a visit order of at least two target visit places; and arranging the target access points according to different access orders according to the access order requirements to obtain a plurality of access order chains, and taking the access paths corresponding to the access order chains as paths to be selected. Therefore, when a user has sequence requirements on a plurality of access points in the target access points, the access sequence requirements can be set, and the path acquisition system acquires a plurality of paths to be selected according with the access sequence requirements set by the user. Therefore, the target access path selected by the path acquisition system from the multiple paths to be selected better meets the requirements of the user.
03. Calculating benefit scores of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of each target access point of each path to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating the congestion degree, a second benefit sub-function for evaluating the fitting degree of the target access time and the proper access time, a third benefit sub-function for evaluating the reasonableness degree of the route order and a fourth benefit sub-function for evaluating the waiting time;
the benefit function may be formed mathematically from a combination of the first benefit sub-function, the second benefit sub-function, the third benefit sub-function, and the fourth benefit sub-function. For example, the sum of the first, second, third and fourth benefits subfunctions may be used as the benefit function, and the product of the first, second, third and fourth benefits subfunctions may be used as the benefit function. Of course, in other embodiments, the relationship between the benefit function and the first, second, third and fourth benefit sub-functions is not limited to the above categories, and the above examples are merely illustrative and should not be construed as limiting the present invention.
The first interest subfunction is used for evaluating the congestion degree of each target access point of each path to be selected at the corresponding access time. The second benefit sub-function is used for evaluating the access suitability of each target access point of each path to be selected at the corresponding access time, for example, a restaurant is suitable for being accessed at lunch time or dinner time, and if the access time corresponding to the restaurant in the path to be selected is lunch time or dinner time, the score corresponding to the second benefit sub-function is higher. The third profit sub-function is used to evaluate the reasonable degree of the route sequence, for example, the visit sequence of going to restaurant, then to store, and then to drink store is relatively reasonable, and the score corresponding to the third profit sub-function is relatively high. The fourth profit subfunction is used for evaluating the waiting time required for accessing each target access point of each path to be selected, wherein the waiting time comprises the time consumed in the process of going to the target access point and the queuing time required for realizing the function corresponding to the target access point.
In this embodimentIn the first interest subfunctionpop(li)＝n(li) N (total), where n is the number of target access points and n (l)i) Representing a target visit location liN (total) represents the total number of persons in the area where the target visit location is located. It will be appreciated that the target visit location liThe number of people n (l)i) The larger the probability that the target access point is congested, the larger pop (l)i) The larger, F1(Ri) The smaller, i.e. the smaller the first profilometer function. Number of people in target visit location n (l)i) And the area total number n (total) of the areas in which the target visit spots are located can be obtained from the relevant statistical departments.
Second benefits subfunctionWherein,
n pieces of historical visit record data corresponding to each time point of the target visit place can be collected to obtain a distribution function of the number of the historical visitors at each time corresponding to the target visit placeG(ti；ti，σ2) For a target access time tiThe proper access reference function of the target access points obeys Gaussian distribution, and the target access time t for accessing each target access point in the path to be selected can be obtained by analyzing the historical access record data of the target access pointsiAs an axis of symmetry, σ is the target access point liThe standard deviation of the number of historical visitors at N time points, at least one time point in the N time points and the target visit time tiAnd (7) corresponding. In the path to be selected, each object is plannedThe visiting order of the target visiting places can obtain the target visiting time t of visiting the target visiting places according to the departure time and the distance between the target visiting placesiWill tiInto DKLThe fitting degree of the target access time and the proper access time in each path to be selected can be obtained.
Third benefits subfunction F3(Ri)＝(puni(Ri)+pbin(Ri)+ptri(Ri))/3，
Wherein,
puni(Ri) Reference number of single point sequence interest for each target access point in the path to be selected, pbin(Ri) Two-point sequence benefit reference number, p, for two adjacent target access points in a path to be selected from one target access point to the nexttri(Ri) Three-point sequence benefit reference numbers for three continuous target access points in a path to be selected, wherein the three continuous target access points are from a first target access point to a next target access point and then to the next target access point.
p(li) To access a path R to be selectediTarget visit location l iniThe probability of (c). p (l)i|li-1) Visiting location l for visiting targeti-1Thereafter visiting the target visit location liProbability of p (l)i|li-1 li-2) Visiting location l for visiting targeti-1And a target visit location li-2Thereafter visiting the target visit location liThe probability of (c).
Can be obtained by analyzing a large number of samplesAccording to the method, the factors such as travel habits, routes and the like are comprehensively considered to obtain p (l)i)、p(li|li-1) And p (l)i|li-1 li-2). In one example, four target access locations A, B, C, D, the path to be selected including A → B → C → D, A → C → B → D, etc., then it will be appreciated that for the path to be selected A → B → C → D, the access order is A to B, B to C, C to D, i.e. A is the 1 st destination/, etc1And B is the 2 nd destination l2And C is the 3 rd destination l3D is the 4 th destination l4. Then, the path R to be selectediCorresponding to The above examples are merely illustrative, and are not intended to limit the present invention.
Fourth benefits subfunctionWherein, vserverfor obtaining a target visit location l from historical dataiThe average queuing speed of (a) is,visit location l for a targetiWith the target visit location li-1A distance between vmoveFor obtaining a target visit location l from historical dataiWith the target visit location li-1Average road speed in between, which may be understood as the speed on the way from the last destination visit location to the next destination visit location.
04. And taking the path to be selected with the highest profit score as a target access path.
The path obtaining method of the embodiment of the invention obtains a plurality of target access points; forming a plurality of paths to be selected with different access orders according to a plurality of target access points, wherein each path to be selected comprises target access time and an access order of each target access point; calculating benefit scores of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of each target access point of each path to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating the congestion degree, a second benefit sub-function for evaluating the fitting degree of the target access time and the proper access time, a third benefit sub-function for evaluating the reasonableness degree of the route order and a fourth benefit sub-function for evaluating the waiting time; and taking the path to be selected with the highest profit score as a target access path. Therefore, the benefit score is a numerical value obtained by quantifying the congestion degree of each path to be selected, the fitting degree of the target access time and the appropriate access time, the reasonable degree of the route order and the waiting time, each path to be selected is evaluated by the benefit score obtained by the benefit function, the path to be selected with the highest benefit score is selected as the target access path and recommended to the user, and therefore the user can access each target access place according to the access sequence of the target access path, and the travel efficiency of the user is improved.
Referring to fig. 3, in some embodiments, step 03 includes:
031. according to each path R to be selectediEach target access location liThe access time and the access sequence of the route to be selected are obtained, and access data corresponding to each target access place of each path to be selected are obtained;
can be selected according to each path R to be selectediEach target access location liThe access time and the access order of the path to be selected are obtained by using the access data required for calculating the benefit score of each path to be selected by using the benefit function. For example, a second benefits subfunction Wherein,then, N pieces of historical visit record data corresponding to each time point of the target visit place can be collected to obtain the distribution function of the number of the historical visitors at each time corresponding to the target visit placeCan be selected according to each path R to be selectediEach target access location liDetermines the respective target visit location liTarget access time tiThen access location/according to each targetiAccess time t ofiObtaining a target access time tiProper visit reference function G (t) of target visit locationi；ti,σ2) Analyzing historical visit record data of the target visit places to obtain target visit time t for visiting each target visit place in the path to be selectediAs an axis of symmetry, the target visit point liThe standard deviation of the number of historical visitors at the N time points of (a) is regarded as σ.
032. And substituting the access data corresponding to each target access point of each path to be selected into the benefit function to obtain the benefit score of each path to be selected.
After the access data corresponding to each target access point of each path to be selected is obtained, the corresponding access number is substituted into the benefit function to obtain the benefit score of each path to be selected, so that the path obtaining system can select the optimal path to be selected as the target access path according to the result of the benefit score.
Referring to FIG. 4, in some embodiments, based on the above embodiments, the interest function F (R)i)＝a*F1(Ri)+b*F2(Ri)+c*F3(Ri)+d*F4(Ri) Where a is a first coefficient variable corresponding to the first interest sub-function, b is a second coefficient variable corresponding to the second interest sub-function, c is a third coefficient variable corresponding to the third interest sub-function, and d is a second coefficient variable corresponding to the first interest sub-functionThe fourth coefficient variable corresponding to the four-benefits sub-function,
step 032 includes:
0321: acquiring coefficient data, wherein the coefficient data comprises a first coefficient variable value A corresponding to a first coefficient variable, a second coefficient variable value B corresponding to a second coefficient variable, a third coefficient variable value C corresponding to a third coefficient variable and a fourth coefficient variable value D corresponding to a fourth coefficient variable;
the first coefficient variable value a, the second coefficient variable value B, the third coefficient variable value C, and the fourth coefficient variable value D may be understood as weight values corresponding to the first interest sub-function, the second interest sub-function, the third interest sub-function, and the fourth interest sub-function, respectively. The first coefficient variable value A, the second coefficient variable value B, the third coefficient variable value C and the fourth coefficient variable value D can be set according to actual requirements. For example, the value may be set by the user according to the demand, and the first coefficient variable value a may be set to a larger value when the user considers that the congestion degree needs to be emphasized. The route obtaining system obtains the demand preference included in the route recommendation request input by the user, and sets a corresponding coefficient variable value according to the demand preference.
0322: substituting the coefficient data and the access data corresponding to each target access point of each path to be selected into a interest function F (R)i) And obtaining the benefit score of each path to be selected.
After the coefficient data and the access data corresponding to the target access points of the paths to be selected are obtained, the coefficient data and the corresponding access numbers are substituted into a benefit function to obtain benefit scores of the paths to be selected, and the benefit scores obtained according to the user requirement preference can better reflect the quality degree of the paths to be selected relative to the user requirement, so that the target access paths obtained by the path obtaining system better meet the user requirement.
Referring to fig. 5, in some embodiments, step 03 includes:
033. dividing each path to be selected into a plurality of sub paths to be selected according to the access sequence;
when the number of the target access places is too large, each path to be selected can be divided into a plurality of sub paths to be selected according to the access sequence. For example, when the target visit location is greater than or equal to the first preset number, each path to be selected may be divided into a plurality of sub-paths to be selected according to the visit order. This can reduce the data processing amount when the path acquisition system recommends a path. The upper limit value of the number of the target access points included in each sub-path to be selected may be set, for example, the number of the target access points included in each sub-path to be selected may be set to be less than or equal to a second preset number, and the second preset number is less than or equal to the first preset number. When each path to be selected is divided into a plurality of sub paths to be selected according to the access sequence, each path to be selected can be divided into a plurality of sub paths to be selected according to the access sequence according to a second preset number, wherein the number of target access points contained in each sub path to be selected is greater than or equal to 2 and is less than or equal to the second preset number.
034. And calculating the benefit subfunction scores of the sub paths to be selected of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of the target access points of the paths to be selected, and taking the sum of the benefit subfunction scores of the sub paths to be selected of the paths to be selected as the benefit score of the paths to be selected.
Therefore, each path to be selected is divided into a plurality of paths to be selected according to the access sequence, the benefit subfunction score of each path to be selected is calculated respectively, the benefit score of the corresponding path to be selected is obtained according to the benefit subfunction score, and the data processing amount of the path obtaining system in recommending the path can be reduced.
Referring to fig. 6, in some embodiments, the path obtaining method includes:
21. acquiring a plurality of target positions and starting points;
the plurality of target locations are set by the user according to requirements, and the starting point can be set by the user or determined by the path acquisition system according to the current position.
22. Dividing the target locations into N groups to be planned according to the sequence of the distances from the target locations to the starting point from near to far, wherein each group to be planned comprises at least 2 target locations;
for example, 8 target sites including the starting point P and A, B, C, D, E, F, G, H distributed from near to far from the starting point, A, B, C, D, E, F, G, H may be divided into 3 groups to be planned, which are { ABC }, { DE }, and { FGH }, respectively.
23. Sequentially taking the target location in each group to be planned as a target access location according to the sequence from near to far from the starting point and obtaining a corresponding target access path;
according to the above example, the target locations included in the three groups to be planned, namely { ABC }, { DE }, and { FGH } may be sequentially used as the target access locations, and the target access path corresponding to each group to be planned is obtained according to steps 01 to 04 in the above embodiment.
24. And sequentially connecting the target access paths corresponding to the groups to be planned according to the sequence from near to far from the starting point to obtain the target path.
If the target access path corresponding to { ABC } is A → C → B, the target access path corresponding to { DE } is E → D, and the target access path corresponding to { FGH } is G → H → F, then the target path is A → C → B → E → D → G → H → F.
It should be noted that the above examples are only for illustration and do not limit the present invention, and in other embodiments, the target locations and the to-be-planned groups are not limited to the above examples.
According to the path acquisition method of the embodiment, dynamic planning can be realized. The target access paths corresponding to the target access points can be obtained by taking a plurality of target points closest to the starting point as the target access points and fed back to the user, the user can access according to the target access paths, the next target points are taken as the target access points during the user access or when the user reaches the last target access point, the target access paths corresponding to the target access points are obtained and fed back to the user, and then the user accesses according to the target access paths until the target access paths corresponding to each target point are obtained. By means of the dynamic planning, the path can be planned while accessing, and the obtained target access path is better in timeliness and more reasonable.
Referring to fig. 7, an embodiment of the invention further provides a path obtaining system 300, including:
a first obtaining module 31, configured to obtain a plurality of target access points;
a to-be-selected path determining module 32, configured to form a plurality of to-be-selected paths with different access orders according to the plurality of target access points, where each to-be-selected path includes a target access time and an access order of each target access point;
the calculation module 33 is configured to calculate benefit scores of the routes to be selected by using a preset benefit function according to the target access time and the access sequence of each target access point of each route to be selected, where the benefit function includes a first benefit sub-function for evaluating a congestion degree, a second benefit sub-function for evaluating a degree of fitting between the target access time and an appropriate access time, a third benefit sub-function for evaluating a reasonable degree of a route rank, and a fourth benefit sub-function for evaluating a waiting time;
and the first execution module 34 is configured to use the path to be selected with the highest profit score as the target access path.
Referring to fig. 8, in some embodiments, the root calculation module 33 includes:
a first obtaining unit 331 for obtaining a path R according to each path to be selectediEach target access location liThe access time and the access sequence of the route to be selected are obtained, and access data corresponding to each target access place of each path to be selected are obtained;
the first calculating unit 332 is configured to substitute the access data corresponding to each target access point of each path to be selected into the benefit function to obtain a benefit score of each path to be selected.
In some embodiments, the interest function F (R)i)＝a*F1(Ri)+b*F2(Ri)+c*F3(Ri)+d*F4(Ri) Wherein a is a first interest subfunctionA first coefficient variable corresponding to a number, b a second coefficient variable corresponding to a second interest sub-function, c a third coefficient variable corresponding to a third interest sub-function, d a fourth coefficient variable corresponding to a fourth interest sub-function,
the first calculating unit 332 is specifically configured to:
acquiring coefficient data, wherein the coefficient data comprises a first coefficient variable value A corresponding to a first coefficient variable, a second coefficient variable value B corresponding to a second coefficient variable, a third coefficient variable value C corresponding to a third coefficient variable and a fourth coefficient variable value D corresponding to a fourth coefficient variable;
substituting the coefficient data and the access data corresponding to each target access point of each path to be selected into a interest function F (R)i) And obtaining the benefit score of each path to be selected.
Referring to fig. 9, in some embodiments, the calculation module 33 includes:
the splitting unit 333 is configured to split each path to be selected into multiple sub-paths to be selected according to the access order;
the second calculating unit 334 is configured to calculate, according to the target access time and the access order of each target access point of each path to be selected, a profit subfunction score of each path to be selected by using a preset profit function, and use a sum of the profit subfunction scores of each path to be selected as the profit score of each path to be selected.
In some embodiments, the to-be-selected path determining module 32 is specifically configured to:
acquiring a visit sequence requirement, wherein the visit sequence requirement comprises a visit sequence of at least two target visit places; and
and arranging the target access points according to different access orders according to the access order requirements to obtain a plurality of access order chains, and taking the access paths corresponding to the access order chains as paths to be selected.
Referring to fig. 10, in some embodiments, the path acquisition system 300 includes:
a second obtaining module 41, configured to obtain a plurality of target locations and starting points;
the planning module 42 is configured to divide the plurality of target locations into N groups to be planned according to a sequence from near to far from the starting point of each target location, where each group to be planned includes at least 2 target locations;
a path obtaining module 43, configured to sequentially use the target locations in each group to be planned as target access locations according to a sequence from near to far from the starting point and obtain corresponding target access paths;
and the second execution module 44 is configured to sequentially connect the target access paths corresponding to the groups to be planned according to the order from near to far from the starting point to obtain the target path.
In some embodiments, the first benefits subfunctionWherein, pop (l)i)＝n(li) N (total), where n is the number of target access points, n (l)i) Visit location l for a targetiN (total) is the total number of persons in the area where the target visit place is located;
second benefits subfunctionWherein, visit location l for a targetiCorresponding distribution function of the number of people accessing history at each moment, G (t)i；ti，σ2) For a target access time tiTarget visit location liIs the proper access reference function, the proper access reference function G (t)i；ti，σ2) Obeying a Gaussian distribution with σ as the target visit location liThe number of historical visitors at the N time pointsTolerance, at least one of the N time points and the target access time tiCorresponding;
third benefits subfunction F3(Ri)＝(puni(Ri)+pbin(Ri)+ptri(Ri))/3，
Wherein,
p(li) To access a path R to be selectediTarget visit location l iniProbability of p (l)i|li-1) Visiting location l for visiting targeti-1Thereafter visiting the target visit location liProbability of p (l)i|li-1li-2) Visiting location l for visiting targeti-1And a target visit location li-2Thereafter visiting the target visit location liThe probability of (d); and
fourth benefits subfunctionWherein, vserverfor obtaining a target visit location l from historical dataiThe average queuing speed of (a) is,visit location l for a targetiWith the target visit location li-1A distance between vmoveFor obtaining a target visit location l from historical dataiWith the target visit location li-1Average speed of the road in between.
The function implementation and technical effects of each module in the path obtaining system 300 correspond to each step in the embodiment of the path obtaining method, and the function and implementation process are not described in detail here.
The present invention further provides a computer-readable storage medium, in which a path acquisition program is stored, where the path acquisition program, when executed by a processor, implements the steps of the path acquisition method of any of the above embodiments.
The method and corresponding technical effects achieved when the path acquisition program is executed can refer to the embodiments of the path acquisition method of the present invention, and are not described herein again.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., compact disk), or a semiconductor medium (e.g., solid state disk), among others. In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is merely a logical division, and the actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted or not executed. In addition, the indirect coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, indirect coupling or communication connection of devices or units, and may be electrical or in other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage media may include, for example: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

Claims (10)

1. A method for path acquisition, comprising:
acquiring a plurality of target access places;
forming a plurality of paths to be selected with different access orders according to a plurality of target access points, wherein each path to be selected comprises target access time and an access order of each target access point;
calculating benefit scores of the paths to be selected by using a preset benefit function according to target access time and access sequence of target access points of the paths to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating congestion degree, a second benefit sub-function for evaluating fitting degree of the target access time and proper access time, a third benefit sub-function for evaluating reasonability degree of route order and a fourth benefit sub-function for evaluating waiting time;
and taking the path to be selected with the highest profit score as a target access path.
2. The method according to claim 1, wherein the calculating the benefit score of each to-be-selected route according to the target visit time and the visit order of each target visit location of each to-be-selected route by using a preset benefit function comprises:
according to each path R to be selectediEach target access location liThe access time and the access sequence of the route to be selected are obtained, and access data corresponding to each target access place of each path to be selected are obtained;
and substituting the access data corresponding to each target access point of each path to be selected into the interest function to obtain the interest score of each path to be selected.
3. The path acquisition method according to claim 2, characterized in that said interest function F (R)i)＝a*F1(Ri)+b*F2(Ri)+c*F3(Ri)+d*F4(Ri) Wherein a is a first coefficient variable corresponding to the first interest sub-function, b is a second coefficient variable corresponding to the second interest sub-function, c is a third coefficient variable corresponding to the third interest sub-function, d is a fourth coefficient variable corresponding to the fourth interest sub-function,
the step of substituting the access data corresponding to the target access points of the paths to be selected into the profit function to obtain the profit scores of the paths to be selected comprises:
acquiring coefficient data including a first coefficient variable value a corresponding to the first coefficient variable, a second coefficient variable value B corresponding to the second coefficient variable, a third coefficient variable value C corresponding to the third coefficient variable, and a fourth coefficient variable value D corresponding to the fourth coefficient variable;
substituting the coefficient data and the access data corresponding to each target access point of each path to be selected into the interest function F (R)i) And obtaining the benefit score of each path to be selected.
4. The method according to claim 1, wherein the calculating the benefit score of each to-be-selected route according to the target visit time and the visit order of each target visit location of each to-be-selected route by using a preset benefit function comprises:
dividing each path to be selected into a plurality of sub paths to be selected according to the access sequence;
and calculating the benefit subfunction scores of the sub paths to be selected of the paths to be selected by using a preset benefit function according to the target access time and the access sequence of the target access points of the paths to be selected, and taking the sum of the benefit subfunction scores of the sub paths to be selected of the paths to be selected as the benefit score of the paths to be selected.
5. The method according to claim 1, wherein the forming a plurality of to-be-selected paths with different visiting orders according to the plurality of target visiting locations comprises:
obtaining an access sequence requirement, wherein the access sequence requirement comprises an access sequence of at least two target access points;
and arranging the target access places according to different access orders according to the access order requirements to obtain a plurality of access order chains, and taking access paths corresponding to the access order chains as paths to be selected.
6. The path acquisition method according to claim 1, characterized in that the path acquisition method comprises:
acquiring a plurality of target positions and starting points;
dividing the target locations into N groups to be planned according to the sequence of the distances from the target locations to the starting point from near to far, wherein each group to be planned comprises at least 2 target locations;
sequentially taking the target location in each group to be planned as the target access location according to the sequence from near to far from the starting point and obtaining a corresponding target access path;
and sequentially connecting the target access paths corresponding to the groups to be planned according to the sequence from the near to the far from the starting point to obtain the target path.
7. The path acquisition method according to any one of claims 1 to 6,
the first interests sub-functionWherein, pop (l)i)＝n(li) N (total), where n is the number of target access points, n (l)i) Visit location l for a targetiN (total) is the total number of persons in the area where the target visit place is located;
the second interests sub-functionWherein, visit location l for a targetiCorresponding distribution function of the number of people accessing history at each moment, G (t)i；ti，σ2) For a target access time tiTarget visit location liThe proper access reference function of G (t)i；ti，σ2) Obeying a Gaussian distribution with σ as the target visit location liThe standard deviation of the number of historical visitors at N time points, at least one time point in the N time points and the target visit time tiCorresponding;
the third interest subfunction F3(Ri)＝(puni(Ri)+pbin(Ri)+ptri(Ri))/3，
Wherein,
p(li) To access a path R to be selectediTarget visit location l iniProbability of p (l)i|li-1) Visiting location l for visiting targeti-1Thereafter visiting the target visit location liProbability of p (l)i|li- 1li-2) Visiting location l for visiting targeti-1And a target visit location li-2Thereafter visiting the target visit location liThe probability of (d); and
the fourth benefits subfunctionWherein, vserverfor obtaining a target visit location l from historical dataiThe average queuing speed of (a) is,visit location l for a targetiWith the target visit location li-1A distance between vmoveFor obtaining a target visit location l from historical dataiWith the target visit location li-1Average speed of the road in between.
8. A path acquisition system, comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a plurality of target access places;
the path to be selected determining module is used for forming a plurality of paths to be selected with different access orders according to the target access points, and each path to be selected comprises the target access time and the access order of each target access point;
the calculation module is used for calculating benefit scores of the paths to be selected by utilizing a preset benefit function according to the target access time and the access sequence of each target access point of each path to be selected, wherein the benefit function comprises a first benefit sub-function for evaluating the congestion degree, a second benefit sub-function for evaluating the fitting degree of the target access time and the proper access time, a third benefit sub-function for evaluating the reasonability degree of the route rank and a fourth benefit sub-function for evaluating the waiting time;
and the first execution module is used for taking the path to be selected with the highest profit score as the target access path.
9. An apparatus comprising a processor, a memory, and a path acquisition program stored on the memory and executable by the processor, wherein the path acquisition program when executed by the processor implements the steps of the path acquisition method of any of claims 1 to 7.
10. A computer-readable storage medium, having a path acquisition program stored thereon, wherein the path acquisition program, when executed by a processor, implements the steps of the path acquisition method of any one of claims 1 to 7.
CN201910606071.9A 2019-07-05 2019-07-05 Path acquisition method, system, equipment and computer readable storage medium Active CN110426052B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910606071.9A CN110426052B (en) 2019-07-05 2019-07-05 Path acquisition method, system, equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910606071.9A CN110426052B (en) 2019-07-05 2019-07-05 Path acquisition method, system, equipment and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN110426052A true CN110426052A (en) 2019-11-08
CN110426052B CN110426052B (en) 2024-07-09

Family

ID=68410313

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910606071.9A Active CN110426052B (en) 2019-07-05 2019-07-05 Path acquisition method, system, equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN110426052B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111105190A (en) * 2019-12-12 2020-05-05 北京旷视机器人技术有限公司 Method and device for determining site access sequence and electronic equipment
CN113408774A (en) * 2020-03-17 2021-09-17 北京京东振世信息技术有限公司 Route planning method and device, storage medium and electronic equipment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108197241A (en) * 2017-12-29 2018-06-22 东北大学 A kind of method for searching path based on user preference, system, storage medium and processor
CN109556621A (en) * 2017-09-27 2019-04-02 腾讯科技（深圳）有限公司 A kind of method and relevant device of route planning
CN109816315A (en) * 2019-02-22 2019-05-28 拉扎斯网络科技（上海）有限公司 Path planning method and device, electronic equipment and readable storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109556621A (en) * 2017-09-27 2019-04-02 腾讯科技（深圳）有限公司 A kind of method and relevant device of route planning
CN108197241A (en) * 2017-12-29 2018-06-22 东北大学 A kind of method for searching path based on user preference, system, storage medium and processor
CN109816315A (en) * 2019-02-22 2019-05-28 拉扎斯网络科技（上海）有限公司 Path planning method and device, electronic equipment and readable storage medium

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
周红磊: "情景感知的旅游路径规划算法研究", 中国优秀硕士学位论文全文数据库 信息科技辑, no. 7, pages 57 - 68 *
周红磊: "情景感知的旅游路径规划算法研究", 中国优秀硕士学位论文全文数据库 信息科技辑, vol. 7, no. 7, 31 July 2018 (2018-07-31), pages 57 - 68 *
王楠;周红磊;李金宝;黎玲利;: "基于用户需求的景点路线利益规划算法", 通信学报, no. 05, pages 189 - 198 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111105190A (en) * 2019-12-12 2020-05-05 北京旷视机器人技术有限公司 Method and device for determining site access sequence and electronic equipment
CN111105190B (en) * 2019-12-12 2024-01-23 北京旷视机器人技术有限公司 Method and device for determining site access sequence and electronic equipment
CN113408774A (en) * 2020-03-17 2021-09-17 北京京东振世信息技术有限公司 Route planning method and device, storage medium and electronic equipment

Also Published As

Publication number Publication date
CN110426052B (en) 2024-07-09

Similar Documents

Publication Publication Date Title
US8781729B2 (en) Identifying a route configured to travel through multiple points of interest
EP2947608A1 (en) Systems and methods for personalized multi-destination trip planning
US20090055208A1 (en) System and method for web-based customer check-in
JP4911536B2 (en) Regional information retrieval device, regional information retrieval device control method, regional information retrieval system, and regional information retrieval system control method
KR20180021883A (en) Navigation reference point determination and navigation method and apparatus, and storage medium
CN106875205B (en) Object selection method and device
KR101799973B1 (en) Apparatus and method for recommending meeting place
US20150127482A1 (en) Merchandise Recommendation System, Method and Non-Transitory Computer Readable Storage Medium of the Same for Multiple Users
CN111831899B (en) Navigation interest point recommendation method, device, server and readable storage medium
US10962377B2 (en) Utilizing a geo-locator service and zone servers to reduce computer resource requirements for determining high quality solutions to routing problems
US20240311419A1 (en) Access points for maps
JP5581167B2 (en) Shopping support system, server device, and shopping support program
CN106996790A (en) Route planning method and device
CN110426052A (en) Method for obtaining path, system, equipment and computer readable storage medium
US10600106B2 (en) Method of comparing goods or services from one or more websites
US20090231340A1 (en) Method and system for graphically displaying data
CN111866073A (en) Service site push analysis method and device, electronic equipment and storage medium
KR20150083673A (en) Method and apparatus for providing tour plan service
US20170358015A1 (en) User Location History Implies Diminished Review
CN109459051B (en) Route planning-based voice accompanying tour guide method and equipment
CN111753386B (en) Data processing method and device
JP6638265B2 (en) Information providing device, program
JP6229074B2 (en) Recommendation system, recommendation method and recommendation program
US20100057539A1 (en) Internet-based location intelligence system
US20200394690A1 (en) User recommendations and reviews using autonomous vehicle information

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant