Virtual Target Selection for a Multiple-Pursuer–Multiple-Evader Scenario

What is it about?

Identifying the location of virtual targets by which vehicles must first navigate to before reaching their intended target has been a relevant problem in weapon target assignment. This approach shows a means of selecting the location of virtual targets so as to minimize the pursuing teams overall energy. The approach taken leverages Apollonius circles and mixed integer linear programming to identify candidate virtual target locations that minimize overall interception energy.

Featured Image