Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-26T01:07:27.565Z Has data issue: false hasContentIssue false

Optimal low-level pursuit and evasion

Published online by Cambridge University Press:  04 July 2016

E. Large*
Affiliation:
Marconi Space & Defence Systems Ltd, Stanmore, Middx

Extract

It is possible, and even probable, that the next generation of defensive missiles will use modern methods of optimal control of the interception trajectory. Miniaturised computing is becoming so readily available that it becomes feasible to compute the optimal trajectory to the interception point.

Consider a ground site, defended by a surface-to-air missile, which is being attacked by a low-level intruder aircraft. As soon as the intruder is attacked, by launching the defensive missile, the intruder attempts to avoid interception by using evasive tactics; the intruder becomes the evader and the defensive missile the pursuer. When both the pursuer and evader use optimal tactics, the one to achieve interception and the other to avoid it, the result becomes the outcome of a game of pursuit and evasion, as described by Isaacs in Reference 1.

Type
Research Article
Copyright
Copyright © Royal Aeronautical Society 1981 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Isaacs, Rufus, Differential Games. Robert K. Kreiger Publishing Co. New York, 1975.Google Scholar
2. Hibbs, Albert R. Optimum Burning Program for Horizontal Right. ARS Journal, 22, No 4, 1952.Google Scholar
3. Large, Edward. Optimum Flight Paths for a Winged Supersonic Rocket Vehicle. The Aeronautical Journal, Royal Aeronautical Society, December 1978.Google Scholar