14.02.2013 Views

Thesis - Leigh Moody.pdf - Bad Request - Cranfield University

Thesis - Leigh Moody.pdf - Bad Request - Cranfield University

Thesis - Leigh Moody.pdf - Bad Request - Cranfield University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 6 / Missile Guidance<br />

_ _<br />

generalised RTPN without resorting to linearisation, initial conditions for<br />

capturing manoeuvring targets, PN performance metrics and 2-player game<br />

theory are all introduced. TPN generalisation in which all PN parameters<br />

are adaptable has reached the stage that the capture region using finite<br />

accelerations is comparable with that of PPN, Duflos [D.2] (1999). This<br />

unification forms the basis many of the optimal LQR techniques used today,<br />

linking the capture region with practical constraints.<br />

6.5.1.3 2D Pure PN<br />

Closed form PPN solutions have proven more elusive. Guelman [G.5] (1971)<br />

provided a solution for a limited range of kinematic gain (λm) against<br />

constant turning targets. This work provides the capture requirements for<br />

firing solutions: Vm > √2 . Vt and λm . Vm > Vm + Vt, where (Vm) is the<br />

missile speed, and (Vt) the target speed - all targets being reachable if the<br />

missile is closing. These conditions can be relaxed to Vm > Vt for constant<br />

speed targets. The target LOS angular rate decreases with time-to-go (TTG)<br />

providing that (λm/2 – 1) . Vm > Vt, with (λm ≥ 4).<br />

These results were generalised by Becker [B.1] (1990) for constant velocity<br />

targets and gains > 2. Further extensions were provided by Guelman [G.6] for<br />

manoeuvring targets, and by Shukla [S.1] and Ha [H.2] in (1990) who introduced<br />

the Lyapunov function approach to deal with random target motion.<br />

Mahapatra [M.1] (1989) dealt with linearised PPN for a constant target<br />

acceleration and initial heading errors, and Ha [H.2] for randomly moving<br />

targets.<br />

The 90s was a period during which the sufficiency conditions for PPN target<br />

capture were expanded for targets with time varying accelerations, notable<br />

contributors being Ha [H.2] , Song [S.3] and Ghawghawe [G.7] (1990-96).<br />

6.5.1.4 3D Pure PN<br />

When a state observer provides sufficient data 3D PPN is the most efficient<br />

and practical of the PN guidance laws. No longitudinal speed control is<br />

required and the significant speed advantage required for TPN can be<br />

relaxed for PPN.<br />

Adler [A.2] was first to linearised the 3D equations of PPN assuming a<br />

constant velocity collision course. Later Guelman [G.8-9] (1972-4) showed<br />

that for (λM > 2) PPN requires only a √2 speed advantage over the target,<br />

with all but the rear LOS reachable.<br />

Ha [H.2] (1990) and Song [S.7] (1994) extended the 2D Lyapunov approach<br />

with non-linear system dynamics to show that targets with time varying<br />

acceleration normal to their velocity vector can always be intercepted under<br />

Guelman’s conditions. The increased capture region of PPN compared with<br />

TPN against targets with varying acceleration was explained by Oh [O.1]<br />

(1999). The Lyapunov function approach was criticised by Ghawghawe [G.7]<br />

6-11

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!