CN105588571A - Method and device for selecting the optimum path for crowd gathering - Google Patents
Method and device for selecting the optimum path for crowd gathering Download PDFInfo
- Publication number
- CN105588571A CN105588571A CN201410567745.6A CN201410567745A CN105588571A CN 105588571 A CN105588571 A CN 105588571A CN 201410567745 A CN201410567745 A CN 201410567745A CN 105588571 A CN105588571 A CN 105588571A
- Authority
- CN
- China
- Prior art keywords
- meeting
- rally
- attends
- target location
- information
- 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.)
- Pending
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
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)
- Navigation (AREA)
Abstract
A method for selecting the optimum path for crowd gathering is disclosed. The method includes acquiring participant information of participants, determining a plurality of object positions according to the participant information, determining shortest paths of the participants to the object positions, ranking crowd gathering consumption to the object positions according to the shortest paths of the participants to the object positions, and selecting a final object position and the optimum path for crowd gathering according to the ranking result. A device for selecting the optimum path for crowd gathering is also disclosed.
Description
Technical field
The present invention relates to mobile communication technology field, relate in particular to a cluster can optimal route selection method andDevice.
Background technology
Along with the quickening of modern urbanization process, people's doings are also more and more, friend, Tong ShijuMeeting, have a dinner party etc. becomes very general phenomenon, and due to distant between each rally member, group members needsWhile rally, after being all substantially first selected target place, each member arrives target ground voluntarily.
The benefit of above-mentioned rally mode is that target is clearer and more definite, and mode is simple; But shortcoming is also obvious: one,Real-time is bad, cannot accomplish to assemble timely, substantially needs the notice that shifts to an earlier date some hours; Two, byDo things in his own way in group members, group's cost summation is uncontrollable, cannot carry out budget estimation, particularly for unificationWhen clustering meeting, expense is had to the requirement condition of control, implement difficulty very large.
Summary of the invention
In view of this, the embodiment of the present invention expects to provide cluster meeting optimal route selection method and a device,When optimum rally path is provided for group members, can enter overall cost and the time of attending the meeting of the meeting of troopingRow is estimated, and real-time is good, reliability is high.
For achieving the above object, technical scheme of the present invention is achieved in that
The embodiment of the present invention provides a cluster meeting optimal route selection method, and described method comprises:
Obtain the member's that attends a meeting information about firms;
Determine multiple target locations according to described information about firms, and determine that the member that attends a meeting is to each target locationShortest path;
The member that attends a meeting described in foundation arrives the shortest path of each target location, and to rally, group arrives each target bitThe rally consumption of putting is sorted, and selects final goal position and the optimum road of trooping and understanding according to ranking resultsFootpath.
In such scheme, described in obtain the member that attends a meeting information about firms comprise: send that troop can request and locationGroup members in rally group is given in instruction, receives and extract the information about firms that member reports of respectively attending a meeting; Wherein,
Described information about firms comprises: the member's that attends a meeting positional information and require information.
In such scheme, the described information about firms of described foundation determines that multiple target locations comprise:
Extract the member's that attends a meeting in described information about firms positional information and require information, on electronic chart, showingEach member's that attends a meeting position, and obtain the topological diagram that comprises all members of attending a meeting position, according to described requirementInformation, utilizes the search of region limits searching algorithm to obtain satisfactory multiple target locations in topological diagram.
In such scheme, described definite member that attends a meeting comprises to the shortest path of each target location:
According to cartographic information layering extraction algorithm, route hierarch processing is carried out in described multiple target locations, thenCalculate by Di Jiesitela algorithm the shortest path of member to each target location of attending a meeting.
In such scheme, the member that attends a meeting described in described foundation is to the shortest path of each target location, to rallyThe rally consumption of each target location of group's arrival is sorted and is comprised:
The member that attends a meeting is combined to the shortest path of each target location, obtain rally group and arrive each orderThe shortest path of cursor position, and calculate rally according to the shortest path of the each target location of rally group arrivalGroup arrives the rally consumption of each target location, described rally consumption sorted, and according to ranking resultsDetermine final goal position and the optimal path of the meeting of trooping.
The embodiment of the present invention also provides a cluster meeting optimal route selection device, and described device comprises: obtainDelivery piece, determination module and selection module; Wherein,
Described acquisition module, for obtaining the member's that attends a meeting information about firms;
Described determination module, for determining multiple target locations according to described information about firms, and determines and attends a meeting intoMember is to the shortest path of each target location;
Described selection module, for the member that attends a meeting described in foundation to the shortest path of each target location, to collectionCan group arrive the rally consumption of each target location and sort, and select to troop according to ranking results can beWhole target location and optimal path.
In such scheme, described acquisition module, specifically for send troop can request and positioning instruction to rallyGroup members in group, receives and extracts the information about firms that member reports of respectively attending a meeting; Wherein,
Described information about firms comprises: the member's that attends a meeting positional information and require information.
In such scheme, described determination module, specifically for extracting the member's that attends a meeting in described information about firms positionPut information and require information, on electronic chart, show each member's that attends a meeting position, and obtain comprise allThe attend a meeting topological diagram of member position, according to the described information that requires, utilizes the search of region limits searching algorithm to obtainSatisfactory multiple target locations in topological diagram.
In such scheme, described determination module, specifically for according to cartographic information layering extraction algorithm to describedRoute hierarch processing is carried out in multiple target locations, then calculates the member that attends a meeting to each by Di Jiesitela algorithmThe shortest path of individual target location.
In such scheme, described selection module, specifically for arriving the shortest of each target location to the member that attends a meetingCombine in path, obtains rally group and arrive the shortest path of each target location, and arrive according to rally groupThe shortest path of each target location calculates the rally consumption of each target location of rally group arrival, to instituteState rally consumption and sort, and determine final goal position and the optimal path of the meeting of trooping according to ranking results.
What the embodiment of the present invention provided troop can optimal route selection method and device, obtains and attends a meeting member'sInformation about firms; Determine multiple target locations according to described information about firms, and determine that the member that attends a meeting is to each targetThe shortest path of position; The member that attends a meeting described in foundation arrives rally group to the shortest path of each target locationThe rally consumption of each target location is sorted, and selects the final goal position of trooping and understanding according to ranking resultsPut and optimal path. So, both met rally member's rally requirement, for group members provides optimum rallyPath, meanwhile, again can to troop can overall cost and the time of attending the meeting estimate, real-time is good, canLean on property high.
Brief description of the drawings
Fig. 1 is embodiment of the present invention a group rally optimal route selection method schematic flow sheet;
Fig. 2 be the embodiment of the present invention two troop can optimal route selection method schematic flow sheet;
Fig. 3 be the embodiment of the present invention troop can optimal route selection installation composition structural representation.
Detailed description of the invention
In embodiments of the present invention, obtain the member's that attends a meeting information about firms; Determine many according to described information about firmsIndividual target location, and determine the shortest path of member to each target location of attending a meeting; Member attends a meeting described in foundationTo the shortest path of each target location, the rally consumption that rally group is arrived to each target location is sorted,And according to ranking results select troop can final goal position and optimal path.
Fig. 1 is embodiment of the present invention a group rally optimal route selection method schematic flow sheet, as shown in Figure 1,The present embodiment is trooped and can optimal route selection method flow process be comprised:
Step 101: the information about firms that obtains the member that attends a meeting;
This step specifically comprises: terminal send troop can request and positioning instruction to group members in rally group, connectReceive and extract the information about firms that member reports of respectively attending a meeting;
Here, terminal can by input frame arranging or button send troop can request and positioning instruction toGroup members in rally group, terminal send troop can request and positioning instruction to group members in rally group after, group becomesMember both optionally connected being trooped can ask and positioning instruction participation rally, also can select to troop and can ask described in refusalAsk;
Described rally group can be the various instant communication groups that set in advance, as micro-letter group or QQ group; Also canThink the cards folder group of terminal etc.;
Described rally group comprises that two or more mobile terminals, each mobile terminal are that a group becomesMember.
The described member's of attending a meeting information about firms comprises the member's that attends a meeting positional information and requires information; Wherein, instituteState the member's that attends a meeting positional information for the member that attends a meeting is according to positioning service (LBS, LocationBasedServices) position rear definite; The described information that requires is to attend a meeting user that member obtains by man-machine friendshipWhat interface was inputted mutually requires information, and concrete, user both can input specific requirement, also can pass through man-machine interfaceThe option providing is selected;
Here, described in attend a meeting member for participate in troop can member, accept troop can request and positioning instructionGroup members;
Attend a meeting described in being member's latitude and longitude information of the described member's of attending a meeting positional information;
The described information that requires comprises: trip mode, the target location requirement etc. of rally; As: adopt public transport to go outOK, target location is near subway etc.
After this step, described method also comprises: the member's that attends a meeting described in terminal encryption preservation information about firms;
Here can adopt existing various encryption storage mode to be encrypted the member's that attends a meeting information about firms,Preserve.
Step 102: determine multiple target locations according to described information about firms, and determine that the member that attends a meeting arrives eachThe shortest path of target location;
Here, described target location is the target location of group members rally;
Member's the information about firms of attending a meeting described in described foundation determines that multiple target locations comprise:
Extract the member's that attends a meeting in described information about firms positional information and require information, on electronic chart, showingEach member's that attends a meeting position, and obtain the topological diagram that comprises all members of attending a meeting position, according to described requirementInformation, utilizes the search of region limits searching algorithm to obtain satisfactory multiple target locations in topological diagram; ThisIn, described in meet the requirements to refer to and meet the described information that requires;
Wherein, obtaining the topological diagram that comprises all members of attending a meeting position comprises: on electronic chart, show eachAttend a meeting member's position, obtains the topological diagram of the position that comprises each member that attends a meeting, and constantly expands topological drawingLong-pending, until comprise all members' of attending a meeting position in topological diagram.
Described definite member that attends a meeting comprises to the shortest path of each target location:
According to cartographic information layering extraction algorithm, route hierarch processing is carried out in described multiple target locations, thenCalculate by Di Jiesitela dijkstra's algorithm the shortest path of member to each target location of attending a meeting;
Wherein, according to cartographic information layering extraction algorithm, route hierarch processing is carried out in described multiple target locationsComprise: according to Mapinfo map delamination processing method, route hierarch processing is carried out in described multiple target locations,Extract Roads in Maps layering map, so that calculate the path on major trunk roads;
Described dijkstra's algorithm is the algorithm that length increasing order produces by path, arrives for calculating a pointOther shortest path a little; Its basic thought is vertex set S and vertex set T to be set, noDisconnected ground selects summit to expand S set from vertex set T;
Calculate by Di Jiesitela dijkstra's algorithm the shortest path bag of member to each target location of attending a meetingDraw together:
Step 1: initial seasonal S={V0}, all source locations of T={ };
Wherein, the corresponding distance value in each summit in S set and set T; V0 is source point, is certainThe individual member's that attends a meeting location point, the member's that attends a meeting latitude and longitude coordinates, what summit in S set was corresponding is fromV0 is to the shortest distance values on this summit; What the summit of set in T was corresponding is certain top comprising in S setPoint is as the shortest distance values of intermediate point; Here, the weights of the directapath from V0 to Vi are from V0 warpCertain summit in S is as the routine weight value sum of intermediate point;
If existence<V0, Vi>, d (V0, Vi) is<V0, Vi>weights on arc;
If not there is not<V0 Vi>, d (V0, Vi) is ∞; Here, described Vi is the summit in set T; I isPositive integer.
Step 2: choose summit Vk and add S set from set T; Wherein Vk is in S set, andThe distance value that Vk is corresponding is the summit of the distance value minimum of all correspondences in set T, gathers in T and only hasThe distance value minimum that Vk is corresponding; Wherein, k is positive integer.
Step 3: upgrade distance value corresponding to summit in set T;
Here, due to the summit in set T is added after S set, distance corresponding to summit in set TValue may shorten, and therefore, the summit in set T is added after S set, need recalculate set TIn distance value corresponding to summit and upgrade.
Repeating step 2,3, until comprise all summits in set T in S set;
Here, in S set, path corresponding to summit Vm except V0 is the member V0 that attends a meeting to targetThe shortest path of position Vm; Here, Vm is summit in S set, and m is positive integer.
Further, after determining multiple target locations according to described information about firms, described method can also be wrappedDraw together: increase target location condition, described multiple target locations are screened; The target location condition increasingCan be: the member's that attends a meeting number of members, the member that attends a meeting have and form subset after fraction set and go to target againPosition, as: certain member drives to carry several members nearby, then together goes to target location.
After this step, described method also comprises: the member that attends a meeting who determines is arrived to the shortest of each target locationPath is saved in rally group information list.
Step 103: the member that attends a meeting described in foundation arrives respectively rally group to the shortest path of each target locationThe rally consumption of individual target location is sorted, and selects the final goal position of trooping and understanding according to ranking resultsAnd optimal path;
This step specifically comprises: the member that attends a meeting is combined to the shortest path of each target location, obtainRally group arrives the shortest path of each target location, and arrives the shortest of each target location according to rally groupPath computing obtains the rally consumption of each target location of rally group arrival, described rally consumption sorted,And according to definite final goal position and the optimal path of trooping and understanding of ranking results;
Wherein, described rally consumption comprises: arrive target location cost consumption and arrive target location timeBetween consume; Here, the time loss of described arrival target location arrives target location institute for all members of attending a meetingThe time needing; It is required that the cost consumption of described arrival target location is that all members of attending a meeting arrive target locationExpense;
Described optimal path can be the shortest or cost by using this path to arrive corresponding target location required timeWith minimum, though also or required time and required expense be not minimum relatively suitable.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe cost consumption of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the charge standard of current every kind of trip mode, the expense that calculates each target location of rally group arrival disappearsConsumption.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe required time of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the speed reference of every kind of trip mode, when calculating rally group and arriving each target location requiredBetween.
After this step, described method also comprises: terminal sends final goal position and the optimum road of the meeting of troopingFootpath is to each member that attends a meeting, and in electronic chart, shows described final goal position and optimal path; So,Can utilize LBS to guide and attend a meeting member according to described optimal path arrival final goal position.
Fig. 2 be the embodiment of the present invention two troop can optimal route selection method schematic flow sheet, as shown in Figure 2,The present embodiment is trooped and can optimal route selection method flow process be comprised:
Step 201: obtain and store member's the information about firms of attending a meeting;
Here the information about firms that obtains the member that attends a meeting, comprises: terminal sends to troop and can ask and locate to refer toGroup members in rally group is given in order, receives and extract the information about firms that member reports of respectively attending a meeting;
Here, terminal can by input frame arranging or button send troop can request and positioning instruction toGroup members in rally group, terminal send troop can request and positioning instruction to group members in rally group after, group becomesMember both optionally connected being trooped can ask and positioning instruction participation rally, also can select to troop and can ask described in refusalAsk;
Described rally group can be the various instant communication groups that set in advance, as micro-letter group or QQ group; Also canThink the cards folder group of terminal etc.;
Described rally group comprises that two or more mobile terminals, each mobile terminal are that a group becomesMember.
Described information about firms comprises the member's that attends a meeting positional information and requires information; Wherein, member attends a meeting described inPositional information be that the member that attends a meeting positions rear definite according to LBS; The described information that requires is for the member that attends a meetingWhat the user who obtains inputted by human-computer interaction interface requires information, concrete, and user both can input specifically and wantAsk, the option that also can provide by man-machine interface is selected;
Here, described in attend a meeting member for participate in troop can member, accept troop can request and positioning instructionGroup members;
Attend a meeting described in being member's latitude and longitude information of the described member's of attending a meeting positional information;
The described information that requires comprises: trip mode, the target location requirement etc. of rally; As: adopt public transport to go outOK, target location is near subway etc.
Further, described in, be stored as and encrypt storage; Concrete, can adopt existing various encryption storageMode is encrypted preservation to the member's that attends a meeting information about firms.
Step 202: determine multiple target locations according to described information about firms;
Here, described target location is the target location of group members rally;
Member's the information about firms of attending a meeting described in described foundation determines that multiple target locations comprise:
Extract the member's that attends a meeting in described information about firms positional information and require information, on electronic chart, showingEach member's that attends a meeting position, and obtain the topological diagram that comprises all members of attending a meeting position, according to described requirementInformation, utilizes the search of region limits searching algorithm to obtain satisfactory multiple target locations in topological diagram; ThisIn, described in meet the requirements to refer to and meet the described information that requires;
Wherein, obtaining the topological diagram that comprises all members of attending a meeting position comprises: on electronic chart, show eachAttend a meeting member's position, obtains the topological diagram of the position that comprises each member that attends a meeting, and constantly expands topological drawingLong-pending, until comprise all members' of attending a meeting position in topological diagram.
Step 203: described multiple target locations are screened according to the target location condition increasing;
The goal condition of increase described here can be real-time target condition; As the number of members of attending a meeting is 30,Choose the target location that can hold 30 members in described multiple target location, reject and do not meet described increaseThe target location of target location condition, to restrain multiple target locations.
Step 204: determine that the member that attends a meeting screens the shortest path of rear target location to each, and by describedShort path is stored to group information list;
Here, the described shortest path of determining that the member that attends a meeting screens rear target location to each comprises:
According to cartographic information layering extraction algorithm to described screening after target location carry out route hierarch processing, soCalculate by Di Jiesitela dijkstra's algorithm the shortest path of member to each rear target location of screening of attending a meeting afterwardsFootpath;
Wherein, according to cartographic information layering extraction algorithm to described screening after target location carry out route hierarch placeReason comprises: according to Mapinfo map delamination processing method to described screening after target location carry out route hierarchProcess, extract Roads in Maps layering map, so that calculate the path on major trunk roads;
Described dijkstra's algorithm is the algorithm that length increasing order produces by path, arrives for calculating a pointOther shortest path a little; Its basic thought is vertex set S and vertex set T to be set, noDisconnected ground selects summit to expand S set from vertex set T;
In the present embodiment, the target location after goal condition screening comprises: V1, V2, V3, V4,V5；
Calculate by Di Jiesitela dijkstra's algorithm the shortest path bag of member to each target location of attending a meetingDraw together:
Step 1: initial seasonal S={V0}, T={V1, V2, V3, V4, V5};
Wherein, the corresponding distance value in each summit in S set and set T; V0 is source point, is certainThe individual member's that attends a meeting location point, the member's that attends a meeting latitude and longitude coordinates, what summit in S set was corresponding is fromV0 is to the shortest distance values on this summit; What the summit of set in T was corresponding is certain top comprising in S setPoint is as the shortest distance values of intermediate point;
If existence<V0, Vi>, d (V0, Vi) is<V0, Vi>weights on arc;
If not there is not<V0 Vi>, d (V0, Vi) is ∞; Here, described Vi is the summit in set T; I isPositive integer, and i ∈ [1,5].
Step 2: choose summit Vk and add S set from set T; Wherein Vk is in S set, andThe distance value that Vk is corresponding is the summit of the distance value minimum of all correspondences in set T, gathers in T and only hasThe distance value minimum that Vk is corresponding; Wherein, k is positive integer, and k ∈ [1,5]; In the present embodiment, V2 coupleThe distance value minimum of answering, therefore, adds S set by V2, S={V0, V2}.
Step 3: upgrade distance value corresponding to summit in set T; I.e. renewal residue summit V1, V3,The distance value that V4, V5 are corresponding;
Here, due to the summit in set T is added after S set, distance corresponding to summit in set TValue may shorten, and therefore, V2 is being added after S set, need recalculate the summit pair in set TThe distance value of answering also upgrades.
Repeating step 2,3, until comprise all summits in set T in S set;
Here, V1, V2, V3, V4, V5 are added after S set to V1, V2, V3, V4, V5Corresponding path is the shortest path of member V0 to target location V1, V2, V3, V4, V5 of attending a meeting.
Step 205: the rally consumption that rally group is arrived to each target location according to described shortest path is carried outSequence, and select final goal position and the optimal path of trooping and understanding according to ranking results;
This step specifically comprises: group members combined to the shortest path of each rear target location of screening,Obtain the shortest path that rally group arrives target location after each screening, and arrive each screening according to rally groupThe shortest path of rear target location calculates the rally consumption of each rear target location of screening of rally group arrival,Described rally consumption is sorted, and select final goal position and the optimum of trooping and understanding according to ranking resultsPath;
Wherein, described rally consumption comprises: arrive target location cost consumption and arrive target location timeBetween consume; Here, the time loss of described arrival target location arrives target location institute for all members of attending a meetingThe time needing; It is required that the cost consumption of described arrival target location is that all members of attending a meeting arrive target locationExpense;
Described optimal path can be the shortest or cost by using this path to arrive corresponding target location required timeWith minimum, though also or required time and required expense be not minimum relatively suitable, specifically can be according to realityBorder need to be chosen.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe cost consumption of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the charge standard of current every kind of trip mode, the expense that calculates each target location of rally group arrival disappearsConsumption.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe required time of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the speed reference of every kind of trip mode, when calculating rally group and arriving each target location requiredBetween.
Step 206: send troop can final goal position and optimal path to each member that attends a meeting, andIn electronic chart, show described final goal position and optimal path;
So, can utilize LBS to guide and attend a meeting member according to described optimal path arrival final goal position.
Fig. 3 be the embodiment of the present invention troop can optimal route selection installation composition structural representation, as Fig. 3 instituteShow, the embodiment of the present invention is trooped and can be comprised by optimal route selection installation composition: acquisition module 31, determination module32 and select module 33; Wherein,
Described acquisition module 31, for obtaining the member's that attends a meeting information about firms;
Described determination module 32, for determining multiple target locations according to described information about firms, and determines and attends a meetingMember is to the shortest path of each target location;
Described selection module 33, the shortest path that arrives each target location for the member that attends a meeting described in foundation is to collectionCan group arrive the rally consumption of each target location and sort, and select to troop according to ranking results can beWhole target location and optimal path.
Further, the information about firms that described acquisition module 31 obtains the member that attends a meeting comprises: described acquisition module31 send troop can request and positioning instruction to group members in rally group, receive and extract the member that respectively attends a meeting and reportInformation about firms; Wherein,
Described information about firms comprises: the member's that attends a meeting positional information and require information; Wherein, described in, attend a meeting intoMember's positional information is that the member that attends a meeting positions rear definite according to LBS; The described information that requires is for attending a meeting intoWhat the user that member obtains inputted by human-computer interaction interface requires information;
Attend a meeting described in being member's latitude and longitude information of the described member's of attending a meeting positional information;
The described information that requires comprises: trip mode, the target location requirement etc. of rally; As: adopt public transport to go outOK, target location is near subway etc.
Further, described device also comprises memory module 34, for encrypting member's letter of storing the member that attends a meetingBreath, and storage rally group information list.
Further, described determination module 32 determines that according to described information about firms multiple target locations comprise:
Described determination module 32 extracts the member's that attends a meeting in described information about firms positional information and requires information,On electronic chart, show each member's that attends a meeting position, and obtain the topological diagram that comprises all members of attending a meeting position,According to the described information that requires, utilize the search of region limits searching algorithm to obtain in topological diagram satisfactory multipleTarget location.
Further, described determination module 32, also for the target location condition according to increasing, to described manyScreen individual target location;
Further, described determination module 32 is determined the shortest path bag of member to each target location of attending a meetingDraw together:
Described determination module 32 carries out described multiple target locations according to cartographic information layering extraction algorithmRoad layering processing, then calculates by dijkstra's algorithm the shortest path of member to each target location of attending a meeting;
Wherein, described determination module 32 calculates the member that attends a meeting to each target location by dijkstra's algorithmShortest path comprises:
Step 1: described determination module 32 arranges S={V0}, all source locations of T={ };
Wherein, the corresponding distance value in each summit in S set and set T; V0 is source point, is certainThe individual member's that attends a meeting location point, the member's that attends a meeting latitude and longitude coordinates, what summit in S set was corresponding is fromV0 is to the shortest distance values on this summit; What the summit of set in T was corresponding is certain top comprising in S setPoint is as the shortest distance values of intermediate point; Here, the weights of the directapath from V0 to Vi are from V0 warpCertain summit in S is as the routine weight value sum of intermediate point;
If existence<V0, Vi>, d (V0, Vi) is<V0, Vi>weights on arc;
If not there is not<V0 Vi>, d (V0, Vi) is ∞; Here, described Vi is the summit in set T; I isPositive integer.
Step 2: described determination module 32 is chosen summit Vk and added S set from set T; Wherein VkNot in S set, and distance value corresponding to Vk be the summit of distance value minimum of all correspondences in set T,Gather and in T, only have the distance value minimum that Vk is corresponding; Wherein, k is positive integer.
Step 3: described determination module 32 upgrades distance value corresponding to summit in set T;
Here, due to the summit in set T is added after S set, distance corresponding to summit in set TValue may shorten, and therefore, the summit in set T is added after S set, need recalculate set TIn distance value corresponding to summit and upgrade.
Described determination module 32 repeating steps 2,3, until comprise all summits in set T in S set;
Here, in S set, path corresponding to summit Vm except V0 is the member V0 that attends a meeting to targetThe shortest path of position Vm.
Further, described selection module 33 according to described in the shortest path of member to each target location of attending a meetingThe rally consumption that rally group is arrived to each target location is sorted, and selects to troop meeting according to ranking resultsFinal goal position and optimal path comprise:
Described selection module 33 combines to the shortest path of each target location the member that attends a meeting, and is collectedCan group arrive the shortest path of each target location, and arrive the shortest path of each target location according to rally groupFootpath calculates the rally consumption of each target location of rally group arrival, described rally consumption sorted,And according to definite final goal position and the optimal path of trooping and understanding of ranking results;
Wherein, described rally consumption comprises: arrive target location cost consumption and arrive target location timeBetween consume; Here, the time loss of described arrival target location arrives target location institute for all members of attending a meetingThe time needing; It is required that the cost consumption of described arrival target location is that all members of attending a meeting arrive target locationExpense;
Described optimal path can be the shortest or cost by using this path to arrive corresponding target location required timeWith minimum, though also or required time and required expense be not minimum relatively suitable.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe cost consumption of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the charge standard of current every kind of trip mode, the expense that calculates each target location of rally group arrival disappearsConsumption.
Calculate rally group according to the shortest path of the each target location of rally group arrival and arrive each target bitThe required time of putting comprises:
Arrive shortest path, the trip mode corresponding to each member that attends a meeting of each target location according to rally groupAnd the speed reference of every kind of trip mode, when calculating rally group and arriving each target location requiredBetween.
Further, described device also comprises sending module 35 and display module 36; Wherein, described transmissionModule 35, for send troop can final goal position and optimal path to each member that attends a meeting;
Described display module, shows described final goal position and optimal path for electronic chart.
In embodiments of the present invention, described in troop can optimal route selection device can be positioned in terminal, obtain mouldPiece 31, determination module 32, selection module 33 and sending module 35 all can be by the central processing units in terminal(CPU, CentralProcessingUnit) or digital signal processor (DSP, DigitalSignalProcessor) or field programmable gate array (FPGA, FieldProgrammableGateArray) realExisting, memory module 34 can be realized by the processor in terminal, and display module 36 can be by the display in terminalRealize.
The above, be only preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.
Claims (10)
1. a cluster meeting optimal route selection method, is characterized in that, described method comprises:
Obtain the member's that attends a meeting information about firms;
Determine multiple target locations according to described information about firms, and determine that the member that attends a meeting is to each target locationShortest path;
The member that attends a meeting described in foundation arrives the shortest path of each target location, and to rally, group arrives each target bitThe rally consumption of putting is sorted, and selects final goal position and the optimum road of trooping and understanding according to ranking resultsFootpath.
2. method according to claim 1, is characterized in that, described in obtain the member's that attends a meeting information about firmsComprise: send troop can request and positioning instruction to group members in rally group, receive and extract the member that respectively attends a meetingThe information about firms reporting; Wherein,
Described information about firms comprises: the member's that attends a meeting positional information and require information.
3. according to method described in claim 1 or 2, it is characterized in that, the described information about firms of described foundation is trueFixed multiple target locations comprise:
Extract the member's that attends a meeting in described information about firms positional information and require information, on electronic chart, showingEach member's that attends a meeting position, and obtain the topological diagram that comprises all members of attending a meeting position, according to described requirementInformation, utilizes the search of region limits searching algorithm to obtain satisfactory multiple target locations in topological diagram.
4. according to method described in claim 1 or 2, it is characterized in that, described definite member that attends a meeting arrives eachThe shortest path of target location comprises:
According to cartographic information layering extraction algorithm, route hierarch processing is carried out in described multiple target locations, thenCalculate by Di Jiesitela algorithm the shortest path of member to each target location of attending a meeting.
5. according to method described in claim 1 or 2, it is characterized in that, the member that attends a meeting described in described foundation arrivesThe shortest path of each target location, ranked package is carried out in the rally consumption that rally group is arrived to each target locationDraw together:
The member that attends a meeting is combined to the shortest path of each target location, obtain rally group and arrive each orderThe shortest path of cursor position, and calculate rally according to the shortest path of the each target location of rally group arrivalGroup arrives the rally consumption of each target location, described rally consumption sorted, and according to ranking resultsDetermine final goal position and the optimal path of the meeting of trooping.
6. a cluster meeting optimal route selection device, is characterized in that, described device comprises: acquisition module,Determination module and selection module; Wherein,
Described acquisition module, for obtaining the member's that attends a meeting information about firms;
Described determination module, for determining multiple target locations according to described information about firms, and determines and attends a meeting intoMember is to the shortest path of each target location;
Described selection module, for the member that attends a meeting described in foundation to the shortest path of each target location, to collectionCan group arrive the rally consumption of each target location and sort, and select to troop according to ranking results can beWhole target location and optimal path.
7. install according to claim 6, it is characterized in that, described acquisition module, specifically for sendingTroop can request and positioning instruction to group members in rally group, receive and extract the member that member reports that respectively attends a meetingInformation; Wherein,
Described information about firms comprises: the member's that attends a meeting positional information and require information.
8. according to device described in claim 6 or 7, it is characterized in that, described determination module, specifically forExtract the member's that attends a meeting in described information about firms positional information and require information, on electronic chart, showing eachMember's the position of attending a meeting, and obtain the topological diagram that comprises all members of attending a meeting position, according to the described information that requires,Utilize the search of region limits searching algorithm to obtain satisfactory multiple target locations in topological diagram.
9. according to device described in claim 6 or 7, it is characterized in that, described determination module, specifically forAccording to cartographic information layering extraction algorithm, route hierarch processing is carried out in described multiple target locations, then pass throughDi Jiesitela algorithm calculates the shortest path of member to each target location of attending a meeting.
10. according to device described in claim 6 or 7, it is characterized in that, described selection module, specifically usesIn the member that attends a meeting is combined to the shortest path of each target location, obtain rally group and arrive each targetThe shortest path of position, and calculate rally group according to the shortest path of the each target location of rally group arrivalArrive the rally consumption of each target location, described rally consumption is sorted, and true according to ranking resultsFinal goal position and the optimal path of grouping rally.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410567745.6A CN105588571A (en) | 2014-10-22 | 2014-10-22 | Method and device for selecting the optimum path for crowd gathering |
| PCT/CN2015/072602 WO2016061951A1 (en) | 2014-10-22 | 2015-02-09 | Group meeting optimal path selection method, device, and storage media |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410567745.6A CN105588571A (en) | 2014-10-22 | 2014-10-22 | Method and device for selecting the optimum path for crowd gathering |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105588571A true CN105588571A (en) | 2016-05-18 |
Family
ID=55760138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410567745.6A Pending CN105588571A (en) | 2014-10-22 | 2014-10-22 | Method and device for selecting the optimum path for crowd gathering |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105588571A (en) |
| WO (1) | WO2016061951A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107860392A (en) * | 2016-09-21 | 2018-03-30 | 千寻位置网络有限公司 | A kind of method and its system for efficiently looking for people |
| CN108195392A (en) * | 2018-03-14 | 2018-06-22 | 维沃移动通信有限公司 | A kind of more people's layout of roads methods and terminal |
| CN108519089A (en) * | 2018-03-14 | 2018-09-11 | 维沃移动通信有限公司 | A kind of more people's route planning methods and terminal |
| CN109962939A (en) * | 2017-12-14 | 2019-07-02 | 腾讯科技（深圳）有限公司 | Position recommended method, device, server, terminal and storage medium |
| CN111121810A (en) * | 2019-12-26 | 2020-05-08 | 珠海格力电器股份有限公司 | Multi-user travel navigation method and device, terminal equipment and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018222488A1 (en) * | 2017-05-31 | 2018-12-06 | Astrazeneca Pharmaceuticals Lp | Non-linear systems and methods for destination selection |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1675646A (en) * | 2002-08-20 | 2005-09-28 | 欧特克公司 | Meeting location determination using spatio-semantic modeling |
| CN101067654A (en) * | 2007-05-10 | 2007-11-07 | 南京师范大学 | Travelling group team management system based mobile positioning technique and GIS |
| CN101621741A (en) * | 2008-07-03 | 2010-01-06 | 三星电子株式会社 | Method and apparatus for providing location information-based scheduling service of portable terminal |
| CN101924984A (en) * | 2009-06-12 | 2010-12-22 | 英华达（南京）科技有限公司 | Locating method for inter-mobile communication devices |
| CN102081658A (en) * | 2011-01-13 | 2011-06-01 | 北京超图软件股份有限公司 | Hierarchical road network-based path search method and device |
| CN102506884A (en) * | 2011-10-28 | 2012-06-20 | 百度在线网络技术（北京）有限公司 | Method, system and device for recommending gathering places for multiple users on basis of maps |
| CN103884331A (en) * | 2012-12-24 | 2014-06-25 | 鸿富锦精密工业（深圳）有限公司 | Rendezvous guidance system and method |
-
2014
- 2014-10-22 CN CN201410567745.6A patent/CN105588571A/en active Pending
-
2015
- 2015-02-09 WO PCT/CN2015/072602 patent/WO2016061951A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1675646A (en) * | 2002-08-20 | 2005-09-28 | 欧特克公司 | Meeting location determination using spatio-semantic modeling |
| CN101067654A (en) * | 2007-05-10 | 2007-11-07 | 南京师范大学 | Travelling group team management system based mobile positioning technique and GIS |
| CN101621741A (en) * | 2008-07-03 | 2010-01-06 | 三星电子株式会社 | Method and apparatus for providing location information-based scheduling service of portable terminal |
| CN101924984A (en) * | 2009-06-12 | 2010-12-22 | 英华达（南京）科技有限公司 | Locating method for inter-mobile communication devices |
| CN102081658A (en) * | 2011-01-13 | 2011-06-01 | 北京超图软件股份有限公司 | Hierarchical road network-based path search method and device |
| CN102506884A (en) * | 2011-10-28 | 2012-06-20 | 百度在线网络技术（北京）有限公司 | Method, system and device for recommending gathering places for multiple users on basis of maps |
| CN103884331A (en) * | 2012-12-24 | 2014-06-25 | 鸿富锦精密工业（深圳）有限公司 | Rendezvous guidance system and method |
Non-Patent Citations (1)
| Title |
|---|
| 周园: "《地图与地图制图》", 30 November 2011, 武汉大学出版社 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107860392A (en) * | 2016-09-21 | 2018-03-30 | 千寻位置网络有限公司 | A kind of method and its system for efficiently looking for people |
| CN107860392B (en) * | 2016-09-21 | 2020-12-01 | 千寻位置网络有限公司 | Efficient person finding method and system |
| CN109962939A (en) * | 2017-12-14 | 2019-07-02 | 腾讯科技（深圳）有限公司 | Position recommended method, device, server, terminal and storage medium |
| CN109962939B (en) * | 2017-12-14 | 2021-05-04 | 腾讯科技（深圳）有限公司 | Position recommendation method, device, server, terminal and storage medium |
| CN108195392A (en) * | 2018-03-14 | 2018-06-22 | 维沃移动通信有限公司 | A kind of more people's layout of roads methods and terminal |
| CN108519089A (en) * | 2018-03-14 | 2018-09-11 | 维沃移动通信有限公司 | A kind of more people's route planning methods and terminal |
| CN111121810A (en) * | 2019-12-26 | 2020-05-08 | 珠海格力电器股份有限公司 | Multi-user travel navigation method and device, terminal equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016061951A1 (en) | 2016-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105588571A (en) | Method and device for selecting the optimum path for crowd gathering | |
| CN104090970B (en) | Point of interest shows method and device | |
| EP2820616B1 (en) | Empirical expert determination and question routing system and method | |
| EP2769333B1 (en) | Video based pedestrian traffic estimation | |
| US8401572B2 (en) | Method and apparatus for providing location based services using connectivity graphs based on cell broadcast information | |
| JP6942706B2 (en) | How and equipment to get the route heat of a traffic road | |
| CN104219630B (en) | A kind of Syndicating search alignment system based on cellular base station simulator and video monitoring | |
| CN102098388A (en) | Method for sequencing contacts and terminal | |
| CN104093125A (en) | Method and system for using geographical position information for setting up groups | |
| CN106709606A (en) | Personalized scene prediction method and apparatus | |
| CN109211259B (en) | Display method, device, terminal and storage medium of track route | |
| CN102957997B (en) | A kind of resource acquiring method based on geographical position, Apparatus and system | |
| CN103294708A (en) | Route planning method and device based on public traffic system | |
| KR20120047285A (en) | Position information analysis device and position information analysis mehod | |
| US20140095071A1 (en) | Route learning with networked assistance | |
| CN109727057A (en) | Candidate locations evaluation system and candidate locations evaluation method | |
| CN103148857B (en) | Information providing method and system thereof | |
| WO2019196607A1 (en) | Location service-based method and device for recommending point of interest, network device, and storage medium | |
| CN109275090A (en) | Information processing method, device, terminal and storage medium | |
| CN103547887A (en) | Navigation system with assistance for making multiple turns in a short distance | |
| CN106529896A (en) | Claim-settlement-surveying-based method and claim settlement server | |
| CN105303865A (en) | Detecting important transit stops for transit trip grouping | |
| CN104601626A (en) | Customer visit method based on mobile terminal | |
| CN104039008B (en) | A kind of hybrid locating method | |
| EP3241367A1 (en) | Method and system for real-time computing of origin-destination matrices relating to attendees at a public happening through analysis of mobile communication network data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160518 |