Cooperative Scheduling of Imaging Observation Tasks for High-Altitude Airships Based on Propagation Algorithm

الملخص EN

The cooperative scheduling problem on high-altitude airships for imaging observation tasks is discussed.

A constraint programming model is established by analyzing the main constraints, which takes the maximum task benefit and the minimum cruising distance as two optimization objectives.

The cooperative scheduling problem of high-altitude airships is converted into a main problem and a subproblem by adopting hierarchy architecture.

The solution to the main problem can construct the preliminary matching between tasks and observation resource in order to reduce the search space of the original problem.

Furthermore, the solution to the sub-problem can detect the key nodes that each airship needs to fly through in sequence, so as to get the cruising path.

Firstly, the task set is divided by using k-core neighborhood growth cluster algorithm (K-NGCA).

Then, a novel swarm intelligence algorithm named propagation algorithm (PA) is combined with the key node search algorithm (KNSA) to optimize the cruising path of each airship and determine the execution time interval of each task.

Meanwhile, this paper also provides the realization approach of the above algorithm and especially makes a detailed introduction on the encoding rules, search models, and propagation mechanism of the PA.

Finally, the application results and comparison analysis show the proposed models and algorithms are effective and feasible.