A mathematical model of hardware and system testing
Hardware and system testing mathematical model assuming stochastic design and manufacturing defects detection and nondetection probability equations analogous to reliability function
Lind, M. M.↗
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.
Control theory. Volume 1 - Elements of modern control theory
Control theory, Volume 1, covering linear, nonlinear, stochastic, optimal, adaptive and learning systems, sensitivity analysis, etc
Greensite, A. L.↗
Filtering for linear distributed parameter systems
Nonlinear filtering for linear parabolic distributed parameter systems with white noise, considering stochastic boundary value problem
Kushner, H. J.↗
Minimum-energy control of a class of electrically driven vehicles.
A minimum-energy controller is designed and built for a class of electrically driven vehicles according to the theoretical concepts determined by the application of modern control theory. Theoretical results are obtained by making several justifiable assumptions in the dynamical equations of the system and solving the resulting stochastic optimal control problem by Bellman's dynamic programming technique. Several practical and economical considerations are taken into account for the mechanization of the minimum-energy control law.
Sahinkaya, Y. E.↗
Optimal maneuvering and fine pointing control of large space telescope with a new magnetically suspended, single gimballed momentum storage device
This paper considers the application of an Annular Momentum Control Device (AMCD) to both fine pointing and large-angle maneuvering of a large space telescope (LST). The AMCD, which consists principally of a spinning rim suspended in noncontacting electromagnetic bearings, represents a new development in momentum storage devices. A nonlinear mathematical model of the AMCD/LST system is derived. An optimal stochastic fine-pointing controller is designed via LQG theory and the minimum-energy maneuvering problem is solved via a gradient technique. Number of state variable and control variable constraints, as well as all trigonometric nonlinearities, are considered in the latter part.
Nadkarni, A. A.↗
Nonlinear dynamics; Proceedings of the International Conference, New York, NY, December 17-21, 1979
Papers were presented on turbulence, ergodic and integrable behavior, chaotic maps and flows, chemical and fully developed turbulence, and strange attractors. Specific attention was given to measures describing a turbulent flow, stochastization and collapse of vortex systems, a subharmonic route to turbulent convection, and weakly nonlinear turbulence in a rotating convection layer. The Korteweg-de Vries and Hill equations, plasma transport in three dimensions, a horseshoe in the dynamics of a forced beam, and the explosion of strange attractors exhibited by Duffing's equation were also considered.
Helleman, R. H. G.↗
Dynamic remapping decisions in multi-phase parallel computations
The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.
Nicol, D. M.↗
Using Colored Stochastic Petri Net (CS-PN) software for protocol specification, validation, and evaluation
The specification, verification, validation, and evaluation, which make up the different steps of the CS-PN software are outlined. The colored stochastic Petri net software is applied to a Wound/Wait protocol decomposable into two principal modules: request or couple (transaction, granule) treatment module and wound treatment module. Each module is specified, verified, validated, and then evaluated separately, to deduce a verification, validation and evaluation of the complete protocol. The colored stochastic Petri nets tool is shown to be a natural extension of the stochastic tool, adapted to distributed systems and protocols, because the color conveniently takes into account the numerous sites, transactions, granules and messages.
Zenie, Alexandre↗
Investigation of Air Transportation Technology at Princeton University, 1989-1990
The Air Transportation Technology Program at Princeton University proceeded along six avenues during the past year: microburst hazards to aircraft; machine-intelligent, fault tolerant flight control; computer aided heuristics for piloted flight; stochastic robustness for flight control systems; neural networks for flight control; and computer aided control system design. These topics are briefly discussed, and an annotated bibliography of publications that appeared between January 1989 and June 1990 is given.
Stengel, Robert F.↗
Investigation of air transportation technology at Princeton University, 1990-1991
The Air Transportation Technology Program at Princeton University is a program that emphasizes graduate and undergraduate student research. The program proceeded along six avenues during the past year: microburst hazards to aircraft, intelligent failure tolerant control, computer-aided heuristics for piloted flight, stochastic robustness of flight control systems, neural networks for flight control, and computer-aided control system design.
Stengel, Robert F.↗
Adaptive, Distributed Control of Constrained Multi-Agent Systems
Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.
Bieniawski, Stefan↗
Fleet Assignment Using Collective Intelligence
Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).
Antoine, Nicolas E.↗
Quantum Analog Computing
Quantum analog computing is based upon similarity between mathematical formalism of quantum mechanics and phenomena to be computed. It exploits a dynamical convergence of several competing phenomena to an attractor which can represent an externum of a function, an image, a solution to a system of ODE, or a stochastic process.
Quantum analog computing quantum mechanics attract↗
Chance-Constrained Guidance With Non-Convex Constraints
Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.
FROM↗
Generic Kalman Filter Software
The Generic Kalman Filter (GKF) software provides a standard basis for the development of application-specific Kalman-filter programs. Historically, Kalman filters have been implemented by customized programs that must be written, coded, and debugged anew for each unique application, then tested and tuned with simulated or actual measurement data. Total development times for typical Kalman-filter application programs have ranged from months to weeks. The GKF software can simplify the development process and reduce the development time by eliminating the need to re-create the fundamental implementation of the Kalman filter for each new application. The GKF software is written in the ANSI C programming language. It contains a generic Kalman-filter-development directory that, in turn, contains a code for a generic Kalman filter function; more specifically, it contains a generically designed and generically coded implementation of linear, linearized, and extended Kalman filtering algorithms, including algorithms for state- and covariance-update and -propagation functions. The mathematical theory that underlies the algorithms is well known and has been reported extensively in the open technical literature. Also contained in the directory are a header file that defines generic Kalman-filter data structures and prototype functions and template versions of application-specific subfunction and calling navigation/estimation routine code and headers. Once the user has provided a calling routine and the required application-specific subfunctions, the application-specific Kalman-filter software can be compiled and executed immediately. During execution, the generic Kalman-filter function is called from a higher-level navigation or estimation routine that preprocesses measurement data and post-processes output data. The generic Kalman-filter function uses the aforementioned data structures and five implementation- specific subfunctions, which have been developed by the user on the basis of the aforementioned templates. The GKF software can be used to develop many different types of unfactorized Kalman filters. A developer can choose to implement either a linearized or an extended Kalman filter algorithm, without having to modify the GKF software. Control dynamics can be taken into account or neglected in the filter-dynamics model. Filter programs developed by use of the GKF software can be made to propagate equations of motion for linear or nonlinear dynamical systems that are deterministic or stochastic. In addition, filter programs can be made to operate in user-selectable "covariance analysis" and "propagation-only" modes that are useful in design and development stages.
Lisano, Michael E., II↗
Integrated system identification and modal state estimation for control of flexible space structures
A novel approach of integrated system identification and modal state estimation is proposed for control of linear dynamical systems including flexible space structures. There are four steps involved in this approach. First, the relation between a stochastic state space model of a dynamical system and the coefficients of its autoregressive model with exogenous input is derived. Second, an adaptive least-squares transversal predictor is used to estimate the coefficients of the model. Third, a state space model and a steady state Kalman filter gain of the dynamical system are then identified from the coefficients of the model by using the eigensystem realization algorithm. Fourth, a modal state estimator is constructed using the modal parameters of the identified model. On-line implementation of this algorithm can continually improve the modal parameters and the filter gain. It can also gradually update the system model when the system characteristics are slowly changing. A numerical example is used to illustrate the feasibility of the new approach.
Chen, Chung-Wen↗
Stochastic Modeling of Length of Day
We propose a general stochastic model for the UT1-LOD system and derive the corresponding Kalman filter model.
stochastic model autoregressive moving average tra↗
Bidirectional Classical Stochastic Processes with Measurements and Feedback
A measurement on a quantum system is said to cause the "collapse" of the quantum state vector or density matrix. An analogous collapse occurs with measurements on a classical stochastic process. This paper addresses the question of describing the response of a classical stochastic process when there is feedback from the output of a measurement to the input, and is intended to give a model for quantum-mechanical processes that occur along a space-like reaction coordinate. The classical system can be thought of in physical terms as two counterflowing probability streams, which stochastically exchange probability currents in a way that the net probability current, and hence the overall probability, suitably interpreted, is conserved. The proposed formalism extends the . mathematics of those stochastic processes describable with linear, single-step, unidirectional transition probabilities, known as Markov chains and stochastic matrices. It is shown that a certain rearrangement and combination of the input and output of two stochastic matrices of the same order yields another matrix of the same type. Each measurement causes the partial collapse of the probability current distribution in the midst of such a process, giving rise to calculable, but non-Markov, values for the ensuing modification of the system's output probability distribution. The paper concludes with an analysis of a classical probabilistic version of the so-called grandfather paradox.
Hahne, G. E.↗