Studies of thrust vector control of large space vehicles Final report
Display systems, fluid amplification techniques, stochastic processes, and thrust vector control systems
Boland, J. S., III↗
SEARCH · Engineering Papers
Results for “Stochastic systems”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Developing interpretable models with optimized set reduction for identifying high risk software components
Applying equal testing and verification effort to all parts of a software system is not very efficient, especially when resources are limited and scheduling is tight. Therefore, one needs to be able to differentiate low/high fault frequency components so that testing/verification effort can be concentrated where needed. Such a strategy is expected to detect more faults and thus improve the resulting reliability of the overall system. This paper presents the Optimized Set Reduction approach for constructing such models, intended to fulfill specific software engineering needs. Our approach to classification is to measure the software system and build multivariate stochastic models for predicting high risk system components. We present experimental results obtained by classifying Ada components into two classes: is or is not likely to generate faults during system and acceptance test. Also, we evaluate the accuracy of the model and the insights it provides into the error making process.
Briand, Lionel C.↗
Stochastic Verification by Analysis for Autonomous Systems Management Architecture (ASMA)
The Gateway Vehicle Systems Manager (VSM) is the top-level of a distributed, hierarchical software control system. VSM is data-driven and will make decisions related to mission, fault, resource management and vehicle control. These attributes combined with a high degree of autonomy make it susceptible to emergent behavior. In order to achieve the high level of confidence needed in this critical system, the VSM team has developed a multifaceted verification strategy employing traditional verification techniques, simulation, model checking, and runtime verification. Individual algorithms are verified using conventional testing and model checking using assume-guarantee contracts. A discrete event-based simulation approach is being developed to verify timelines. This presentation describes an enhancement to the verification approach using analysis to enhance system robustness by detecting and resolving the potential for emergent behavior. The verification by analysis employs a Software in the Loop (SITL) environment with real flight software executing on emulated processors, simulations of vehicle subsystems, flight dynamics, and human inputs. Since the possible input space and configuration data set are too large for exhaustive testing, a Monte Carlo approach is used to cover feasible scenarios, augmented with corner cases and known higher-risk scenarios. A key problem in using Monte Carlo-based system verification is evaluating test results to ensure that system behavior is correct. The presentation describes the approach the VSM team uses to monitor behavior for compliance with predetermined boundaries and to identify anomalous behavior for further analysis. This presentation describes the multi-level systems approach to verification, and the simulation-based layer that covers the feasible state space: 1. Overview of the Gateway VSM 2. Special challenges due to heterogeneous, hierarchical architecture 3. Modeling and simulation environment using flight software and system simulations 4. Developing input sets to ensure state-space coverage 5. Developing model and data configuration sets to ensure model coverage 6. Interpreting results without predetermined outcomes 7. Lessons learned and future work
Verification and Validation↗
Optimal stationary control of linear systems with control-dependent noise
Optimal stochastic control investigated for linear systems with driving noise intensity proportional to control input
Kleinman, D. L.↗
A stochastic regulator for integrated communication and control systems. I - Formulation of control law. II - Numerical analysis and simulation
A state feedback control law for integrated communication and control systems (ICCS) is formulated by using the dynamic programming and optimality principle on a finite-time horizon. The control law is derived on the basis of a stochastic model of the plant which is augmented in state space to allow for the effects of randomly varying delays in the feedback loop. A numerical procedure for synthesizing the control parameters is then presented, and the performance of the control law is evaluated by simulating the flight dynamics model of an advanced aircraft. Finally, recommendations for future work are made.
Liou, Luen-Woei↗
Supportability Concepts for Crewed Deep Space Exploration
Supportability—defined as the set of system characteristics that influence the logistics and support required to enable safe and effective operations—will be a much larger driver of mass, risk, and crew time for future human space exploration due to the more challenging mission context. For Mars, systems must operate in a logistically isolated environment for much longer durations than previous missions, which results in a higher probability of system failure and therefore an increased need for maintenance or contingency options. Mars missions also lack access to quick aborts, which increases the consequences of an unrecoverable system failure. Together, this higher likelihood and consequence of failure results in an increase in supportability-related risk. Supportability analysis is an important part of systems development that helps designers better understand the impacts of system and mission decisions on risk, mass, and crew time. The real-world processes that drive maintenance requirements and other supportability-related characteristics are probabilistic, and therefore they require different conceptual approaches and models than are used for more deterministic aspects of space systems. This paper provides an overview of supportability analysis, addresses key concepts, and provides examples of how supportability analysis can be incorporated into system development. Specifically, system supportability involves stochastic processes, and therefore must be evaluated using probabilistic models. These models can be used to perform sensitivity analysis even if system characteristics are not yet fully defined. Failure rates cannot be measured directly, but tests provide valuable data that can help refine those estimates. Human spaceflight architectures are complex, and exhibit coupled behavior that should be examined with integrated systems analysis that includes an assessment of supportability.
Supportability↗
Supportability Concepts for Crewed Deep Space Exploration
Supportability—defined as the set of system characteristics that influence the logistics and support required to enable safe and effective operations—will be a much larger driver of mass, risk, and crew time for future human space exploration due to the more challenging mission context. For Mars, systems must operate in a logistically isolated environment for much longer durations than previous missions, which results in a higher probability of system failure and therefore an increased need for maintenance or contingency options. Mars missions also lack access to quick aborts, which increases the consequences of an unrecoverable system failure. Together, this higher likelihood and consequence of failure results in an increase in supportability-related risk. Supportability analysis is an important part of systems development that helps designers better understand the impacts of system and mission decisions on risk, mass, and crew time. The real-world processes that drive maintenance requirements and other supportability-related characteristics are probabilistic, and therefore they require different conceptual approaches and models than are used for more deterministic aspects of space systems. This paper provides an overview of supportability analysis, addresses key concepts, and provides examples of how supportability analysis can be incorporated into system development. Specifically, system supportability involves stochastic processes, and therefore must be evaluated using probabilistic models. These models can be used to perform sensitivity analysis even if system characteristics are not yet fully defined. Failure rates cannot be measured directly, but tests provide valuable data that can help refine those estimates. Human spaceflight architectures are complex, and exhibit coupled behavior that should be examined with integrated systems analysis that includes an assessment of supportability.
Supportability↗
Adaptive Stress Testing of Airborne Collision Avoidance Systems
This paper presents a scalable method to efficiently search for the most likely state trajectory leading to an event given only a simulator of a system. Our approach uses a reinforcement learning formulation and solves it using Monte Carlo Tree Search (MCTS). The approach places very few requirements on the underlying system, requiring only that the simulator provide some basic controls, the ability to evaluate certain conditions, and a mechanism to control the stochasticity in the system. Access to the system state is not required, allowing the method to support systems with hidden state. The method is applied to stress test a prototype aircraft collision avoidance system to identify trajectories that are likely to lead to near mid-air collisions. We present results for both single and multi-threat encounters and discuss their relevance. Compared with direct Monte Carlo search, this MCTS method performs significantly better both in finding events and in maximizing their likelihood.
Verification and Validation↗
Identification of dynamic systems, theory and formulation
The problem of estimating parameters of dynamic systems is addressed in order to present the theoretical basis of system identification and parameter estimation in a manner that is complete and rigorous, yet understandable with minimal prerequisites. Maximum likelihood and related estimators are highlighted. The approach used requires familiarity with calculus, linear algebra, and probability, but does not require knowledge of stochastic processes or functional analysis. The treatment emphasizes unification of the various areas in estimation in dynamic systems is treated as a direct outgrowth of the static system theory. Topics covered include basic concepts and definitions; numerical optimization methods; probability; statistical estimators; estimation in static systems; stochastic processes; state estimation in dynamic systems; output error, filter error, and equation error methods of parameter estimation in dynamic systems, and the accuracy of the estimates.
Maine, R. E.↗
Stochastic time-optimal control problems
Two types of stochastic time-optimal controls in a one-dimensional setting are considered. Multidimensional problems, in the case of complete state information available and the system modeled by stochastic differential equations, are studied under the formulation of minimizing the expected transient-response time. The necessary condition of optimality is the satisfaction for the value function of a parabolic partial differential equation with boundary conditions. The sufficient condition of optimality is also provided, based on Dynkin's formula. Finally, three examples are given.
Zhang, W.↗
Algorithms for Performance, Dependability, and Performability Evaluation using Stochastic Activity Networks
Modeling tools and technologies are important for aerospace development. At the University of Illinois, we have worked on advancing the state of the art in modeling by Markov reward models in two important areas: reducing the memory necessary to numerically solve systems represented as stochastic activity networks and other stochastic Petri net extensions while still obtaining solutions in a reasonable amount of time, and finding numerically stable and memory-efficient methods to solve for the reward accumulated during a finite mission time. A long standing problem when modeling with high level formalisms such as stochastic activity networks is the so-called state space explosion, where the number of states increases exponentially with size of the high level model. Thus, the corresponding Markov model becomes prohibitively large and solution is constrained by the the size of primary memory. To reduce the memory necessary to numerically solve complex systems, we propose new methods that can tolerate such large state spaces that do not require any special structure in the model (as many other techniques do). First, we develop methods that generate row and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix, permitting us to cache portions of the matrix and hence reduce the solution time. Finally, we develop a new memory and computationally efficient technique for Gauss-Seidel based solvers that avoids the need for generating rows of A in order to solve Ax = b. This is a significant performance improvement for on-the-fly methods as well as other recent solution techniques based on Kronecker operators. Taken together, these new results show that one can solve very large models without any special structure.
Deavours, Daniel D.↗
An Adaptive Technique for a Redundant-Sensor Navigation System
An on-line adaptive technique is developed to provide a self-contained redundant-sensor navigation system with a capability to utilize its full potentiality in reliability and performance. The gyro navigation system is modeled as a Gauss-Markov process, with degradation modes defined as changes in characteristics specified by parameters associated with the model. The adaptive system is formulated as a multistage stochastic process: (1) a detection system, (2) an identification system and (3) a compensation system. It is shown that the sufficient statistics for the partially observable process in the detection and identification system is the posterior measure of the state of degradation, conditioned on the measurement history.
Chien, T. T.↗
Evaluation of a Regional Crop Model Implementation for Sub-National Yield Assessments in Kenya
CONTEXT: Cropping system models can be used to both assess regional food security and to monitor and predict agricultural drought. Agriculture in Kenya is extremely important to both the economy and food security of the country. OBJECTIVE: This study evaluated a regional implementation of a widely used crop model, the Decision Support System for Agrotechnology Transfer (DSSAT), within a coupled modeling framework, the Regional Hydrologic Extremes Assessment System (RHEAS), over Kenya. The goal of this study was to assess the ability of RHEAS to simulate the annual variability of maize yields at the county level and evaluate the uncertainty inherent in the model and inputs. METHODS: The RHEAS system implements a stochastic ensemble approach to account for field scale variabilities in crop management practices and underlying soil and weather conditions. Satellite-derived datasets were used to evaluate the land surface component of the system and seasonally disaggregated yield for 5 years was used to assess the performance of the cropping system model. RESULTS AND CONCLUSIONS: The median correlation between RHEAS and satellite-derived soil moisture and evapotranspiration estimates were 0.78, and 0.51, respectively, indicating that the model is able to capture the key drivers of the hydrological budget. Overall, RHEAS simulated yearly yield variations with a median correlation of 0.7 with reported yields, with the best performance in the short rains season. However, across both seasons, the RHEAS model was positively biased on the order of ~1.6 MT/ha. The overall median unbiased RMSE was 0.66 MT/ha. The RHEAS system shows skill at simulating extreme departures in anomalies, and a majority of the time (62.5%) the reported yields fall within the interquartile range of the simulations. SIGNIFICANCE: One of the most important areas of improvement for the next generation of agricultural data and models is to better understand and communicate the inherent uncertainties. This is especially critical in data-limited regions. Here we present a modeling system and its implementation that begins to address these concerns. We demonstrate the ability to simulate broad trends in yields at the county level for sub-annual yields with skills that commensurate previous national/annual level studies.
Crop model↗
A high speed implementation of the random decrement algorithm
The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.
Kiraly, L. J.↗
A high-speed implementation of the random decrement algorithm
The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.
Kiraly, L. J.↗
Stochastic dynamics of baroclinic waves
The maintenance of variance and attendant heat flux in linear, forced dissipative baroclinic shear flows subject to stochastic excitation is examined. The baroclinic problem, is intrinsically nonnormal and its stochastic dynamics is found to differ significantly from the more familiar stochastic dynamics of normal systems. When the shear is sufficiently great in comparison to dissipative effects, stochastic excitation supports highly enhanced variance levels in these nonnormal systems compared to variance levels supproted by the same forcing and dissipation in related normal systems. The eddy variance and associated heat flux are found to arise in response to transient amplification of a subset of forcing functions that obtain energy from the mean flow and project this energy on a distinct subset of response functions (EOFs) that are in turn distinct from the set of normal modes of the system. A method for obtaining the dominant forcing and response functions as well as the distribution of heat flux for a given flow is described.
Farrell, Brian F.↗
Parallel discrete-event simulation of FCFS stochastic queueing networks
Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.
Nicol, David M.↗
Performability evaluation of the SIFT computer
The paper deals with the models, techniques, and evaluation methods that were successfully used to test the performance of the SIFT degradable computing system. The performance of the computer plus its air transport mission environment is modeled as a random variable, taking values in a set of 'accomplishment level'. The levels are defined in terms of four attributes of total system (computer plus environment) behavior, namely safety, no change in mission profile, no operational penalties, and no economic penalties. The base model of the total system is a stochastic process, whose states describe the internal structure of SIFT and the relevant conditions of its computational environment. Base model state trajectories are related to accomplishment levels via a special function, and solution methods are then used to determine the performability of the total system for various parameters of the computer and environment.
Meyer, J. F.↗