Algorithm Development for SDI Weapons System Allocation
Abstract
While several SDI weapons systems can provide adequate defense in a one-on-one basis, a coordinated attack by several enemy missiles launched over a substantial volume will be difficult to resist without an efficient command and control system for warfare coordination. Our study of weapons allocation - coordination algorithms, is based on dynamical models for the missile/decoy systems including noise effects and uncertainties in the model parameters. Performance of the weapons targeting system may be measured in terms of the expected number of targets eliminated in a given interval (phase of operations) or the expected time to eliminate all the targets in a given region. Scheduling weapons deployment is a problem of constrained optimal (weapons) and state variables. The selection of weapons deployment tactics is based on solution of a complex optimization problem. We have conducted an investigation of advanced modeling, stochastic control, and scheduling methodologies for aspects of the SDI weapons allocation problem - several platforms with assets of different character defending against a diverse collection of targets. The models for such scenarios lead to stochastic scheduling problems which can not be handled by conventional analytical methods. We describe several different analytical approaches which have the potential for synthesis of effective engagement algorithms. Keywords: Weapons allocation; Stochastic sequencing; Scheduling index rules.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1989
- Accession Number
- ADA212973
Entities
People
- Gilmer L. Blankenship
- William Bennett