Dynamic task allocation in multiple agent groups based on RHP-IVFSA

The aim of this study is to provide a solution based on rolling horizon to dynamical optimization of aerial multiple grouping task allocation.According to the time window attribute of partial tasks and resource capability wastage character of groups,the mathematical model with the value of task executed efficiency maximization objective is built,which satisfy with former constraints.The strategy elements are given,including the prediction time window,rolling time window and driven mechanism.An improved very fast simulated annealing algorithm is developed to solve the sub-optimized problem.Solution coding,neighborhoods creating and conflict solving methods are proposed,then the random greedy search measure at high temperature,re-annealing mechanism,tabu policy and elitist reserved policy are applied,so that the IVFSA can improve computing efficiency and avoid local optimum solutions.At last,the superiority and applicability of this approach are illuminated by the simulation of assumption,which ensure the stability of task executed efficiency at high level.