Multi-Sensor Automatic Planning Technology Based on Greedy Algorithm Combined with Flight Segment Migration

Heterogeneous sensor scheduling of unmanned aerial platforms is a problem that needs to consider both the detection target and the significance. So there will be situations where multiple targets compete for sensor resources. At present, the research on the scheduling of heterogeneous sensors for unmanned aerial platforms is not in-depth especially on the problem of resource contention. Therefore, this paper proposes a greedy algorithm combined with flight segment transfer (GAFST) to slove the heterogeneous sensor scheduling problem. First, a sensor preprocessing mechanism is designed to identify scarce individuals among multiple sensors. Second, a greedy algorithm combined with flight segment transfer is applied to the pairing of sensors and targets. Then, to solve the resource conflict problem, a new task migration mechanism is designed. Finally, the effectiveness of GA-FST in sensor scheduling is verified by comparing with other algorithms.