WO2016061951A1

WO2016061951A1 - Group meeting optimal path selection method, device, and storage media

Info

Publication number: WO2016061951A1
Application number: PCT/CN2015/072602
Authority: WO
Inventors: 郭强锋
Original assignee: 中兴通讯股份有限公司
Priority date: 2014-10-22
Filing date: 2015-02-09
Publication date: 2016-04-28
Also published as: CN105588571A

Abstract

Disclosed is a group meeting optimal path selection method, the method comprising: obtaining member information of participating members; according to the member information, determining a plurality of target locations and determining the shortest path for the participating members to reach each target location; according to the shortest path for the participating members to reach each target location, sorting the meeting consumption for the meeting group to reach each target location, and according to the sorting result, selecting a final target location and the optimal path for the group meeting. Also disclosed are a group meeting optimal path selection device and storage media.

Description

一种群集会最优路径选择方法、装置及存储介质Cluster optimal path selection method, device and storage medium

技术领域Technical field

本发明涉及移动通信技术领域，尤其涉及一种群集会最优路径选择方法、装置及存储介质。The present invention relates to the field of mobile communications technologies, and in particular, to a clustering optimal path selection method, apparatus, and storage medium.

背景技术Background technique

随着现代城市化进程的加快，人们的社交活动也越来越多，朋友、同事聚会、聚餐等成为非常普遍的现象，由于各个集会成员之间距离较远，群成员需要集会时，基本上都是先选定目标地点后，各个成员自行到达目标地。With the acceleration of modern urbanization, people's social activities are also increasing. Friends, colleagues gathering, gatherings, etc. have become very common phenomena. Because members of each gathering are far apart, when members of the group need to meet, basically After selecting the target location first, each member reaches the target location by himself.

上述集会方式的好处是目标比较明确，方式简单；但缺点也比较明显：一、实时性不好，无法做到及时的聚集，基本上需要提前若干小时的通知；二、由于群成员各自为政，群花费总和不可控，无法进行预算估计，特别是对于统一群聚会时，对费用有控制要求条件的，实施难度很大。The advantages of the above-mentioned assembly methods are that the objectives are relatively clear and the methods are simple; but the shortcomings are also obvious: First, the real-time performance is not good, and it is impossible to achieve timely aggregation. Basically, it is necessary to notify several hours in advance. Second, because the group members are in politics, the group The sum of the expenses is uncontrollable, and the budget estimation cannot be carried out. Especially for the unified group meeting, it is difficult to implement the requirements for the cost control.

发明内容Summary of the invention

有鉴于此，本发明实施例期望提供一种群集会最优路径选择方法、装置及存储介质，在为群成员提供最优集会路径的同时，能够对群集会的总体花费及到会时间进行预估，实时性好、可靠性高。In view of this, the embodiment of the present invention is to provide a method, a device, and a storage medium for optimal cluster selection, which can provide an optimal assembly path for a group member, and can estimate the total cost and time of the cluster meeting. Good real-time and high reliability.

为达到上述目的，本发明实施例的技术方案是这样实现的：To achieve the above objective, the technical solution of the embodiment of the present invention is implemented as follows:

本发明实施例提供了一种群集会最优路径选择方法，所述方法包括：The embodiment of the invention provides a cluster optimal path selection method, and the method includes:

获取参会成员的成员信息；Obtain member information of the participating members;

依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；Determining a plurality of target locations based on the member information, and determining the participating members to each target position Shortest path

依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。According to the shortest path of the participating members to each target position, the assembly consumption of the assembly group reaching each target position is sorted, and the final target position and the optimal path of the cluster meeting are selected according to the sorting result.

上述方案中，所述获取参会成员的成员信息包括：发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；其中，In the above solution, the obtaining the member information of the participating member includes: sending a cluster request and positioning instruction to the group member in the assembly group, and receiving and extracting the member information reported by each member; wherein

所述成员信息包括：参会成员的位置信息及要求信息。The member information includes: location information and request information of the participating members.

上述方案中，所述依据所述成员信息确定多个目标位置包括：In the foregoing solution, the determining, according to the member information, the multiple target locations includes:

提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置。Extracting the location information and the request information of the member in the member information, displaying the location of each participating member on the electronic map, and obtaining a topology map including the positions of all the participating members, and using the regional restriction search according to the request information The algorithm search obtains multiple target locations in the topology map that meet the requirements.

上述方案中，所述确定参会成员到各个目标位置的最短路径包括：In the above solution, the shortest path for determining the participating members to each target location includes:

依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过迪杰斯特拉算法计算参会成员到各个目标位置的最短路径。The plurality of target locations are subjected to road layering processing according to the map information layering extraction algorithm, and then the shortest path of the participating members to the respective target locations is calculated by the Dijkstra algorithm.

上述方案中，所述依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序包括：In the above solution, according to the shortest path of the participant to each target location, sorting the assembly consumption of the assembly group to each target location includes:

对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径。Combine the shortest paths of the participants to each target position, obtain the shortest path of the assembly group to each target position, and calculate the assembly consumption of the assembly group to each target position according to the shortest path of the assembly group to each target position. The collection consumption is sorted, and the final target position and the optimal path of the cluster are determined according to the sorting result.

本发明实施例还提供了一种群集会最优路径选择装置，所述装置包括：获取模块、确定模块及选择模块；其中，The embodiment of the present invention further provides a cluster optimal path selection device, where the device includes: an acquisition module, a determination module, and a selection module;

所述获取模块，配置为获取参会成员的成员信息； The obtaining module is configured to obtain member information of the participating member;

所述确定模块，配置为依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；The determining module is configured to determine a plurality of target locations according to the member information, and determine a shortest path of the participating members to each target location;

所述选择模块，配置为依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。The selection module is configured to sort the assembly consumption of the assembly group to each target location according to the shortest path of the participant member to each target location, and select a final target location and an optimal path of the cluster meeting according to the sorting result.

上述方案中，所述获取模块，配置为发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；其中，In the above solution, the acquiring module is configured to send a cluster request and a positioning instruction to the group members in the assembly group, and receive and extract the member information reported by each member;

上述方案中，所述确定模块，配置为提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置。In the above solution, the determining module is configured to extract location information and requirement information of the participating members in the member information, display the location of each participating member on the electronic map, and obtain a topology map including all participating member positions. And, according to the requirement information, searching for a plurality of target locations in the topology map that meet the requirements by using the region restriction search algorithm.

上述方案中，所述确定模块，配置为依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过迪杰斯特拉算法计算参会成员到各个目标位置的最短路径。In the above solution, the determining module is configured to perform road layer processing on the plurality of target locations according to a map information layering extraction algorithm, and then calculate a shortest path of the participating members to each target location by using a Dijkstra algorithm. .

上述方案中，所述选择模块，配置为对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径。In the above solution, the selection module is configured to combine the shortest paths of the participating members to each target location, obtain the shortest path of the assembly group to each target location, and calculate according to the shortest path of the assembly group to each target location. Obtaining the assembly consumption of the assembly group to each target location, sorting the assembly consumption, and determining the final target location and the optimal path of the cluster according to the ranking result.

本发明实施例还提供了一种计算机存储介质，所述计算机存储介质存储有计算机程序，该计算机程序用于执行本发明实施例的群集会最优路径选择方法。The embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a computer program for performing a cluster optimal path selection method according to an embodiment of the present invention.

本发明实施例所提供的群集会最优路径选择方法、装置及存储介质，获取参会成员的成员信息；依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；依据所述参会成员到各个目标位置的最短路径对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。如此，既满足了集会成员的集会要求，为群成员提供最优集会路径，同时，又能够对群集会的总体花费及到会时间进行预估，实时性好、可靠性高。The cluster optimal path selection method, device and storage medium provided by the embodiments of the present invention obtain member information of the participating members; determine multiple target locations according to the member information, and determine The shortest path of the participating members to each target position; sorting the assembly consumption of the meeting group to each target position according to the shortest path of the participating members to each target position, and selecting the final target position of the cluster meeting according to the sorting result and the most Excellent path. In this way, it not only satisfies the assembly requirements of the assembly members, but also provides the optimal assembly path for the group members. At the same time, it can estimate the overall cost and the meeting time of the cluster meeting, and has good real-time performance and high reliability.

附图说明DRAWINGS

图1为本发明实施例一群集会最优路径选择方法流程示意图；1 is a schematic flowchart of a cluster optimal path selection method according to an embodiment of the present invention;

图2为本发明实施例二群集会最优路径选择方法流程示意图；2 is a schematic flowchart of a method for selecting an optimal path of a cluster according to Embodiment 2 of the present invention;

图3为本发明实施例群集会最优路径选择装置组成结构示意图。FIG. 3 is a schematic structural diagram of a cluster optimal path selection apparatus according to an embodiment of the present invention.

具体实施方式detailed description

在本发明实施例中，获取参会成员的成员信息；依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。In the embodiment of the present invention, the member information of the participating member is obtained; the plurality of target locations are determined according to the member information, and the shortest path of the participating member to each target location is determined; according to the participating member to each target location The shortest path, sorting the assembly consumption of the assembly group to each target location, and selecting the final target location and optimal path of the cluster according to the sorting result.

图1为本发明实施例一群集会最优路径选择方法流程示意图，如图1所示，本实施例群集会最优路径选择方法流程包括：FIG. 1 is a schematic flowchart of a method for selecting an optimal path of a cluster according to an embodiment of the present invention. As shown in FIG. 1 , the process of selecting an optimal path for a cluster in this embodiment includes:

步骤101：获取参会成员的成员信息；Step 101: Obtain member information of the participating members;

本步骤包括：终端发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；The step includes: the terminal sends a cluster request and a positioning instruction to the group members in the assembly group, and receives and extracts the member information reported by each member;

这里，终端可通过设置的一个输入框或按钮发送群集会请求及定位指令给集会群内群成员，终端发送群集会请求及定位指令给集会群内群成员后，群成员既可选择接受群集会请求及定位指令参加集会，也可选择拒绝所述群集会请求；Here, the terminal may send a cluster request and positioning instruction to the group members in the assembly group through an input box or button, and after the terminal sends the cluster request and the positioning instruction to the group members in the assembly group, the group member may choose to accept the cluster meeting. The request and location instructions participate in the assembly, and may also choose to reject the cluster request;

所述集会群可以为预先设置的各种即时通讯群，如微信群或QQ群；也可以为终端的名片夹群等；The assembly group may be various instant messaging groups preset, such as a WeChat group or a QQ group; It can also be a group of business card holders of the terminal;

所述集会群包括两个或两个以上的移动终端，每一个移动终端为一个群成员。The assembly group includes two or more mobile terminals, and each mobile terminal is a group member.

所述参会成员的成员信息包括参会成员的位置信息及要求信息；其中，所述参会成员的位置信息为参会成员依据定位服务(LBS，Location Based Services)进行定位后确定的；所述要求信息为参会成员获取的用户通过人机交互界面输入的要求信息，用户既可输入具体要求，也可通过人机界面提供的选项进行选择；The member information of the participating member includes the location information and the request information of the participating member; wherein the location information of the participating member is determined by the participating member according to the location service (LBS, Location Based Services); The request information is the request information input by the user through the human-computer interaction interface, and the user can input the specific requirements or select through the options provided by the human-machine interface;

这里，所述参会成员为参加群集会的成员，即接受群集会请求及定位指令的群成员；Here, the participating member is a member of the cluster meeting, that is, a group member who accepts the cluster request and the positioning instruction;

所述参会成员的位置信息为所述参会成员的经纬度信息；The location information of the participating member is the latitude and longitude information of the participating member;

所述要求信息包括：集会的出行方式、目标位置要求等；如：采用公交出行，目标位置在地铁口附近等。The request information includes: the mode of travel of the assembly, the requirements of the target location, etc.; for example, using public transportation, the target location is near the subway station, and the like.

本步骤之后，所述方法还包括：终端加密保存所述参会成员的成员信息；After the step, the method further includes: encrypting, by the terminal, the member information of the participant;

这里，可以采用现有的各种加密存储方式对参会成员的成员信息进行加密保存。Here, the member information of the participating members can be encrypted and saved by using various existing encryption storage methods.

步骤102：依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；Step 102: Determine a plurality of target locations according to the member information, and determine a shortest path of the participating members to each target location;

这里，所述目标位置为群成员集会的目标位置；Here, the target location is a target location of the group member assembly;

所述依据所述参会成员的成员信息确定多个目标位置包括：The determining the plurality of target locations according to the member information of the participant includes:

提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置；这里，所述符合要求指的是符合所述要求信息； Extracting the location information and the request information of the member in the member information, displaying the location of each participating member on the electronic map, and obtaining a topology map including the positions of all the participating members, and using the regional restriction search according to the request information The algorithm searches for a plurality of target locations in the topology map that meet the requirements; where the compliance requirements refer to the information that meets the requirements;

其中，获取包含所有参会成员位置的拓扑图包括：在电子地图上显示各个参会成员的位置，获取包含各个参会成员的位置的拓扑图，不断扩大拓扑图面积，直至拓扑图中包含所有参会成员的位置。The obtaining the topology map including the positions of all the participating members includes: displaying the position of each participating member on the electronic map, obtaining a topology map including the positions of the respective participating members, and continuously expanding the topology map area until all the topological maps are included. The location of the participating members.

所述确定参会成员到各个目标位置的最短路径包括：The shortest path for determining the participating members to each target location includes:

依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过迪杰斯特拉Dijkstra算法计算参会成员到各个目标位置的最短路径；Performing road layering processing on the plurality of target locations according to a map information layering extraction algorithm, and then calculating a shortest path of the participating members to each target location by the Dijkstra Dijkstra algorithm;

其中，依据地图信息分层提取算法对所述多个目标位置进行道路分层处理包括：依据Mapinfo地图分层处理方法对所述多个目标位置进行道路分层处理，提取地图中道路分层地图，以便于计算主干道上的路径；The method for hierarchically layering the plurality of target locations according to the map information layering extraction algorithm comprises: performing road layer processing on the plurality of target locations according to a Mapinfo map layering processing method, and extracting a road layered map in the map In order to calculate the path on the main road;

所述Dijkstra算法为按路径长度递增次序产生的算法，用于计算一个点到其它所有点的最短路径；其基本思想是，设置顶点集合S和顶点集合T，并不断地从顶点集合T中选择顶点来扩充集合S；The Dijkstra algorithm is an algorithm generated in increasing order of path lengths for calculating a shortest path from one point to all other points; the basic idea is to set a set of vertices S and a set of vertices T, and continually select from the set of vertices T Vertex to expand the set S;

通过迪杰斯特拉Dijkstra算法计算参会成员到各个目标位置的最短路径包括：The shortest path to calculate the participating members to each target location by the Dijkstra Dijkstra algorithm includes:

步骤1：初始时令S＝{V0}，T＝{所有目标位置点}；Step 1: Initial seasonal S={V0}, T={all target position points};

其中，集合S和集合T中每一个顶点对应一个距离值；V0为源点，是某个参会成员的位置点，即参会成员的经纬度坐标，集合S中的顶点对应的是从V0到此顶点的最短距离值；集合T中的顶点对应的是包括集合S中的某个顶点作为中间点的最短距离值；这里，从V0到Vi的直接路径的权值为从V0经S中的某个顶点作为中间点的路径权值之和；Each vertex of the set S and the set T corresponds to a distance value; V0 is a source point, which is a position point of a participating member, that is, a latitude and longitude coordinate of the participating member, and the vertex in the set S corresponds to from the V0 to The shortest distance value of this vertex; the vertex in the set T corresponds to the shortest distance value including a certain vertex in the set S as the intermediate point; here, the weight of the direct path from V0 to Vi is from V0 through S The sum of the path weights of a vertex as the intermediate point;

若存在<V0,Vi>，d(V0,Vi)为<V0,Vi>弧上的权值；If there is <V0, Vi>, d(V0, Vi) is the weight on the arc of <V0, Vi>;

若不存在<V0,Vi>，d(V0,Vi)为∞；这里，所述Vi为集合T中的顶点；i为正整数。If there is no <V0, Vi>, d(V0, Vi) is ∞; here, the Vi is a vertex in the set T; i is a positive integer.

步骤2：从集合T中选取顶点Vk加入集合S；其中Vk不在集合S中，且Vk对应的距离值为集合T中所有对应的距离值最小的顶点，即集合T中只有Vk对应的距离值最小；其中，k为正整数。Step 2: Select a vertex Vk from the set T to join the set S; wherein Vk is not in the set S, And the distance value corresponding to Vk is the vertice with the smallest distance value in the set T, that is, the distance value corresponding to Vk in the set T is the smallest; wherein k is a positive integer.

步骤3：更新集合T中的顶点对应的距离值；Step 3: Update the distance value corresponding to the vertex in the set T;

这里，由于将集合T中的顶点加入集合S后，集合T中的顶点对应的距离值可能会缩短，因此，在将集合T中的顶点加入集合S后，需重新计算集合T中的顶点对应的距离值并更新。Here, since the vertices in the set T are added to the set S, the distance values corresponding to the vertices in the set T may be shortened. Therefore, after the vertices in the set T are added to the set S, the corresponding vertices in the set T need to be recalculated. The distance value is updated.

重复步骤2、3，直至集合S中包含集合T中所有的顶点；Repeat steps 2 and 3 until the set S contains all the vertices in the set T;

这里，集合S中除V0以外的顶点Vm对应的路径即为参会成员V0到目标位置Vm的最短路径；这里，Vm为集合S中顶点，m为正整数。Here, the path corresponding to the vertex Vm other than V0 in the set S is the shortest path from the participant member V0 to the target position Vm; here, Vm is a vertex in the set S, and m is a positive integer.

在一实施例中，依据所述成员信息确定多个目标位置之后，所述方法还可以包括：增加目标位置条件，对所述多个目标位置进行筛选；增加的目标位置条件可以为：参会成员的成员数目、参会成员有小部分集合后形成子集再去往目标位置，如：某成员驾车搭载几名就近的成员，然后一同前往目标位置。In an embodiment, after determining a plurality of target locations according to the member information, the method may further include: adding a target location condition, and screening the multiple target locations; and increasing the target location condition may be: attending The number of members and the members of the conference have a small collection and then form a subset and then go to the target location. For example, a member drives a few nearby members and then goes to the target location.

本步骤之后，所述方法还包括：将确定的参会成员到各个目标位置的最短路径保存至集会群信息列表中。After the step, the method further includes: saving the determined shortest path of the participating member to each target location to the conference group information list.

步骤103：依据所述参会成员到各个目标位置的最短路径对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径；Step 103: Sort the assembly consumption of the assembly group to each target location according to the shortest path of the participant member to each target location, and select a final target location and an optimal path of the cluster meeting according to the sorting result;

本步骤包括：对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径；The step includes: combining the shortest paths of the participating members to each target position, obtaining the shortest path of the meeting group to each target position, and calculating the reaching group to reach each target position according to the shortest path of the meeting group reaching each target position. The assembly consumes, sorts the assembly consumption, and determines the final target location and optimal path of the cluster according to the sorting result;

其中，所述集会消耗包括：到达目标位置的费用消耗及到达目标位置的时间消耗；这里，所述到达目标位置的时间消耗为所有参会成员到达目标位置所需的时间；所述到达目标位置的费用消耗为所有参会成员到达目标位置所需的费用；The collection consumption includes: a cost consumption to reach the target location and a time consumption to reach the target location; where the time consumption of reaching the target location is the arrival of all the participating members. The time required for the target location; the cost of reaching the target location is the cost of all participating members to reach the target location;

所述最优路径可以为使用此路径到达对应目标位置所需时间最短或所需费用最少，亦或者所需时间及所需费用虽不为最少但相对较合适。The optimal path may be the shortest time required to use the path to reach the corresponding target location or the minimum cost required, or the required time and required cost may not be the least but relatively suitable.

依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的费用消耗包括：According to the shortest path of the assembly group to each target location, the cost consumption of the assembly group to reach each target location includes:

依据集会群到达每个目标位置的最短路径、每个参会成员对应的出行方式及当前每种出行方式的计价标准，计算得到集会群到达各个目标位置的费用消耗。According to the shortest path of the meeting group to each target position, the travel mode of each participating member and the current pricing standard of each travel mode, the cost consumption of the assembly group to each target position is calculated.

依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的所需的时间包括：According to the shortest path of the assembly group to each target location, the time required for the assembly group to reach each target location includes:

依据集会群到达每个目标位置的最短路径、每个参会成员对应的出行方式及每种出行方式的速度参考值，计算得到集会群到达各个目标位置的所需的时间。The time required for the assembly group to reach each target position is calculated according to the shortest path of the assembly group to each target position, the travel mode corresponding to each participant member, and the speed reference value of each travel mode.

本步骤之后，所述方法还包括：终端发送群集会的最终目标位置及最优路径给各个参会成员，并在电子地图中显示所述最终目标位置及最优路径；如此，可利用LBS指引参会成员按照所述最优路径到达最终目标位置。After the step, the method further includes: the terminal sends the final target location of the cluster meeting and the optimal path to each participating member, and displays the final target location and the optimal path in the electronic map; thus, the LBS guide can be utilized. The participating members arrive at the final target position according to the optimal path.

图2为本发明实施例二群集会最优路径选择方法流程示意图，如图2所示，本实施例群集会最优路径选择方法流程包括：2 is a schematic flowchart of a method for selecting an optimal path for a cluster according to Embodiment 2 of the present invention. As shown in FIG. 2, the method for selecting an optimal path for a cluster in this embodiment includes:

步骤201：获取并存储参会成员的成员信息；Step 201: Acquire and store member information of the participating members;

这里，所述获取参会成员的成员信息包括：终端发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；Here, the obtaining the member information of the participating member includes: the terminal sending the cluster request and the positioning instruction to the group members in the assembly group, and receiving and extracting the member information reported by each participating member;

其中，终端可通过设置的一个输入框或按钮发送群集会请求及定位指令给集会群内群成员，终端发送群集会请求及定位指令给集会群内群成员后，群成员既可选择接受群集会请求及定位指令参加集会，也可选择拒绝所述群集会请求；The terminal may send a cluster request and a positioning instruction to the group members in the assembly group through an input box or button, and the terminal member may select and accept the cluster meeting after sending the cluster request and positioning instruction to the group members in the assembly group. Request and location instructions to participate in the rally, you can also choose to refuse The cluster will request;

所述集会群可以为预先设置的各种即时通讯群，如微信群或QQ群；也可以为终端的名片夹群等；The assembly group may be a preset instant messaging group, such as a WeChat group or a QQ group; or may be a terminal card group of the terminal;

所述成员信息包括参会成员的位置信息及要求信息；其中，所述参会成员的位置信息为参会成员依据LBS进行定位后确定的；所述要求信息为参会成员获取的用户通过人机交互界面输入的要求信息，用户既可输入具体要求，也可通过人机界面提供的选项进行选择；The member information includes the location information and the request information of the participating member; wherein the location information of the participating member is determined by the participating member according to the LBS; the request information is the user passing by the participating member. The required information input by the machine interaction interface, the user can input specific requirements, or can be selected through the options provided by the human-machine interface;

在一实施例中，所述存储为加密存储；可以采用现有的各种加密存储方式对参会成员的成员信息进行加密保存。In an embodiment, the storage is encrypted storage; the member information of the participating members may be encrypted and saved by using various existing encryption storage methods.

步骤202：依据所述成员信息确定多个目标位置；Step 202: Determine a plurality of target locations according to the member information.

提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置；这里，所述符合要求指的是符合所述要求信息；Extracting the location information and the request information of the member in the member information, displaying the location of each participating member on the electronic map, and obtaining a topology map including the positions of all the participating members, and using the regional restriction search according to the request information The algorithm searches for a plurality of target locations in the topology map that meet the requirements; where the compliance requirements refer to the information that meets the requirements;

其中，获取包含所有参会成员位置的拓扑图包括：在电子地图上显示各个参会成员的位置，获取包含各个参会成员的位置的拓扑图，不断扩大拓扑图面积，直至拓扑图中包含所有参会成员的位置。The obtaining the topology map including the positions of all the participating members includes: displaying the position of each participating member on the electronic map, obtaining a topology map including the positions of the respective participating members, and expanding Topology area until the location of all participating members is included in the topology map.

步骤203：依据增加的目标位置条件对所述多个目标位置进行筛选；Step 203: Filter the multiple target locations according to the increased target location conditions.

这里所述增加的目标条件可以为实时目标条件；如参会成员数目为30，则选取所述多个目标位置中能容纳30个成员的目标位置，剔除不符合所述增加的目标位置条件的目标位置，以对多个目标位置进行收敛。The increased target condition described herein may be a real-time target condition; if the number of participating members is 30, the target position of the plurality of target positions capable of accommodating 30 members is selected, and the condition that does not meet the increased target position is excluded. Target location to converge on multiple target locations.

步骤204：确定参会成员到各个筛选后目标位置的最短路径，并将所述最短路径存储至群信息列表；Step 204: Determine a shortest path of the participating member to each of the filtered target locations, and store the shortest path to the group information list.

这里，所述确定参会成员到各个筛选后目标位置的最短路径包括：Here, the shortest path for determining the participating members to each of the filtered target locations includes:

依据地图信息分层提取算法对所述筛选后目标位置进行道路分层处理，然后通过迪杰斯特拉Dijkstra算法计算参会成员到各个筛选后目标位置的最短路径；Performing road layering processing on the filtered target position according to the map information layering extraction algorithm, and then calculating the shortest path of the participating members to each selected target position by the Dijkstra Dijkstra algorithm;

其中，依据地图信息分层提取算法对所述筛选后目标位置进行道路分层处理包括：依据Mapinfo地图分层处理方法对所述筛选后目标位置进行道路分层处理，提取地图中道路分层地图，以便于计算主干道上的路径；The road layering processing on the filtered target location according to the map information layering extraction algorithm includes: performing road layering processing on the filtered target location according to the Mapinfo map layering processing method, and extracting a road layered map in the map. In order to calculate the path on the main road;

在本实施例中，经目标条件筛选后的目标位置包括：V1、V2、V3、V4、V5；In this embodiment, the target position after being filtered by the target condition includes: V1, V2, V3, V4, V5;

步骤1：初始时令S＝{V0}，T＝{V1，V2，V3，V4，V5}；Step 1: Initial seasonality S = {V0}, T = {V1, V2, V3, V4, V5};

其中，集合S和集合T中每一个顶点对应一个距离值；V0为源点，是某个参会成员的位置点，即参会成员的经纬度坐标，集合S中的顶点对应的是从V0到此顶点的最短距离值；集合T中的顶点对应的是包括集合S 中的某个顶点作为中间点的最短距离值；Each vertex of the set S and the set T corresponds to a distance value; V0 is a source point, which is a position point of a participating member, that is, a latitude and longitude coordinate of the participating member, and the vertex in the set S corresponds to from the V0 to The shortest distance value of this vertex; the vertex in the set T corresponds to the set S a vertex in the middle as the shortest distance value of the intermediate point;

若不存在<V0,Vi>，d(V0,Vi)为∞；这里，所述Vi为集合T中的顶点；i为正整数，且i∈[1,5]。If there is no <V0, Vi>, d(V0, Vi) is ∞; here, the Vi is a vertex in the set T; i is a positive integer, and i ∈ [1, 5].

步骤2：从集合T中选取顶点Vk加入集合S；其中Vk不在集合S中，且Vk对应的距离值为集合T中所有对应的距离值最小的顶点，即集合T中只有Vk对应的距离值最小；其中，k为正整数，且k∈[1,5]；在本实施例中，V2对应的距离值最小，因此，将V2加入集合S，S＝{V0，V2}。Step 2: Select a vertex Vk from the set T to join the set S; wherein Vk is not in the set S, and the distance value corresponding to Vk is the vertice with the smallest distance value in the set T, that is, the distance value corresponding to Vk in the set T The smallest; wherein k is a positive integer, and k ∈ [1, 5]; in this embodiment, the distance value corresponding to V2 is the smallest, and therefore, V2 is added to the set S, S={V0, V2}.

步骤3：更新集合T中的顶点对应的距离值；即更新剩余顶点V1、V3、V4、V5对应的距离值；Step 3: Update the distance value corresponding to the vertex in the set T; that is, update the distance value corresponding to the remaining vertices V1, V3, V4, and V5;

这里，由于将集合T中的顶点加入集合S后，集合T中的顶点对应的距离值可能会缩短，因此，在将V2加入集合S后，需重新计算集合T中的顶点对应的距离值并更新。Here, since the vertices in the set T are added to the set S, the distance values corresponding to the vertices in the set T may be shortened. Therefore, after adding V2 to the set S, the distance value corresponding to the vertices in the set T needs to be recalculated and Update.

这里，将V1、V2、V3、V4、V5加入集合S后，V1、V2、V3、V4、V5对应的路径即为参会成员V0到目标位置V1、V2、V3、V4、V5的最短路径。Here, after V1, V2, V3, V4, and V5 are added to the set S, the paths corresponding to V1, V2, V3, V4, and V5 are the shortest path from the member V0 to the target positions V1, V2, V3, V4, and V5. .

步骤205：依据所述最短路径对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径；Step 205: Sort the assembly consumption of the assembly group to each target location according to the shortest path, and select a final target location and an optimal path of the cluster meeting according to the sorting result;

本步骤包括：对群成员到各个筛选后目标位置的最短路径进行组合，得到集会群到达每个筛选后目标位置的最短路径，并依据集会群到达每个筛选后目标位置的最短路径计算得到集会群到达各个筛选后目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径；The step includes: combining the shortest paths of the group members to the respective target positions after the screening, obtaining the shortest path of the assembly group to each target position after the screening, and calculating the assembly according to the shortest path of the assembly group to each filtered target position. The group reaches the collection of each target position after filtering, consumes the ranking consumption, and selects the final target position and the optimal path of the cluster according to the sorting result;

其中，所述集会消耗包括：到达目标位置的费用消耗及到达目标位置的时间消耗；这里，所述到达目标位置的时间消耗为所有参会成员到达目标位置所需的时间；所述到达目标位置的费用消耗为所有参会成员到达目标位置所需的费用；Wherein, the assembly consumption includes: the cost consumption to reach the target location and the arrival of the target location Time consumption; here, the time consumption to reach the target location is the time required for all the participating members to reach the target location; the cost of reaching the target location is the cost required for all the participating members to reach the target location;

所述最优路径可以为使用此路径到达对应目标位置所需时间最短或所需费用最少，亦或者所需时间及所需费用虽不为最少但相对较合适，可根据实际需要进行选取。The optimal path may be the shortest time required to use the path to reach the corresponding target location or the minimum cost required, or the required time and required cost are not the least but relatively suitable, and may be selected according to actual needs.

步骤206：发送群集会的最终目标位置及最优路径给各个参会成员，并在电子地图中显示所述最终目标位置及最优路径；Step 206: Send the final target location and the optimal path of the cluster meeting to each participating member, and display the final target location and the optimal path in the electronic map;

如此，可利用LBS指引参会成员按照所述最优路径到达最终目标位置。In this way, the LBS can be used to guide the participating members to reach the final target position according to the optimal path.

图3为本发明实施例群集会最优路径选择装置组成结构示意图，如图3所示，本发明实施例群集会最优路径选择装置组成包括：获取模块31、确定模块32及选择模块33；其中，3 is a schematic structural diagram of a clustering optimal path selection device according to an embodiment of the present invention. As shown in FIG. 3, the cluster optimal path selection device comprises: an obtaining module 31, a determining module 32, and a selecting module 33; among them,

所述获取模块31，配置为获取参会成员的成员信息；The obtaining module 31 is configured to obtain member information of the participating member;

所述确定模块32，配置为依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径； The determining module 32 is configured to determine a plurality of target locations according to the member information, and determine a shortest path of the participating members to each target location;

所述选择模块33，配置为依据所述参会成员到各个目标位置的最短路径对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。The selection module 33 is configured to sort the assembly consumption of the assembly group to each target location according to the shortest path of the participant member to each target location, and select a final target location and an optimal path of the cluster meeting according to the sorting result.

在一实施例中，所述获取模块31获取参会成员的成员信息包括：所述获取模块31发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；其中，In an embodiment, the obtaining, by the obtaining module 31, the member information of the participating member includes: the obtaining module 31 sends a cluster request and a positioning instruction to the group members in the assembly group, and receives and extracts the member information reported by each participating member. ;among them,

所述成员信息包括：参会成员的位置信息及要求信息；其中，所述参会成员的位置信息为参会成员依据LBS进行定位后确定的；所述要求信息为参会成员获取的用户通过人机交互界面输入的要求信息；The member information includes: the location information of the participating member and the request information; wherein the location information of the participating member is determined by the participating member according to the LBS; the request information is obtained by the user who is obtained by the participating member Requirements information input by the human-computer interaction interface;

在一实施例中，所述装置还包括存储模块34，配置为加密存储参会成员的成员信息，以及存储集会群信息列表。In an embodiment, the apparatus further includes a storage module 34 configured to encrypt member information of the storage member and to store the list of the assembly information.

在一实施例中，所述确定模块32依据所述成员信息确定多个目标位置包括：In an embodiment, the determining module 32 determines, according to the member information, a plurality of target locations, including:

所述确定模块32提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置。The determining module 32 extracts location information and requirement information of the participating members in the member information, displays the location of each participating member on the electronic map, and acquires a topology map including the positions of all participating members, according to the requirement information. The region-restricted search algorithm is used to search for multiple target locations in the topology map that meet the requirements.

在一实施例中，所述确定模块32，还配置为依据增加的目标位置条件，对所述多个目标位置进行筛选；In an embodiment, the determining module 32 is further configured to filter the plurality of target locations according to the increased target location condition;

在一实施例中，所述确定模块32确定参会成员到各个目标位置的最短路径包括：In an embodiment, the determining module 32 determines that the shortest path of the participating members to each target location includes:

所述确定模块32依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过Dijkstra算法计算参会成员到各个目标位置的最短路径；The determining module 32 performs the multiple target locations according to a map information layering extraction algorithm. Road layering processing, and then calculating the shortest path of the participating members to each target position through the Dijkstra algorithm;

其中，所述确定模块32通过Dijkstra算法计算参会成员到各个目标位置的最短路径包括：The determining module 32 calculates the shortest path of the participating members to each target location by using the Dijkstra algorithm, including:

步骤1：所述确定模块32设置S＝{V0}，T＝{所有目标位置点}；Step 1: The determining module 32 sets S={V0}, T={all target position points};

步骤2：所述确定模块32从集合T中选取顶点Vk加入集合S；其中Vk不在集合S中，且Vk对应的距离值为集合T中所有对应的距离值最小的顶点，即集合T中只有Vk对应的距离值最小；其中，k为正整数。Step 2: The determining module 32 selects a vertex Vk from the set T to join the set S; wherein Vk is not in the set S, and the distance value corresponding to Vk is the vertice with the smallest distance value in the set T, that is, only the set T The distance value corresponding to Vk is the smallest; where k is a positive integer.

步骤3：所述确定模块32更新集合T中的顶点对应的距离值；Step 3: The determining module 32 updates the distance value corresponding to the vertex in the set T;

所述确定模块32重复步骤2、3，直至集合S中包含集合T中所有的顶点；The determining module 32 repeats steps 2 and 3 until all the vertices in the set T are included in the set S;

这里，集合S中除V0以外的顶点Vm对应的路径即为参会成员V0到目标位置Vm的最短路径。Here, the path corresponding to the vertex Vm other than V0 in the set S is the shortest path from the participant member V0 to the target position Vm.

在一实施例中，所述选择模块33依据所述参会成员到各个目标位置的最短路径对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径包括：In an embodiment, the selection module 33 is based on the participating members to each target location. The shortest path sorts the assembly consumption of the assembly group to each target location, and selects the final target location and optimal path of the cluster according to the sorting result:

所述选择模块33对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径；The selection module 33 combines the shortest paths of the participating members to the respective target positions, obtains the shortest path of the assembly group to each target position, and calculates the assembly group to reach each target according to the shortest path of the assembly group to each target position. Collecting the location, sorting the aggregate consumption, and determining the final target location and the optimal path of the cluster according to the sorting result;

其中，所述集会消耗包括：到达目标位置的费用消耗及到达目标位置的时间消耗；这里，所述到达目标位置的时间消耗为所有参会成员到达目标位置所需的时间；所述到达目标位置的费用消耗为所有参会成员到达目标位置所需的费用；The collection consumption includes: a cost consumption to reach the target location and a time consumption to reach the target location; where the time consumption of reaching the target location is the time required for all the participating members to reach the target location; The cost is the cost of all participants to reach the target location;

在一实施例中，所述装置还包括发送模块35及显示模块36；其中，所述发送模块35，配置为发送群集会的最终目标位置及最优路径给各个参会成员； In an embodiment, the device further includes a sending module 35 and a display module 36. The sending module 35 is configured to send a final target location and an optimal path of the cluster meeting to each participating member.

所述显示模块36，配置为电子地图中显示所述最终目标位置及最优路径。The display module 36 is configured to display the final target location and an optimal path in an electronic map.

本发明实施例中提出的群集会最优路径选择装置中的获取模块、确定模块、选择模块及发送模块都可以通过处理器来实现，当然也可通过具体的逻辑电路实现；其中所述处理器可以是移动终端或服务器上的处理器，在实际应用中，处理器可以为中央处理器(CPU)、微处理器(MPU)、数字信号处理器(DSP)或现场可编程门阵列(FPGA)等，所述存储模块可由存储器实现，显示模块可由显示器实现。The obtaining module, the determining module, the selecting module, and the sending module in the cluster optimal path selecting apparatus proposed in the embodiment of the present invention may be implemented by a processor, and may also be implemented by a specific logic circuit; wherein the processor It can be a processor on a mobile terminal or a server. In practical applications, the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA). Etc., the storage module can be implemented by a memory, and the display module can be implemented by a display.

本发明实施例中，如果以软件功能模块的形式实现上述群集会最优路径选择方法，并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。基于这样的理解，本发明实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机、服务器、或者网络设备等)执行本发明各个实施例所述方法的全部或部分。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read Only Memory，ROM)、磁碟或者光盘等各种可以存储程序代码的介质。这样，本发明实施例不限制于任何特定的硬件和软件结合。In the embodiment of the present invention, if the above cluster optimal path selection method is implemented in the form of a software function module, and is sold or used as a separate product, it may also be stored in a computer readable storage medium. Based on such understanding, the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions. A computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention. The foregoing storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read only memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.

相应地，本发明实施例还提供一种计算机存储介质，该计算机存储介质中存储有计算机程序，该计算机程序用于执行本发明实施例的上述群集会最优路径选择方法。Correspondingly, the embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a computer program, and the computer program is used to execute the cluster optimal path selection method according to the embodiment of the present invention.

以上所述仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围。 The above is only the preferred embodiment of the present invention and is not intended to limit the scope of the present invention.

Claims

一种群集会最优路径选择方法，所述方法包括：A cluster optimal path selection method, the method comprising:

获取参会成员的成员信息；Obtain member information of the participating members;

依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；Determining a plurality of target locations according to the member information, and determining a shortest path of the participating members to each target location;

依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。According to the shortest path of the participating members to each target position, the assembly consumption of the assembly group reaching each target position is sorted, and the final target position and the optimal path of the cluster meeting are selected according to the sorting result.
根据权利要求1所述方法，其中，所述获取参会成员的成员信息包括：发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；其中，The method of claim 1, wherein the obtaining the member information of the participating member comprises: sending the cluster to request and locating the command to the group members in the assembly group, and receiving and extracting the member information reported by each participating member; wherein

所述成员信息包括：参会成员的位置信息及要求信息。The member information includes: location information and request information of the participating members.
根据权利要求1或2所述方法，其中，所述依据所述成员信息确定多个目标位置包括：The method according to claim 1 or 2, wherein said determining a plurality of target locations based on said member information comprises:

提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置。Extracting the location information and the request information of the member in the member information, displaying the location of each participating member on the electronic map, and obtaining a topology map including the positions of all the participating members, and using the regional restriction search according to the request information The algorithm search obtains multiple target locations in the topology map that meet the requirements.
根据权利要求1或2所述方法，其中，所述确定参会成员到各个目标位置的最短路径包括：The method according to claim 1 or 2, wherein said determining the shortest path of the participating members to the respective target locations comprises:

依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过迪杰斯特拉算法计算参会成员到各个目标位置的最短路径。The plurality of target locations are subjected to road layering processing according to the map information layering extraction algorithm, and then the shortest path of the participating members to the respective target locations is calculated by the Dijkstra algorithm.
根据权利要求1或2所述方法，其中，所述依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序包括： The method according to claim 1 or 2, wherein the sorting the aggregate consumption of the assembly group to each target location according to the shortest path of the participant member to each target location comprises:

对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径。Combine the shortest paths of the participants to each target position, obtain the shortest path of the assembly group to each target position, and calculate the assembly consumption of the assembly group to each target position according to the shortest path of the assembly group to each target position. The collection consumption is sorted, and the final target position and the optimal path of the cluster are determined according to the sorting result.
一种群集会最优路径选择装置，所述装置包括：获取模块、确定模块及选择模块；其中，A clustering optimal path selecting device, the device comprising: an obtaining module, a determining module and a selecting module; wherein

所述获取模块，配置为获取参会成员的成员信息；The obtaining module is configured to obtain member information of the participating member;

所述确定模块，配置为依据所述成员信息确定多个目标位置，并确定参会成员到各个目标位置的最短路径；The determining module is configured to determine a plurality of target locations according to the member information, and determine a shortest path of the participating members to each target location;

所述选择模块，配置为依据所述参会成员到各个目标位置的最短路径，对集会群到达各个目标位置的集会消耗进行排序，并依据排序结果选择群集会的最终目标位置及最优路径。The selection module is configured to sort the assembly consumption of the assembly group to each target location according to the shortest path of the participant member to each target location, and select a final target location and an optimal path of the cluster meeting according to the sorting result.
根据权利要求6所述装置，其中，所述获取模块，配置为发送群集会请求及定位指令给集会群内群成员，接收并提取各参会成员上报的成员信息；其中，The device according to claim 6, wherein the obtaining module is configured to send a cluster request and a positioning instruction to the group members in the assembly group, and receive and extract the member information reported by each member;

所述成员信息包括：参会成员的位置信息及要求信息。The member information includes: location information and request information of the participating members.
根据权利要求6或7所述装置，其中，所述确定模块，配置为提取所述成员信息中参会成员的位置信息及要求信息，在电子地图上显示各个参会成员的位置，并获取包含所有参会成员位置的拓扑图，依据所述要求信息，利用区域限制搜索算法搜索得到拓扑图中符合要求的多个目标位置。The device according to claim 6 or 7, wherein the determining module is configured to extract location information and requirement information of the participating members in the member information, display the location of each participating member on the electronic map, and obtain the inclusion A topology map of all participating member positions, according to the requirement information, uses a region-restricted search algorithm to search for a plurality of target locations in the topology map that meet the requirements.
根据权利要求6或7所述装置，其中，所述确定模块，配置为依据地图信息分层提取算法对所述多个目标位置进行道路分层处理，然后通过迪杰斯特拉算法计算参会成员到各个目标位置的最短路径。The apparatus according to claim 6 or 7, wherein the determining module is configured to perform road layering processing on the plurality of target locations according to a map information layer extraction algorithm, and then calculate the participation by the Dijkstra algorithm The shortest path from member to each target location.
根据权利要求6或7所述装置，其中，所述选择模块，配置为对参会成员到各个目标位置的最短路径进行组合，得到集会群到达每个目标位置的最短路径，并依据集会群到达每个目标位置的最短路径计算得到集会群到达各个目标位置的集会消耗，对所述集会消耗进行排序，并依据排序结果确定群集会的最终目标位置及最优路径。The apparatus according to claim 6 or 7, wherein the selection module is configured to combine the shortest paths of the participating members to the respective target positions, and obtain the assembly group to reach each target. The shortest path of the location, and calculate the assembly consumption of the assembly group to each target location according to the shortest path of the assembly group to each target location, sort the collection consumption, and determine the final target location and the most Excellent path.
一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，该计算机可执行指令用于执行权利要求1至5任一项所述的群集会最优路径选择方法。 A computer storage medium having stored therein computer executable instructions for performing the cluster optimal path selection method of any one of claims 1 to 5.