Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic dynamics”

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.

At least 145 records · Page 8

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↗

CLEANing the Reward: Counterfactual Actions to Remove Exploratory Action Noise in Multiagent Learning

Learning in multiagent systems can be slow because agents must learn both how to behave in a complex environment and how to account for the actions of other agents. The inability of an agent to distinguish between the true environmental dynamics and those caused by the stochastic exploratory actions of other agents creates noise in each agent's reward signal. This learning noise can have unforeseen and often undesirable effects on the resultant system performance. We define such noise as exploratory action noise, demonstrate the critical impact it can have on the learning process in multiagent settings, and introduce a reward structure to effectively remove such noise from each agent's reward signal. In particular, we introduce Coordinated Learning without Exploratory Action Noise (CLEAN) rewards and empirically demonstrate their benefits

Reinforcement Learning↗

Quantum Decision Maker Theory and Simulation

A quantum device simulating the human decision making process is introduced. It consists of quantum recurrent nets generating stochastic processes which represent the motor dynamics, and of classical neural nets describing the evolution of probabilities of these processes which represent the mental dynamics.

Quantum↗

Quantum Decision-Maker

A quantum device simulating human decision making process is introduced. It consists of quantum recurrent nets generating stochastic processes which represent the motor dynamics, and a classical neural nets describing evolution of probabilities of these processes which represent the mental dynamics.

quantum↗

Effect of Dust Coagulation Dynamics on the Geometry of Aggregates

Master equation gives a more fundamental description of stochastic coagulation processes rather than popular Smoluchowski's equation. In order to examine the effect of the dynamics on the geometry of resulting aggregates, we study Master equation with a rigorous Monte Carlo algorithm. It is found that Cluster-Cluster aggregation model is a good approximation of orderly growth and the aggregates have fluffy structures with a fractal dimension approx. 2. A scaling analysis of Smoluchowski's equation also supports this conclusion.

Nakamura, R.↗

Understanding Structure in Line-Driven Stellar Winds Using Ultraviolet Spectropolarimetry in the Time Domain

The most massive stars are thought to lose a significant fraction of their mass in a steady wind during the main-sequence and blue supergiant phases. This in turn sets the stage for their further evolution and eventual supernova, and preconditions the surrounding medium for all following events, with consequences for ISM energization, chemical enrichment, and dust formation. Understanding these processes requires accurate observational constraints on the mass-loss rates of the most luminous stars, which can also be used to test theories of stellar wind driving. In the past, mass-loss rates have been characterized via collisional emission processes such as optical Hα and free-free radio emission, but these so-called “density squared” diagnostics require correction in the presence of widespread clumping. Recent observational and theoretical evidence points to the likelihood of a ubiquitously high level of such clumping in hot-star winds, but quantifying its effects requires a deeper understanding of the complex dynamics of radiatively driven winds and their stochastic instabilities. Furthermore, large-scale structures initiating in surface anisotropies and propagating throughout the wind can also affect wind driving and alter mass-loss diagnostics. Time series spectroscopy of high resonance-line opacity in the UV, capable of high resolution and high signal-to-noise, are required to better understand these complex dynamics, and more accurately determine mass-loss rates. The proposed Polstar mission (Scowen et al. 2022, this volume) provides the necessary resolution at the Sobolev (∼10 km s −1 ) or sound-speed (∼20 km s −1 ) scale, for over three dozen bright galactic massive stars with signal-to noise an order of magnitude above that of the celebrated MEGA campaign (Massa et al. 1995) of the International Ultraviolet Explorer (IUE), via continuous observations that track propagating structures through the winds in real time. Supporting geometric constraints are provided by the polarimetric capabilities present in all the datasets of such a mission.

Polstar – NASA MIDEX↗

On the stochastic dissemination of faults in an admissible network

The dynamic distribution of faults in a general type network is discussed. The starting point is a uniquely branched network in which each pair of nodes is connected by a single branch. Mathematical expressions for the uniquely branched network transition matrix are derived to show that sufficient stationarity exists to ensure the validity of the use of the Markov Chain model to analyze networks. In addition the conditions for the use of Semi-Markov models are discussed. General mathematical expressions are derived in an examination of branch redundancy techniques commonly used to increase reliability.

Kyrala, A.↗

A unified theory of electrodynamic coupling in coronal magnetic loops - The coronal heating problem

The coronal heating problem is studied, and it is demonstrated that Ionson's (1982) LRC approach results in a unified theory of coronal heating which unveils a variety of new heating mechanisms and which links together previously proposed mechanisms. Ionson's LRC equation is rederived, focusing on various aspects that were not clarified in the original article and incorporating new processes that were neglected. A parameterized heating rate is obtained. It is shown that Alfvenic surface wave heating, stochastic magnetic pumping, resonant electrodynamic heating, and dynamical dissipation emerge as special cases of a much more general formalism. This generalized theory is applied to solar coronal loops and it is found that active region and large scale loops are underdamped systems. Young active region loops and (possibly) bright points are found to be overdamped systems.

Ionson, J. A.↗

A statistical rain attenuation prediction model with application to the advanced communication technology satellite project. Part 2: Theoretical development of a dynamic model and application to rain fade durations and tolerable control delays for fade countermeasures

A dynamic rain attenuation prediction model is developed for use in obtaining the temporal characteristics, on time scales of minutes or hours, of satellite communication link availability. Analagous to the associated static rain attenuation model, which yields yearly attenuation predictions, this dynamic model is applicable at any location in the world that is characterized by the static rain attenuation statistics peculiar to the geometry of the satellite link and the rain statistics of the location. Such statistics are calculated by employing the formalism of Part I of this report. In fact, the dynamic model presented here is an extension of the static model and reduces to the static model in the appropriate limit. By assuming that rain attenuation is dynamically described by a first-order stochastic differential equation in time and that this random attenuation process is a Markov process, an expression for the associated transition probability is obtained by solving the related forward Kolmogorov equation. This transition probability is then used to obtain such temporal rain attenuation statistics as attenuation durations and allowable attenuation margins versus control system delay.

Manning, Robert M.↗

A guidance law for the aeroassisted plane change maneuver in the presence of atmospheric uncertainties

A stochastic feedback control law for a space vehicle performing an aeroassisted plane-change maneuver is developed. The stochastic control law is designed to minimize the energy loss while taking into consideration the uncertainty in the atmospheric density. The solution is based on expansion of the stochastic Hamilton-Jacobi-Bellman equation (or dynamic programming) about a zeroth-order known integrable solution. The resulting guidance law is expressed as a series expansion in the noise power spectral densities. A numerical example indicates the potential improvement of this method.

Mishne, D.↗

Improving Project Management with Simulation and Completion Distribution Functions

Despite the critical importance of project completion timeliness, management practices in place today remain inadequate for addressing the persistent problem of project completion tardiness. A major culprit in late projects is uncertainty, which most, if not all, projects are inherently subject to. This uncertainty resides in the estimates for activity durations, the occurrence of unplanned and unforeseen events, and the availability of critical resources. In response to this problem, this research developed a comprehensive simulation based methodology for conducting quantitative project completion time risk analysis. It is called the Project Assessment by Simulation Technique (PAST). This new tool enables project stakeholders to visualize uncertainty or risk, i.e. the likelihood of their project completing late and the magnitude of the lateness, by providing them with a completion time distribution function of their projects. Discrete event simulation is used within PAST to determine the completion distribution function for the project of interest. The simulation is populated with both deterministic and stochastic elements. The deterministic inputs include planned project activities, precedence requirements, and resource requirements. The stochastic inputs include activity duration growth distributions, probabilities for events that can impact the project, and other dynamic constraints that may be placed upon project activities and milestones. These stochastic inputs are based upon past data from similar projects. The time for an entity to complete the simulation network, subject to both the deterministic and stochastic factors, represents the time to complete the project. Repeating the simulation hundreds or thousands of times allows one to create the project completion distribution function. The Project Assessment by Simulation Technique was demonstrated to be effective for the on-going NASA project to assemble the International Space Station. Approximately $500 million per month is being spent on this project, which is scheduled to complete by 2010. NASA project stakeholders participated in determining and managing completion distribution functions produced from PAST. The first result was that project stakeholders improved project completion risk awareness. Secondly, using PAST, mitigation options were analyzed to improve project completion performance and reduce total project cost.

Cates, Grant R.↗

On the minimax feedback control of uncertain dynamic systems.

In this paper the problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗

Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems.

The problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗

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.↗

Precise orbit determination for NASA's earth observing system using GPS (Global Positioning System)

An application of a precision orbit determination technique for NASA's Earth Observing System (EOS) using the Global Positioning System (GPS) is described. This technique allows the geometric information from measurements of GPS carrier phase and P-code pseudo-range to be exploited while minimizing requirements for precision dynamical modeling. The method combines geometric and dynamic information to determine the spacecraft trajectory; the weight on the dynamic information is controlled by adjusting fictitious spacecraft accelerations in three dimensions which are treated as first order exponentially time correlated stochastic processes. By varying the time correlation and uncertainty of the stochastic accelerations, the technique can range from purely geometric to purely dynamic. Performance estimates for this technique as applied to the orbit geometry planned for the EOS platforms indicate that decimeter accuracies for EOS orbit position may be obtainable. The sensitivity of the predicted orbit uncertainties to model errors for station locations, nongravitational platform accelerations, and Earth gravity is also presented.

Williams, B. G.↗

On the Stochastic Quantization Method: Characteristics and Applications to Singular Systems

Introducing the generalized Langevin equation, we extend the stochastic quantization method so as to deal with singular dynamical systems beyond the ordinary territory of quantum mechanics. We also show how the uncertainty relation is built up to the quantum mechanical limit with respect to fictitious time, irrespective of its initial value, within the framework of the usual stochastic quantization method.

Kanenaga, Masahiko↗

Complexity of life via collective mind

e mind is introduced as a set of simple intelligent units (say, neurons, or interacting agents), which can communicate by exchange of information without explicit global control. Incomplete information is compensated by a sequence of random guesses symmetrically distributed around expectations with prescribed variances. Both the expectations and variances are the invariants characterizing the whole class of agents. These invariants are stored as parameters of the collective mind, while they contribute into dynamical formalism of the agents' evolution, and in particular, into the reflective chains of their nested abstract images of the selves and non-selves. The proposed model consists of the system of stochastic differential equations in the Langevin form representing the motor dynamics, and the corresponding Fokker-Planck equation representing the mental dynamics (Motor dynamics describes the motion in physical space, while mental dynamics simulates the evolution of initial errors in terms of the probability density). The main departure of this model from Newtonian and statistical physics is due to a feedback from the mental to the motor dynamics which makes the Fokker-Planck equation nonlinear. Interpretation of this model from mathematical and physical viewpoints, as well as possible interpretation from biological, psychological, and social viewpoints are discussed. The model is illustrated by the dynamics of a dialog.

collective intelligence↗

Solar flux forecasting using mutual information with an optimal delay

Solar flux F(sub 10.7) directly affects the atmospheric density, thereby changing the lifetime and prediction of satellite orbits. For this reason, accurate forecasting of F(sub 10.7) is crucial for orbit determination of spacecraft. Our attempts to model and forecast F(sub 10.7) uncovered highly entangled dynamics. We concluded that the general lack of predictability in solar activity arises from its nonlinear nature. Nonlinear dynamics allow us to predict F(sub 10.7) more accurately than is possible using stochastic methods for time scales shorter than a characteristic horizon, and with about the same accuracy as using stochastic techniques when the forecasted data exceed this horizon. The forecast horizon is a function of two dynamical invariants: the attractor dimension and the Lyapunov exponent. In recent years, estimation of the attractor dimension reconstructed from a time series has become an important tool in data analysis. In calculating the invariants of the system, the first necessary step is the reconstruction of the attractor for the system from the time-delayed values of the time series. The choice of the time delay is critical for this reconstruction. For an infinite amount of noise-free data, the time delay can, in principle, be chosen almost arbitrarily. However, the quality of the phase portraits produced using the time-delay technique is determined by the value chosen for the delay time. Fraser and Swinney have shown that a good choice for this time delay is the one suggested by Shaw, which uses the first local minimum of the mutual information rather than the autocorrelation function to determine the time delay. This paper presents a refinement of this criterion and applies the refined technique to solar flux data to produce a forecast of the solar activity.

Ashrafi, S.↗