Search

CN-122022320-A - Intelligent volunteer scheduling system

CN122022320ACN 122022320 ACN122022320 ACN 122022320ACN-122022320-A

Abstract

The invention discloses an integrated volunteer intelligent scheduling system, which relates to the technical field of intelligent scheduling and comprises an information acquisition module, a task merging module and a scheduling execution module, wherein the information acquisition module acquires and structurally stores basic information of a micro task and real-time state information of a volunteer and forms a corresponding information set, the task merging module automatically aggregates a candidate merging task group based on the spatial position relevance of the micro task to generate a minimum closed spatial boundary, and filters the volunteers in the boundary to form a dedicated volunteer pool, and the scheduling execution module synchronously executes accumulated time length matching, line linking and service object accessibility verification on the volunteers to reject unqualified volunteers from the dedicated volunteer pool to obtain a final schedulable volunteer pool. The invention realizes accurate adaptation of the micro task and the volunteer, and reduces ineffective execution risk while improving scheduling efficiency.

Inventors

  • ZHOU MIN
  • CHANG YIFEI
  • Han Zhuoyan

Assignees

  • 河南农业大学

Dates

Publication Date
20260512
Application Date
20260128

Claims (10)

  1. 1. An integrated volunteer intelligent scheduling system, comprising: The information acquisition module is used for respectively acquiring basic information of all micro-tasks to be executed and real-time state information of volunteers in the same area by the scheduling system, and carrying out structural storage on the acquired information to form a micro-task information set and a volunteer state set; The task merging module is used for reading position coordinates of all micro-tasks to be executed in the micro-task information set by the scheduling system, automatically aggregating the position coordinates into a candidate merging task group through spatial position correlation among the micro-tasks to be executed, extracting position coordinates of all micro-task nodes in the group, generating a minimum closed space boundary of the task group, then reading current position coordinates of all volunteers in the volunteer state set, screening the volunteers with the current positions in the corresponding minimum closed space boundary, and dividing the volunteers into a dedicated volunteer pool of the candidate merging task group; And the dispatching execution module is used for simultaneously executing accumulated time length matching verification, line connection verification and service object accessibility verification aiming at volunteers in the dedicated volunteer pool, and if one of the verification fails, the corresponding volunteer is removed from the dedicated volunteer pool to obtain the dedicated volunteer pool which can be finally dispatched by the candidate merging task group.
  2. 2. The integrated volunteer intelligent scheduling system of claim 1, wherein the basic information of the micro-task comprises position coordinates, minimum time consumption of single execution and real-time reachable state of a service object, and the real-time state information of the volunteer comprises line time consumption records of tasks of the same type as a current geographic position, a declared idle time interval and a historical region.
  3. 3. The integrated volunteer intelligent scheduling system of claim 1, wherein the specific operations of automatically aggregating into candidate merge task groups by spatial location correlation are: The scheduling system reads the position coordinates of all the micro-tasks to be executed in the micro-task information set, takes each micro-task to be executed as an independent space node, and judges whether two nodes accord with each other in the direct space radiation range of the other side aiming at any two micro-task nodes, if so, the two micro-task nodes are judged to form a bidirectional adjacent node pair, otherwise, the two micro-task nodes are judged to be non-adjacent nodes; After the scheduling system carries out bidirectional adjacency judgment on all the micro-task nodes to be executed, a micro-task adjacency relation list is generated, and an initial adjacency node cluster set is screened out based on the micro-task adjacency relation list; For each node cluster in the initial adjacent node cluster set, the scheduling system acquires the position coordinates of all nodes in the cluster, calculates the space distance between any two nodes, and executes space continuity check, if the maximum space distance between all nodes in the cluster is less than or equal to the maximum distance between physical space units to which the corresponding micro-task execution place belongs, the cluster is judged to pass the check, and is directly locked into a candidate merging task group; If the verification is not passed, splitting the cluster into minimum sub-clusters which take the core node as a center and meet the space continuity, locking each sub-cluster as a candidate merging task group, and independently locking the isolated node as the candidate merging task group.
  4. 4. The integrated volunteer intelligent scheduling system of claim 3, wherein determining whether the micro-task node M i is within the direct spatial radiation range of another micro-task node M j specifically comprises: For the micro task M j , matching the physical space unit to which the execution place belongs, collecting the coordinates of all vertexes of the physical space unit, extracting coordinate extremum, determining the boundary of the direct space radiation range of M j , wherein the specific boundary expression is x j,min ≤x≤x j,max and y j,min ≤y≤y j,max , x j,min 、x j,max is the minimum value and the maximum value of the x-axis coordinates of the physical space unit corresponding to M j respectively, and y j,min 、y j,max is the minimum value and the maximum value of the y-axis coordinates of the physical space unit corresponding to M j respectively; The coordinates (x i ,y i ) of the micro-task node M i are obtained and substituted into the boundary expression described above, and if x j,min ≤x i ≤x j,max and y j,min ≤y i ≤y j,max are satisfied, it is determined that M i is within the direct spatial radiation range of M j , otherwise, it is determined that M i is not within the direct spatial radiation range of M j .
  5. 5. The integrated volunteer intelligent scheduling system of claim 3, wherein the specific operation of screening out the initial set of neighboring node clusters is: the scheduling system reads the micro-task adjacency list, counts the number of the bidirectional adjacency nodes of each node, and generates a statistical list containing node identifiers-the number of the bidirectional adjacency nodes; Initializing an unprocessed node set and a processed node set, and setting an initial adjacent node cluster set to be empty; screening out the node with the largest number of the bidirectional adjacent nodes from the untreated node set, and determining the node as the core node of the round, wherein if a plurality of nodes with the same number and the maximum number of the bidirectional adjacent nodes exist, one node is randomly selected as the core node of the round; Screening all nodes marked as bidirectional adjacencies with the core node of the round from the micro-task adjacency list, forming initial adjacency node clusters of the round by the core node of the round and the nodes together, and adding the clusters into an initial adjacency node cluster set; and removing all nodes in the initial adjacent node cluster of the round from the untreated node set, adding the treated node set at the same time, and continuously repeating the steps until the untreated node set is empty.
  6. 6. The integrated volunteer intelligent scheduling system of claim 1, wherein the minimum closed space boundary specification operation to generate the candidate merge task group is: The scheduling system extracts the position coordinates of all the micro task nodes in the candidate merging task group, calculates Euclidean distances from the micro task nodes to all other nodes in the candidate merging task group aiming at each node P i (X i ,Y i , and sums the Euclidean distances to obtain a path density value S i of the node; Ordering all nodes from small to large according to S i , selecting the nodes of which the number is 50% before ordering as a core aggregation node subset, and calculating the coordinate mean value of the core aggregation node subset Defining the coordinate point as a core aggregation center Q; taking Q as an origin, calculating azimuth angle of each node P i in the candidate merging task group relative to Q Azimuth angle range is [0,2 pi); Azimuth angles of all nodes Ascending order is carried out, and each azimuth angle after order is arranged The Euclidean distance r i of nodes P i to Q is calculated and defined as The radiation radius of the azimuth; each of which is connected in turn in azimuth order Azimuthal radius end point And forming a closed polygon, wherein if all the micro-task nodes are positioned in the closed polygon, the closed polygon is the minimum closed space boundary of the candidate merging task group.
  7. 7. The integrated volunteer intelligent scheduling system of claim 1, wherein the specific operations of performing the cumulative length matching check are: The scheduling system extracts the minimum single-execution time consumption of each subtask in the candidate merging task group, and sums up the minimum single-execution time consumption of all subtasks to obtain the total time consumption of the subtask foundation; The scheduling system is used for scheduling historical line time consumption records of volunteers, extracting average line movement time consumption among adjacent subtasks when the volunteers execute similar tasks in the areas of the candidate merging task groups, and sequentially summing the average line movement time consumption among the adjacent subtasks according to the spatial distribution sequence of the subtasks in the merging task groups to obtain a line movement time consumption sum; The scheduling system adds the basic time consumption sum of the subtasks and the moving time consumption sum of the moving lines to obtain the total time consumption of the candidate merging task group, and calls the declared idle time interval of the volunteers, and checks whether the total time consumption of the candidate merging task group is completely in the interval, namely the starting time of the declared idle time interval is less than or equal to the execution starting time of the candidate merging task group, and the ending time of the candidate merging task group is less than or equal to the ending time of the declared idle time interval.
  8. 8. The integrated volunteer intelligent scheduling system of claim 1, wherein the specific operations to perform wire-tie verification are: The scheduling system acquires the current position coordinates of the volunteers and the position coordinates of all subtasks in the candidate merging task group, calculates the linear distance from the starting node to all subtask nodes by taking the current position coordinates of the volunteers as the starting node, selects the subtask node closest to the starting node as the next executing node, takes the executing node as a new reference node, repeats the distance calculation and node selection operation, sequentially determines the subsequent executing nodes, synchronously marks the predicted executing time length of each subtask on the corresponding node, and forms a line node chain with the executing time length; For the generated line node chain, the non-foldback and coverage integrity needs to be satisfied at the same time: the method comprises the steps of verifying that no foldback exists, extracting coordinates of two adjacent nodes in a line node chain to generate path vectors, calculating included angles of every two continuous path vectors, judging that a path is not foldback if all included angles are more than 90 degrees, and judging that foldback detour exists in the path section if any included angle is less than or equal to 90 degrees; And (3) coverage integrity verification, counting the number of subtask nodes in a line node chain, confirming that the number is completely consistent with the total number of subtasks in the candidate merging task group, and judging that the line covers all the subtasks if no repeated nodes exist.
  9. 9. The integrated volunteer intelligent scheduling system of claim 1, wherein the specific operations of performing service object reachability verification are: The scheduling system extracts core information of each subtask node in the line node chain, wherein the core information comprises a subtask identifier, a corresponding service object identifier, an expected arrival time T arrive-i and an expected execution duration T exec-i , and calculates an accessibility determination time window W i =[T arrive-i -△t,T arrive-i +T exec-i of each subtask, wherein Deltat is an advance determination buffer time; Binding the W i of each subtask node, the unique identification of the service object and the subtask identification one by one to generate a correlation table of a duration window and the service object, wherein the correlation table is completely consistent with the sequence of a line node chain; the scheduling system starts a real-time state pulling mechanism according to the operation sequence of the association table, and checks whether the following two conditions are satisfied simultaneously according to the real-time state data of each subtask: The first condition is that whether the current feedback of the service object is yes or not, and the expected reachable duration is more than or equal to T exec-i ; In the execution process of the subtasks, the scheduling system refreshes the state of the service object once in real time every T exec-i /3 of time, and confirms that the state does not become unreachable; If any condition is not passed, the scheduling system immediately triggers exception handling, namely backtracking to a line node chain with execution duration, skipping the current subtask, re-planning a time window of a subsequent node, and marking the current subtask as to-be-complemented execution.
  10. 10. The integrated volunteer intelligent scheduling system of claim 9, wherein the enabling of the real-time status pull mechanism specifically comprises: When the scheduling system time reaches the starting time T arrive-i -Deltat of each subtask W i , automatically sending a state pulling request to a service object terminal; And receiving real-time state data fed back by the service object side, wherein the real-time state data comprises two core information of whether the current state is reachable or not and the expected reachable duration, if the feedback is not received within delta t/2, the scheduling system starts secondary pulling, and if the feedback is still not received, the scheduling system marks the current state as unreachable.

Description

Intelligent volunteer scheduling system Technical Field The invention relates to the technical field of intelligent scheduling, in particular to an integrated intelligent volunteer scheduling system. Background With the refined development of volunteer service, the intelligent volunteer scheduling system has become a core support for improving service efficiency and optimizing resource allocation, however, the following defects still exist in the existing intelligent volunteer scheduling technology: Firstly, the micro-tasks are combined and manually grouped or simply arranged in a distance manner, the spatial adjacent relation and continuity among the micro-tasks are not fully considered, the task groups after being combined are easily distributed unevenly, and the time consumption of volunteers for executing the line is increased; Secondly, volunteer screening only depends on basic information preliminary matching, does not combine with task space range to carry out accurate screening, and lacks synchronous verification of time length matching, line rationality and service object accessibility, so that the problems of time conflict, path detour or temporary unreachable service object and the like occur; thirdly, the task space boundary generation method mostly adopts simple coordinate extremum or fixed form fitting, and the dead space occupation ratio is high, so that the matching accuracy of volunteers is affected; thus, there is a need for an integrated volunteer intelligent scheduling system. Disclosure of Invention Aiming at the defects of the prior art, the invention provides an integrated intelligent volunteer scheduling system, which solves the problems of unscientific merging of the existing micro-tasks, inaccurate matching of volunteers and poor service accessibility. In order to achieve the purpose, the intelligent volunteer scheduling system is realized by the following technical scheme that the intelligent volunteer scheduling system comprises: The information acquisition module is used for respectively acquiring basic information of all micro-tasks to be executed and real-time state information of volunteers in the same area by the scheduling system, and carrying out structural storage on the acquired information to form a micro-task information set and a volunteer state set; The task merging module is used for reading position coordinates of all micro-tasks to be executed in the micro-task information set by the scheduling system, automatically aggregating the position coordinates into a candidate merging task group through spatial position correlation among the micro-tasks to be executed, extracting position coordinates of all micro-task nodes in the group, generating a minimum closed space boundary of the task group, then reading current position coordinates of all volunteers in the volunteer state set, screening the volunteers with the current positions in the corresponding minimum closed space boundary, and dividing the volunteers into a dedicated volunteer pool of the candidate merging task group; And the dispatching execution module is used for simultaneously executing accumulated time length matching verification, line connection verification and service object accessibility verification aiming at volunteers in the dedicated volunteer pool, and if one of the verification fails, the corresponding volunteer is removed from the dedicated volunteer pool to obtain the dedicated volunteer pool which can be finally dispatched by the candidate merging task group. As a further scheme of the invention, the basic information of the micro-task comprises position coordinates, minimum time consumption of single execution and real-time reachable state of a service object, and the real-time state information of the volunteer comprises current geographic position, a declared idle time interval and a line time consumption record of the same type of task in a historical area. As a further aspect of the present invention, the specific operation of automatically aggregating into candidate merge task groups by spatial location correlation is as follows: The scheduling system reads the position coordinates of all the micro-tasks to be executed in the micro-task information set, takes each micro-task to be executed as an independent space node, and judges whether two nodes accord with each other in the direct space radiation range of the other side aiming at any two micro-task nodes, if so, the two micro-task nodes are judged to form a bidirectional adjacent node pair, otherwise, the two micro-task nodes are judged to be non-adjacent nodes; After the scheduling system carries out bidirectional adjacency judgment on all the micro-task nodes to be executed, a micro-task adjacency relation list is generated, and an initial adjacency node cluster set is screened out based on the micro-task adjacency relation list; For each node cluster in the initial adjacent node cluster set, the scheduling system acquires the p