OPERATIONAL METHODS FOR SPACE VEHICLE COUNTDOWN PLANNING,
Abstract
The purpose of a countdown is explored and a measure of countdown effectiveness is defined and rationalized. The countdown planning problem is formally structured through the use of a game-oriented formulation that shows the impact of operational factors upon the countdown. It is seen that several assumptions are required in order to reduce the planning problem to one that is computationally tractable. These assumptions are described in and a Markovian prediction model is developed. This model yields predictions of countdown success probability for a given countdown sequence. The problems of obtaining a feasible countdown sequence and then an acceptable sequence are considered in Sec. V, which develops several computational techniques for these planning tasks. The planning problems introduced by uncertainty concerning the actual state of nature, i.e., the actual levels of the numerous probabilities and parameters are considered, and algorithms for coping with this uncertainty are developed. Then, the countdown length problems are addressed and expressions derived for the moments of an interrupted countdown. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 22, 1963
- Accession Number
- AD0426462
Entities
People
- Gerald J. Lieberman
- Sidney I. Firstman
Organizations
- Stanford University