CN106017488B - A kind of group's trip route guidance method based on point of interest - Google Patents
A kind of group's trip route guidance method based on point of interest Download PDFInfo
- Publication number
- CN106017488B CN106017488B CN201610116107.1A CN201610116107A CN106017488B CN 106017488 B CN106017488 B CN 106017488B CN 201610116107 A CN201610116107 A CN 201610116107A CN 106017488 B CN106017488 B CN 106017488B
- Authority
- CN
- China
- Prior art keywords
- point
- interest
- section
- group
- value
- 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.)
- Expired - Fee Related
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/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3476—Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs
Abstract
The present invention discloses a kind of group's trip route guidance method based on point of interest, for the trip interest and path planning of the group trip each member of pedestrian, define point of interest, point of interest grade, the concept of point of interest satisfaction, and traffic congestion degree and section distance is combined to comprehensively consider path weight value, the route that a comparison is suitble to group pedestrian trip is finally searched out based on dijkstra's algorithm；The method of the invention can be according to group's row Man's Demands, and combine specific actual conditions, search out the path for being more suitble to group pedestrian trip.
Description
Technical field
The present invention relates to pedestrian's route guidance fields, more particularly to consider that group's pedestrian's trip route of pedestrian's point of interest is led
Draw method.
Background technique
Walking is the very common trip mode of one kind of people's trip, and especially in transport hub, walkway is large-scale
In market.In pedestrian's walking trip, the trip that is often carried out in a manner of group.The application herein determines group
Justice, group refers to two and more than two individuals, and in sociology, the application is with same interest, target and with parent
The people of category relationship becomes group, and group often has the characteristics that complete target and shared obligation and responsibility jointly.Group goes out
What the group in row did not referred to walks crowd together due to accidental of short duration approach in several pedestrian's walking processes, but
Referring to has certain social relationships, deliberately walks several pedestrians together, such as several friends, one family or a travel party
Deng.Group one skilled in the art has certain internal relations, and it oneself is a part as team that they, which will recognize that, they are not only
There is common destination, can all have certain coordinative role in the process of walking, but also has and get close to group one skilled in the art
Tendency, therefore a kind of special motion structure can be shown.
The pedestrian of group's trip has oneself unique property, and specific manifestation goes out following aspects:
1, group, group one skilled in the art have a common target, generally all can collective action, select identical path to reach
Destination.
2, individuality, each pedestrian suffers from the point of interest and comfort level of oneself in group, it is intended to which there are oneself for selection
Interested point carries out Path selection.
3, accessibility, pedestrian's trip are different from vehicle driving, they often have selection space is most short to arrive at the destination
Tendency.
4, submissiveness, the Path selection of group pedestrian, which is often shown in conjunction with more people's wills, to be determined.
Point of interest (PoI, Point of Interest): point of interest refers to that pedestrian has certain places during trip
The locality of certain demand generally comprises dining room, lavatory, market, bank, the plurality of classes such as bantam shop.Broadly,
As long as people are higher to its cognition degree, so that it may be considered as point of interest.During path-search, regard point of interest as special
Node storage.
Personal interest equally be influence pedestrian select path a key factor, pedestrian before travel, people
Plan the path of destination in advance according to personal interest.Such as in primary trip, traveler will arrive first lavatory, meal
The Room, multiple places such as bank, finally arrives at the destination again, and individual can make when going on a journey according to the hobby and route oneself of oneself
When determining path, carry out Path selection, but being directed to group trip pedestrian, situation will become complicated, different pedestrians in group
Respectively different interest is suffered from, how planning path is so that can satisfy majority is the content for being worth research.
Currently, the shortest route problem based on pedestrian's guiding has had the algorithm of many maturations, common path planning is calculated
Method has dijkstra's algorithm, Floyd algorithm, heuristic search algorithm etc..Wherein dijkstra's algorithm is most classic shortest path
Path search algorithm, it seeks shortest path by weight incremental order, has the characteristics that simple and clear, the resulting result of algorithm search
It is accurate to compare, and is a kind of common pedestrian path guiding algorithm.
Now in pedestrian carry out route guidance when, typically according to where single pedestrian starting point and its purpose
Point, carries out pathfinding by certain routing algorithm, and there has been no some effective pathfindings when for the pedestrian of group's trip
Method.
Summary of the invention
The present invention is in view of the above-mentioned problems, propose a kind of group's trip route guidance method based on point of interest, in D-algorithm
On the basis of consider group pedestrian trip during point of interest presence, to group pedestrian go on a journey when consider different pedestrians not
Integrated decision-making is carried out with point of interest satisfaction, traffic congestion degree and distance Multiple factors, more meets group's row to find one
The method in the path of people's demand.
The technical solution adopted by the present invention is that: a kind of group's trip route guidance method based on point of interest, comprising:
S1: determining each section weight, the section weight be point of interest satisfaction, traffic congestion degree and section distance it
With；
S2: each section weight determined according to step S1 need to look for path using dijkstra's algorithm.
Further, the step S1 further include: the first impact factor, the second impact factor, third impact factor；It is described
First impact factor is the weighting coefficient of point of interest satisfaction, and the second impact factor is the weighting coefficient of traffic congestion degree, third
Impact factor is section distance weighting coefficient；When calculating section weight, point of interest satisfaction is multiplied by the first impact factor and is somebody's turn to do
The influence value of section point of interest satisfaction, congested in traffic degree are multiplied by the second impact factor and obtain the influence of the road section traffic volume crowding
Value, section distance are multiplied by third impact factor and obtain the influence value of the section distance；By by the section point of interest satisfaction
The influence value of influence value, the influence value of traffic congestion degree and section distance is added to obtain section weight.
Further, the value of the point of interest satisfaction specifically: grade classification is carried out to point of interest, according to division
Grade carries out assignment to each point of interest satisfaction.
Further, the sampling process of the point of interest satisfaction comprises the steps of:
A1, statistic mass go out the point of interest of each member selection in administrative staff, carry out grade classification to obtained point of interest；
A2, assignment is carried out to each point of interest according to grade classification；
A3, according to the assignment of the obtained point of interest of step A2, each point of interest weight and the point of interest maximum value of setting, really
Determine using each point of interest as the value of the section point of interest satisfaction of end.
Further, each point of interest weight described in step A3 is specially the people that group goes out in administrative staff to select the point of interest
Number.
Further, the determination process of the road section traffic volume crowding are as follows: setting traffic congestion degree maximum value, according to real-time
The ratio of road section traffic volume crowding coefficient and traffic congestion degree maximum value, to using the point of interest as the road section traffic volume crowding of end
Carry out assignment；The traffic congestion degree maximum value is integer.
Further, the real-time section traffic crowding coefficient value range is 1 between traffic congestion degree maximum value
Integer.
Further, the determination process of the section distance are as follows: section distance maximum value is determined, according to practical road section length
The ratio of coefficient and section distance maximum value carries out assignment to section distance；The section distance maximum value is integer.
Further, the practical road section length coefficient value range is 1 integer arrived between section distance maximum value.
Further, the step S2 include it is following step by step:
S21: source point and point of destination are determined；
S22: using dijkstra's algorithm as foundation since source point, pathfinding is carried out；When seeking new target point, then to the point
Judged, if the point is point of interest, re-start pathfinding using the point as source point, if the point is general node, continues pathfinding；
S23: searching out point of destination, and pathfinding is completed.
Beneficial effects of the present invention: a kind of group's trip route guidance method based on point of interest of the present invention, for group
Go on a journey each member of pedestrian trip interest and path planning, define point of interest, point of interest grade, point of interest satisfaction it is general
It reads, and traffic congestion degree and section distance is combined to comprehensively consider path weight value, finally search out one based on dijkstra's algorithm
Compare the route of suitable group pedestrian trip；The method of the invention can be specific combining according to group's row Man's Demands
After actual conditions, the path for being more suitble to group pedestrian trip is searched out.
Detailed description of the invention
Fig. 1 is the primary group's travel route choice example schematic for only considering point of interest satisfaction.
Fig. 2 is classical dijkstra's algorithm flow chart.
Fig. 3 is a kind of group's trip route guidance method flow chart based on point of interest provided by the present application.
Fig. 4 is pathfinding figure provided by the present application.
Specific embodiment
For convenient for those skilled in the art understand that technology contents of the invention, with reference to the accompanying drawing to the content of present invention into one
Step is illustrated.
The technical solution of the present invention is as follows: a kind of group's trip route guidance method based on point of interest, comprising:
S1: determine that path weight value, the path weight value are true according to point of interest satisfaction, traffic congestion degree and section distance
It is fixed；
S2: the path weight value determined according to step S1 need to look for path using dijkstra's algorithm.
The group that the total weight in path is each section is defined in step sl goes out administrative staff's point of interest satisfaction, road section traffic volume
The sum of crowding and the tradeoff of section distance, if total weight is W, internode path weight is Wi, point of interest satisfaction is Pi, road
Section traffic congestion degree is Ci, section distance is Di.The rule of point of interest satisfaction is according to described above, traffic congestion degree between node
It is determined with reference to the density of stream of people in the section, distance is then determined according to apart from length.
Congested in traffic degree and total path can increase burden to pedestrian, and weight is bigger, and the desire for indicating walking is lower, and interest
Point satisfaction can increase pedestrian power, and weight is bigger, and the desire for indicating walking is higher, therefore in triplicity to considering together
Point of interest satisfaction is chosen into negative value when the total weight in path.The expression formula of weight defined herein are as follows:
Wherein, it is P that impact factor α, β, λ, which respectively corresponds point of interest satisfaction,i, road section traffic volume crowding is Ci, section distance
For DiThree factors；Depending on the selection as the case may be of impact factor, for example, can be indicated when some impact factor value is 0
Internode path weight WiIt is measured not against the correspondence factor, takes 1 can indicate path weight value only in accordance with this because usually measuring.
The different value of impact factor α, β, λ can be given in different situations more to adapt to reality, value
The influence for meaning that the factor chooses path more greatly is bigger.Due to Pi、Ci、DiDimension it is different, therefore the application is to Pi、Ci、
DiIt is normalized respectively, guarantees the additive property of three.
The application indicates point of interest satisfaction, P with PiTo indicate the point of interest satisfaction in section between certain two node.It is emerging
As one of the factor for influencing path weight value, the bigger expression pedestrian of numerical value more wants to hand over by this section of way with path interest point satisfaction
The influence of the factors such as logical crowding is opposite (degree of crowding is bigger, and pedestrian is more not desired to through this section of path), therefore the application is subsequent
When weighting total path weight, to point of interest satisfaction, this takes opposite number.
Point of interest satisfaction (Satisfaction of PoI): each in group due to the particularity of group trip pedestrian
Pedestrian has the point of interest of oneself, and the grade of point of interest is again different, causes to deposit when according to point of interest to select path
In complex problem, therefore the application will introduce the concept of point of interest satisfaction.It is for group trip pedestrian
One concept.It is a value, has indicated that the pedestrian group as group's trip is group to the group interest degree of some point of interest
The sum of the interest-degree of internal each pedestrian's point of interest.The classification of common point of interest and point of interest is to interest in the application combination table 1
Point satisfaction carries out following rule definition:
1) when there is member to have required to different grades of point of interest in group, point of interest is all considered, it cannot
Because there are higher ranked points of interest just directly to neglect junior point of interest；
2) it is directed to different points of interest, the application assigns point of interest different weights, and higher grade point of interest weight is more
Greatly, indicate that group pedestrian is more dense to the point of interest, the application is to A1、A2、A3It is a that the point of interest of grade, which successively assigns weight,1、
a2、a3, meet a1>a2>a3> 0, and a under normal circumstances1、a2、a3Three's difference is larger；
Point of interest grade (the Level of PoI): point of interest grade is for characterizing pedestrian during trip to emerging
The selection level of interest size of interest point.Generally, for different points of interest, the service and function of people are given provided by it
It is different, therefore different points of interest is also different the influence power of pedestrian.Reaction is expert on the person, will appear as pedestrian
To the selection desire degree of point of interest.For example, for numerous pedestrians, the problem of usually paying the utmost attention to of going to toilet, because
This lavatory as point of interest there are higher ranked；Some pedestrian wants first to remove net before going to destination for example in group pedestrian again
Play game for a moment, this is exactly non-essential selection for numerous pedestrians, therefore Internet bar as point of interest there are grades
It is lower.
If 3) have in group, several members are interesting to a certain point of interest, and the point of interest satisfaction of the point of interest will be multiplied by
Number of members, such as certain group have 3 members to want to go to passage in transit supermarket (etc. of destination altogether by n (n >=3) name member composition
Grade is A2Point of interest) do shopping, then a point of interest of the supermarket as the group, and the point of interest satisfaction of this point of interest is
3*a2；
4) generally using point of interest as path node, and point of interest regards the terminal in certain section of path as, the point of interest it is emerging
Interest point satisfaction is using the node as the path weight value in the section of end.The application indicates point of interest satisfaction, P with PiCome
Indicate the point of interest satisfaction in section between certain two node；I indicates that the section serial number between two adjacent nodes, the value of i are nature
Number.Point of interest satisfaction is as one of the factor for influencing path weight value, and the bigger expression pedestrian of numerical value more wants through this section of way, with road
The influence of the factors such as diameter traffic congestion degree is opposite (degree of crowding is bigger, and pedestrian is more not desired to through this section of path), therefore the application
When weighting total path weight, to point of interest satisfaction, this takes opposite number.
The common point of interest of table 1 and point of interest grade
Point of interest satisfaction PiNormalization process it is as follows:
11, the group that certain number is n goes on a journey, and collects each selected point of interest of member in group trip member, statistics
It selects the number of each point of interest as the weight of point of interest, grade classification is carried out to point of interest；
In conjunction with the actual conditions that people go on a journey, the application definition such as common point of interest in table 1 is classified as nine major class,
It is denoted as { Ii, the serial number of nine class point of interest of i；And point of interest grade is defined to different points of interest, it is followed successively by A from high in the end1、A2、A3
Grade, higher grade indicates more important, more to pay the utmost attention to.Specific grade classification is mainly according to artificial experience and a large amount of number
It carries out dividing according to statistics and obtains rank as shown in Table 1, can refer to the table when being divided every time and carry out corresponding interest
The division of point grade.
Grade is A1Foundation be health or trip problem or most of members that the point of interest influences whether member
The food problem etc. of common trend, therefore be necessary point of interest；Grade is A2Often groups of people have required and have certain
Influence, therefore be more necessary point of interest；Grade is A3Often very few people have it is required and influence less, therefore for it is non-must
Want point of interest.
12, according to defined point of interest rule, grade A1Point of interest value be a1, grade A2Point of interest value be
a2, grade A3Point of interest value be a3, point of indifference value is 0, and maximum value max is na1；
13, when there is n in group1Name member selection grade A1Point of interest when, will be using the node as end after normalization
The P in sectioniIt is assigned a value of n1a1/a1N=n1/n；
14, when there is n in group2Name member selection grade A2Point of interest when, will be using the node as end after normalization
The P in sectioniIt is assigned a value of n2a2/na1；
15, when there is n in group3Name member selection grade A3Point of interest when, will be using the node as end after normalization
The P in sectioniIt is assigned a value of n3a3/na1；
It, will be using the node as the P in the section of end if 16, certain node is not point of interestiIt is assigned a value of 0.
Congested in traffic degree (TCL, Traffic Congestion Level): the busy extent of traffic is reacted, actually may be used
It, can also be with the traffic current density in the section come in real time to be calculated with a certain vehicle by the time it takes when predetermined distance
It calculates.The application is generally called congested in traffic degree, C with CiIndicate road section traffic volume crowding between certain two node；I indicates two adjacent nodes
Between section serial number, the value of i is natural number.Congested in traffic degree CiNormalization, determine essentially according to following processes:
21, according to practical section situation, by CiMaximum value be defined as Cm, Cm is integer.The smaller expression section of value
Crowding is lower, and value is higher, and the crowding for indicating section is higher；
22, real-time section C is determinediCoefficient, it is assumed that be c, then normalize after be assigned a value of c/Cm.
The real-time section crowding in each section is divided into company according to sequence from small to large by statistical analysis by the application
Continuous section, section number are the integer number of [1, Cm], and the integer in each continuum and [1, Cm] according to from it is small to
Big relationship corresponds, i.e. the practical value of the coefficient c integer that is [1, Cm], and c value is bigger represents section crowding more
Greatly, otherwise section crowding is smaller.
Distance (Distance): referring to the distance that people, the vehicles pass by or cross, herein the path Zong Lu of the application
Journey is refered in particular to from departure place, and each node of approach arrives at the destination exercised total distance.Section distance refers to node and section
The distance in section between point.The application is generally called distance, D with DiIndicate the section distance between certain two node；I indicates two adjacent nodes
Between section serial number, the value of i is natural number.Section distance DiNormalization, determine essentially according to following processes:
31, according to practical section situation, by DiMaximum value be defined as Dm, all roads between Origin And Destination can be chosen
The maximum value of diameter, it will be appreciated by those skilled in the art that value here is only to illustrate present context, actually takes as Dm
Value can be set as the case may be, be not limited to a kind of this mode；Dm is integer.The smaller expression distance of value is shorter, and value is got over
Height indicates that distance is remoter；
32, actual section D is determinediCoefficient, it is assumed that be d, then normalize after be assigned a value of d/Dm.
The practical road section length in each section is divided into company according to sequence from small to large by statistical analysis by the application
Continuous section, section number are the integer number of [1, Dm], and the integer in each continuum and [1, Dm] according to from it is small to
The integer that big relationship one-to-one correspondence, the i.e. practical value of coefficient d are [1, Dm], and the bigger section distance that represents of d value is longer,
Otherwise section distance is shorter.
Certain scene is provided to be illustrated, specific as follows:
Assuming that there is a group to carry out group's trip, point of interest is supermarket, restaurant, bank, and each point of interest is each
There is 1 people to want to go to.Point of interest and point of interest tier definition presently in connection with the application, three points of interest are point of interest grade A2's
Point is registered, as shown in Fig. 2, there are two types of trip modes: (1) starting point → supermarket → restaurant → bank → destination.(2) starting point
→ supermarket → bank → restaurant → destination.At this time due to having neglected other path effects factors, it is full to only account for point of interest
Meaning degree, thus the application calculate each section group point of interest satisfaction as shown in Figure 1, white black two kinds of arrows indicate respectively two
The selection of kind trip mode, total weight of two kinds of Path selections are respectively as follows: -3a2+ x and -3a2+ y, wherein x and y respectively indicate two
Middle path go out the other influences routine weight value outside point of interest satisfaction weight and, then the size both judged chooses total power
Weight is lesser to be used as Path selection.
The Path selection of the application is carried out based on dijkstra's algorithm, classical dijkstra's algorithm flow chart such as Fig. 3
Shown, the application improves on the basis of dijkstra's algorithm becomes the group's trip route guidance method for considering point of interest, such as
Shown in Fig. 4, wherein set S expression has found out shortest path point set, set U expression does not find out shortest path point set, by Fig. 4
Flow chart can be seen that the detailed step of the application pathfinding are as follows:
41, start pathfinding, read map nodes information；
42, the value of impact factor α, β, λ as the case may be, are determined；
43, group member interest point information is acquired, node where point of interest is labeled in cartographic information, is calculated as
The point of interest satisfaction of the node of point of interest；
44, it determines traffic congestion degree C and section distance D between each node, and calculates in conjunction with point of interest satisfaction each
The section weight in section；
45, using dijkstra's algorithm as foundation since source point, pathfinding is carried out；
46, pathfinding process often seeks new target point in dijkstra's algorithm, judges the point, if the point is to have marked
The point of interest of note then re-starts pathfinding using the point as source point, and cancel the node points of interest attribute and interest similar with its
The points of interest attribute of point, recalculates the weight in the section that has an impact, concrete processing procedure will illustrate in subsequent step 57
It is bright；If the point is general node, continue pathfinding；
47, point of destination is searched out, pathfinding is completed.
To be further illustrated to present context, by taking Fig. 4 as an example, for certain current map and its nodal information.A-F
For map nodes, B, C point are hospital, and D is supermarket, it is assumed that the 3 people team is F point from A point, destination, there is the interest of 1 people
Point is hospital, and the point of interest of 2 people is supermarket.
The choosing value of impact factor: choosing α, β, λ is respectivelyThen point of interest satisfaction, traffic congestion degree, road
The impact factor of Cheng Sanzhe is consistent, i.e., three is the same for the importance of pathfinding.
Assumed group goes on a journey number as 3 people.Set point of interest grade A1、A2、A3The corresponding a of point of interest1、a2、a3Do not return
Respectively 4,2,1 when one change, the point of interest of higher grade point of interest is satisfied with angle value can be bigger.
The choosing value of congested in traffic degree: choosing Cm is 3, then the C after normalizingiValue be
The choosing value of section distance: choosing Dm is 3, then the D after normalizingiValue be
The determination of point of interest satisfaction: being obtained by Given information, and the point of interest satisfaction of B, C point isD point it is emerging
Interest puts satisfaction
The determination of congested in traffic degree and section distance: such as Fig. 4, section is divided into AB, AC, BC, BD, CD, CE, DE, DF, EF.
The congested in traffic degree and section distance in these sections are respectively as follows:
By weight computing formula:
To calculate the total weight value in each section: for AB sections,According to formula
The total weight value that each section can successively be obtained isIt is more straight in order to seem
It is white, items can be made to become integer multiplied by 9, calculate the total weight information in each section after arranging as marked in Fig. 4.
Pathfinding process in conjunction with Fig. 4 is as follows:
Start pathfinding according to Fig. 4, process is as follows:
51, start pathfinding, read map nodes information；
52, the value of α, β, λ as the case may be, are determined；
53, group member interest point information is acquired, node where point of interest is labeled in cartographic information, is calculated as
The point of interest satisfaction of the node of point of interest is B, C, D point in figure；
54, traffic congestion degree C between each node and section distance D are determined, and point of interest satisfaction is combined to calculate
The path weight value in each section out, marks in figure；
55, using dijkstra's algorithm as foundation since source point, pathfinding is carried out, having found out set of minimal paths is S, is not asked
Set of minimal paths is U out, and A is source point, point for the purpose of F；
56, S=<A>, shortest path A->A=0 starts to look for using A as intermediate point.U=<B, C, D, E, F>.A- > B=2, A-
> C=1, A- > other=∞, then A- > C is most short；
57, judge C point, be point of interest hospital, then using C as starting point, and remove promising hospital point of interest, and count again
Calculate the section weight of these points, that is, B point as shown in Figure 4 is also the point of interest for being all hospital, then cancels the points of interest attribute of B point,
There are BC, BD in the section being connected with B point, then the weight of section BC and BD is recalculated according to step 44；
It 58, is according to progress pathfinding, according to 6,7 rule weights with dijkstra's algorithm using C point as source point after the completion of calculating
This multiple process；
59, pathfinding is completed, obtaining a shortest path is A- > C- > D- > F.With actually combining, sought according to algorithm
Path also substantially meet pedestrian's demand.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.For ability
For the technical staff in domain, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made
Any modification, equivalent substitution, improvement and etc. should be included within scope of the presently claimed invention.
Claims (8)
1. a kind of group's trip route guidance method based on point of interest characterized by comprising
S1: determine that each section weight, the section weight are the sum of point of interest satisfaction, traffic congestion degree and section distance；
S2: each section weight determined according to step S1 need to look for path using dijkstra's algorithm；
The step S1 further include: the first impact factor, the second impact factor, third impact factor；First impact factor
For the weighting coefficient of point of interest satisfaction, the second impact factor is the weighting coefficient of traffic congestion degree, and third impact factor is road
Duan Lucheng weighting coefficient；When calculating section weight, point of interest satisfaction is multiplied by the first impact factor, and to obtain the section point of interest full
The influence value of meaning degree, congested in traffic degree are multiplied by the second impact factor and obtain the influence value of the road section traffic volume crowding, section distance
It is multiplied by third impact factor and obtains the influence value of the section distance；By by the influence value of the section point of interest satisfaction, traffic
The influence value of crowding and the influence value of section distance are added to obtain section weight；
The sampling process of the point of interest satisfaction comprises the steps of:
A1, statistic mass go out the point of interest of each member selection in administrative staff, and carry out point of interest mark, to obtained point of interest
Carry out grade classification；
A2, assignment is carried out to each point of interest according to grade classification；
A3, according to the assignment of the obtained point of interest of step A2, each point of interest weight and the point of interest maximum value of setting, determine with
Each point of interest is the value of the section point of interest satisfaction of end；
Each point of interest weight described in step A3 is specially the number that group goes out in administrative staff to select the point of interest.
2. a kind of group's trip route guidance method based on point of interest according to claim 1, which is characterized in that described
The value of point of interest satisfaction specifically: grade classification is carried out to point of interest, according to the grade of division to each point of interest satisfaction
Carry out assignment.
3. a kind of group's trip route guidance method based on point of interest according to claim 1, which is characterized in that described
The determination process of road section traffic volume crowding are as follows: setting traffic congestion degree maximum value, according to real-time section traffic crowding coefficient and
The ratio of congested in traffic degree maximum value carries out assignment to by the road section traffic volume crowding of end of the point of interest；The traffic is gathered around
Squeezing degree maximum value is integer.
4. a kind of group's trip route guidance method based on point of interest according to claim 3, which is characterized in that described
Real-time section traffic crowding coefficient value range is 1 integer arrived between traffic congestion degree maximum value.
5. a kind of group's trip route guidance method based on point of interest according to claim 1, which is characterized in that described
The determination process of section distance are as follows: section distance maximum value is determined, according to practical road section length coefficient and section distance maximum value
Ratio, to section distance carry out assignment；The section distance maximum value is integer.
6. a kind of group's trip route guidance method based on point of interest according to claim 5, which is characterized in that described
Practical road section length coefficient value range is 1 integer arrived between section distance maximum value.
7. a kind of group's trip route guidance method based on point of interest according to claim 1, which is characterized in that described
Step S2 include it is following step by step:
S21: source point and point of destination are determined；
S22: using dijkstra's algorithm as foundation since source point, shortest path section is found；When seeking new target point, then to the point
Judged, if the point is point of interest, re-start pathfinding using the point as source point, if the point is general node, continues pathfinding；
S23: searching out point of destination, and pathfinding is completed.
8. a kind of group's trip route guidance method based on point of interest according to claim 7, which is characterized in that described
Step S22 further include: when finding new target point is point of interest, then cancel the mark of other same point of interest, and according to step
Rapid S1 recalculates the node to be cancelled mark as the section weight of beginning or end.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610116107.1A CN106017488B (en) | 2016-03-02 | 2016-03-02 | A kind of group's trip route guidance method based on point of interest |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610116107.1A CN106017488B (en) | 2016-03-02 | 2016-03-02 | A kind of group's trip route guidance method based on point of interest |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106017488A CN106017488A (en) | 2016-10-12 |
| CN106017488B true CN106017488B (en) | 2019-05-21 |
Family
ID=57082853
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610116107.1A Expired - Fee Related CN106017488B (en) | 2016-03-02 | 2016-03-02 | A kind of group's trip route guidance method based on point of interest |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106017488B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113393009B (en) * | 2020-03-11 | 2024-03-19 | 中国移动通信集团辽宁有限公司 | Path planning method and device for transmission pipeline and computing equipment |
| CN113175940A (en) * | 2021-04-26 | 2021-07-27 | 北京百度网讯科技有限公司 | Data processing method, device, equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1484581A2 (en) * | 2003-06-03 | 2004-12-08 | Robert Bosch Gmbh | System and method for calculating and/or for determining routes |
| CN101442466A (en) * | 2007-11-21 | 2009-05-27 | 华为技术有限公司 | Superpose network and implementing method |
| CN102788587A (en) * | 2011-05-19 | 2012-11-21 | 昆达电脑科技(昆山)有限公司 | Method for providing navigation path according to interesting points on navigation path and device related to the method |
| CN103995837A (en) * | 2014-04-25 | 2014-08-20 | 西北工业大学 | Personalized tourist track planning method based on group footprints |
| CN104391853A (en) * | 2014-09-25 | 2015-03-04 | 深圳大学 | POI (point of interest) recommending method, POI information processing method and server |
| CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
-
2016
- 2016-03-02 CN CN201610116107.1A patent/CN106017488B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1484581A2 (en) * | 2003-06-03 | 2004-12-08 | Robert Bosch Gmbh | System and method for calculating and/or for determining routes |
| CN101442466A (en) * | 2007-11-21 | 2009-05-27 | 华为技术有限公司 | Superpose network and implementing method |
| CN102788587A (en) * | 2011-05-19 | 2012-11-21 | 昆达电脑科技(昆山)有限公司 | Method for providing navigation path according to interesting points on navigation path and device related to the method |
| CN103995837A (en) * | 2014-04-25 | 2014-08-20 | 西北工业大学 | Personalized tourist track planning method based on group footprints |
| CN104391853A (en) * | 2014-09-25 | 2015-03-04 | 深圳大学 | POI (point of interest) recommending method, POI information processing method and server |
| CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
Non-Patent Citations (1)
| Title |
|---|
| 面向路径规划的导航路网数据模型研究;张静;《中国博士学位论文全文数据库 基础科学辑》;20110315(第3期);第67-76、82-83页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106017488A (en) | 2016-10-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bekhor et al. | Evaluation of choice set generation algorithms for route choice models | |
| JP5932030B2 (en) | Custom travel route system | |
| CN110428096A (en) | The more cross-channel Transportation Organization optimization methods of urban track traffic based on ticket information | |
| Rovelli et al. | From railways to greenways: A complex index for supporting policymaking and planning. A case study in Piedmont (Italy) | |
| CN108256669A (en) | A kind of scenic spot routing resource and system based on improvement dijkstra's algorithm | |
| Manaugh et al. | The importance of neighborhood type dissonance in understanding the effect of the built environment on travel behavior | |
| CN110413886A (en) | A kind of point of interest methods of exhibiting and device | |
| Sekar et al. | Uncertainty in multicommodity routing networks: When does it help? | |
| CN106017488B (en) | A kind of group's trip route guidance method based on point of interest | |
| Herzog et al. | Integrating route attractiveness attributes into tourist trip recommendations | |
| Pasandi et al. | Modified A* Algorithm integrated with ant colony optimization for multi-objective route-finding; case study: Yazd | |
| Decrop et al. | Decision strategies in tourism evaluation | |
| Ambrosino et al. | An algorithmic framework for computing shortest routes in urban multimodal networks with different criteria | |
| CN110222884A (en) | Station accessibility appraisal procedure based on POI data and the volume of the flow of passengers | |
| Sadeghi-Niaraki et al. | Multi-criteria decision-based model for road network process | |
| Heye et al. | Factors influencing the physical complexity of routes in public transportation networks | |
| El-Gharably et al. | Optimization using simulation of the vehicle routing problem | |
| CN108717640B (en) | Data processing method of travel information and electronic equipment | |
| Ludwig et al. | Comparison of simulated fast and green routes for cyclists and pedestrians | |
| Gunby et al. | A combined swarm system for the urban transit routing problem | |
| Ansofino et al. | The tourism destination competitiveness: Using the promethee gaia model | |
| Hochmair | Dynamic route selection in route planners | |
| Naharudin et al. | Framework for developing a spatial walkability index (SWI) for the light-rail transit (LRT) stations in Kuala Lumpur city centre using analytical network process (ANP) and GIS | |
| Mahdi et al. | Variables associated with the tourists’ activity chain: definition, grouping, and measurement approaches | |
| Cho et al. | Passenger search by spatial index for ridesharing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190521 |