During the course of this research, a cooperative interception scenario between multiple maneuvering targets, missiles defending said targets (’defenders’), and missiles attacking said targets (’missiles’) was investigated.
The talk will begin with the introduction of several computationally efficient Weapon-Target-Allocation (WTA) algorithms, developed under the assumption that the target of each missile is known, as well as the guidance law used by each missile and defender, and that the number of defenders is equal to that of the missiles. The algorithms calculate offline the coefficients contributing to the miss distance, using the adjoint representation, and use those calculations online.
A method of tackling a scenario, where the target is free to decide at which time to launch the defenders, will be presented as well. Once WTA is performed, the multi-agent scenario is decomposed into several ones where in each a specified group of missiles is chasing a specific target, protected by the assigned defenders.
The development of a cooperative target evasion guidance law for said sub-scenario will be presented as well.
A presentation of the simulative evaluation of the cooperative guidance law performance, coupled with the WTA algorithms, using the notion of Pareto front, will conclude the talk.
