Minimum Effort Pursuit Guidance with Multiple Delayed Engagement Decisions

What is it about?

In the case a number of pursuers engages a number of evaders and reassignment during flight is possible, a particular pursuer may engage one of the evaders depending on what happens during the engagement. Indeed preceding pursuers may destroy some of the evaders, or may fail to destroy some of the evaders and, due to specific priorities, or to other requirements, a trailing pursuer may need to engage a different evader than the one originally assigned. The guidance law proposed in this paper optimizes the average of the guidance effort over all possible engagement outcomes for a particular pursuers. In this sense, this guidance law is a one-on-many guidance law. and the success of the engagements is not guaranteed, it is not necessarily efficient to assign from the beginning each pursuer to a particular evader. If reassignment during flight is possible, a pursuer may end up engaging a different evader than possibly envisaged at the beginning of the flight. The guidance algorithm proposed in this paper is essentially using probabilistic information about what can possibly happen during flight in order to minimize the average guidance effort over all possible

Featured Image