Computer techniques taken from the fields of artificial intelligence and adaptive programming have been successfully used to solve practical problems in the area of ballistic missile defense. The techniques were applied to the important case of allocating interceptor missiles to an attack by enemy reentry missiles against ICBM silos. Simulation results showed that a silo installation could be acceptably defended by only about 60 percent of the number of interceptors required under the 'taper-linear defense' strategy. The approach centers on the method of heuristic search, which is a technique that allows analysis and evaluation of consequences arising from possible future situations. These situations are simulated by testing known actions and decisions against the present state of affairs. Then, by comparing the results, a best action can be chosen. Repetitive application of this technique yields an action sequence that determines a resource allocation. The heuristic search procedure as applied to the problem of interceptor allocation is described and it is shown, through a detailed example, how strategies are configured in real time.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Adaptive decisions in ballistic missile defense


    Additional title:

    Adaptive Entscheidungen bei der Abwehr ferngelenkter Geschosse


    Contributors:
    Leal, A. (author)

    Published in:

    Publication date :

    1977


    Size :

    5 Seiten, 5 Quellen


    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Ballistic Missile Defense

    H. W. Moulton | NTIS | 1995


    Ballistic Missile Defense

    N. J. Lucas / K. M. Sayler | NTIS | 2022



    Ballistic Missile Defense

    I. Doerfer | NTIS | 2002


    Whither ballistic missile defense?

    Grey, J. | British Library Online Contents | 1994