Optimal Terminal Defense Tactics When Several Sequential Engagements are Possible
暂无分享,去创建一个
In this paper we treat a situation in which a terminal defense wishes to minimize the expected fraction of a target destroyed. Attacking reentry vehicles RVs arrive simultaneously, and therefore the defense knows the attack size. Several sequential engagements of the RVs by defensive interceptors are possible, and the defense has the capability to shoot-look-shoot between these engagements. Using techniques of stochastic dominance and stochastic dynamic programming, we determine optimal defensive tactics as functions of the numbers of RVs, interceptors, and engagements remaining; the various single-shot kill probabilities are parameters. We examine extensions of the basic model that determine both the expected number of interceptors remaining after the attack and the minimum number of interceptors needed to provide a desired level of protection of the target.
[1] A. R. Eckler,et al. Mathematical Models Of Target Coverage And Missile Allocation , 1972 .
[2] Alan F. Karr,et al. Integer Prim-Read Solutions to a Class of Target Defense Problems , 1985, Oper. Res..
[3] Richard E. Barlow,et al. Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .
[4] Richard M. Soland,et al. Minimum-cost mixtures of area and point defenses assuming simultaneous attack , 1987 .