Applying nonlinear programming to a complex pursuit-evasion problem

In this paper a computational decomposition approach is applied to a complex pursuit-evasion game modeling the optimal escape of optimally guided missile. In the method the saddle point problem is decomposed into two subproblems that are solved by turns iteratively. The subproblems are optimal control problems that can be solved efficiently using discretization and nonlinear programming techniques. As a preliminary example we give the solution trajectories for the game corresponding to one set of initial conditions