An Anytime Algorithm Applied to Dynamic Weapon-Target Allocation problem with Decreasing Weapons and Targets

摘要

In this paper, an anytime algorithm based on the modified genetic algorithm (GA) is presented to solve the dynamic weapon-target allocation (DWTA) problem. With this algorithm, the targets are assigned with weapons one-by-one according to when each target flies away from the launching zone of the weapons, which is also a deadline for completion of pairing weapon for the target. In this paper, the modified GA is applied to the case that the targets are reduced by continuous interception until all of them are neutralized, and along with it in the process, the number of weapons put in use is decreasing. This is a marginal case for an integrated DWTA problem, and the investigation on it provides a basis for solving more complex DWTA problem.