On Optimal Allocation and Guidance Laws for Linear lnterception and Rendezvous Problems

This paper considers the problem of guiding N interceptors so that they intercept or rendezvous with N targets at the same time T. It is assumed that the interceptors and targets are described by linear time-varying differential equations (deterministic or stochastic). Under certain assumptions both the optimal (static or dynamic) interceptor-target allocation and the guidance of each interceptor for the optimal allocation can be obtained with modest real-time and storage computer requirements.