Research Article
Cooperative Scheduling of Imaging Observation Tasks for High-Altitude Airships Based on Propagation Algorithm
Algorithm 1
Pseudocodes of K-NGCA algorithm.
01: Initialize by Greedy algorithm; | 02: Calculate by (4) and | by (6); | 03: while do | 04: + 1; | 05: Let each cluster in set ; | 06: Given a vector with each | element *Record the element quantity of each cluster*/ | 07: Sort each in by , and | construction a set to record the new task sequence; | 08: for each in sequence do | 09: Calculate by (5); | 10: ; 0; ; | 11: while do | 12: Let ; /*Find the nearest cluster */ | 13: + 1; | 14: if then | 15: ; ; | 16: if then | 17: Add to ; | 18: ; | 19: break; | 20: end if | 21: end if | 22: ; /* is a tremendous number*/ | 23: end while | 24: if > then | 25: if == then | 26: ; ; | 27: Add to ; | 28: else | 29: Reject due to all HAA are invalid; | 30: end if | 31: end if | 32: end for | 33: Update by (4); | 34: end while |
|