Accommodating Obstacle Avoidance in the Weapons Allocation Problem for Tactical Air Defence

Abstract

In the defence domain, weapons allocation is defined to be the reactive assignment of weapon systems to engage or counter identified threats. From a command perspective, this refers to the allocation of friendly and coalition force elements (e.g. fighter aircraft, frigates etc.) to engage or interdict adversaries which are posing threats, not only to themselves, but also to defended areas and high-value assets. In an earlier work, a conceptual rule-based approach to weapons allocation in the air domain was outlined in terms of so-called critical and sorting parameters, which may be used to determine the capability of each friendly airborne interceptor to engage or counter each threat, and to rank the candidate interceptor-threat pairings respectively. An issue of relevance to the evaluation of the (interdependent) parameters of fuel sufficiency, egress safety and time-to-intercept is how to determine the shortest path from a given interceptor to a static or dynamic threat which avoids prohibited areas such as missile engagement zones, neutral and enemy territories and other exclusion zones. However, in general finding the shortest path is a non-trivial exercise and so determining sub optimal paths through the prohibited areas is often necessary. In the current paper, the problem is investigated from both perspectives. In particular, a technique developed for, and applied to, the field of robotics for finding the shortest path from a source to a fixed destination through a flat earth environment littered with obstacles is adapted to solve the shortest path problem for a spherical earth geometry. This is then used as the basis for determining efficient paths from an interceptor to engage or counter a moving threat