Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic optimization”

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 595 records · Page 33

Frequency Support From Electric Vehicles for Advancing Renewable Energy Integration

The integration of renewable energy resources (RERs) in the modern power grid is increasing rapidly because of aggressive decarbonization goals, lower costs, and increased government investment. However, higher penetrations of inverter-based generation can lead to frequency stability issues because of reduced system inertia. This paper develops a framework for quantifying the contribution of electric vehicles (EVs) toward providing frequency support to the grid and thus increasing the penetration limit of renewable energy resources (RERs). EVs are considered to provide both inertial response and primary frequency response support to the grid. A stochastic approach incorporating the uncertainties associated with the behavior of EVs is developed to derive the discharge limit of EV aggregators. A multi-machine system frequency response (MM-SFR) model is developed, which incorporates the dynamic virtual inertia and droop coefficients of EV aggregators derived from the EV control modules. Frequency security constraints are developed from this MM-SFR model, which, along with the converter voltage security and low voltage ride-through constraints, are integrated within a nonlinear optimization framework to determine the RER integration limit. Here, the efficacy of the proposed approach is validated using the RTS-GMLC test system.

25 ENERGY STORAGE↗

Optimal dynamic remapping of parallel computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results 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. The results also suggest that this heuristic is applicable to computations with more than two phases.

Nicol, David M.↗

Correlated Noise Estimation with Quantum Sensor Networks

We address the metrological problem of estimating collective stochastic properties imprinted on a network of quantum sensors. Canonical examples include center-of-mass quadrature fluctuations in a system of bosonic modes and correlated dephasing in an ensemble of qubits (e.g., spins), bosons, or fermions. We develop a theoretical framework to determine the limits of correlated (weak) noise estimation with quantum sensor networks and reveal the requirements for entanglement advantage. Notably, an advantage emerges from the synergistic interplay between quantum correlations of the sensors and “classical” correlations of the noises. Here, we determine optimal entangled probe states and identify a sensing protocol—reminiscent of a many-body echo—that achieves the fundamental limits of measurement sensitivity for a broad class of problems, unveiling a route toward entanglement-enhanced metrology of correlated many-body phenomena.

Quantum metrology↗

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗

The analytical design of spectral measurements for multispectral remote sensor systems

The author has identified the following significant results. In order to choose a design which will be optimal for the largest class of remote sensing problems, a method was developed which attempted to represent the spectral response function from a scene as accurately as possible. The performance of the overall recognition system was studied relative to the accuracy of the spectral representation. The spectral representation was only one of a set of five interrelated parameter categories which also included the spatial representation parameter, the signal to noise ratio, ancillary data, and information classes. The spectral response functions observed from a stratum were modeled as a stochastic process with a Gaussian probability measure. The criterion for spectral representation was defined by the minimum expected mean-square error.

Wiersma, D. J.↗

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. This adaptive system is structured as a multistage stochastic process of detection, identification, and compensation. It is shown that the detection system can be effectively constructed on the basis of a design value, specified by mission requirements, of the unknown parameter in the actual system, and of a degradation mode in the form of a constant bias jump. A suboptimal detection system on the basis of Wald's sequential analysis is developed using the concept of information value and information feedback. The developed system is easily implemented, and demonstrates a performance remarkably close to that of the optimal nonlinear detection system. An invariant transformation is derived to eliminate the effect of nuisance parameters such that the ambiguous identification system can be reduced to a set of disjoint simple hypotheses tests. By application of a technique of decoupled bias estimation in the compensation system the adaptive system can be operated without any complicated reorganization.

Chien, T.-T.↗

Dynamic rain fade compensation techniques for the advanced communications technology satellite

The dynamic and composite nature of propagation impairments that are incurred on earth-space communications links at frequencies in and above the 30/20 GHz Ka band necessitate the use of dynamic statistical identification and prediction processing of the fading signal in order to optimally estimate and predict the levels of each of the deleterious attenuation components. Such requirements are being met in NASA's Advanced Communications Technology Satellite (ACTS) project by the implementation of optimal processing schemes derived through the use of the ACTS Rain Attenuation Prediction Model and nonlinear Markov filtering theory. The ACTS Rain Attenuation Prediction Model discerns climatological variations on the order of 0.5 deg in latitude and longitude in the continental U.S. The time-dependent portion of the model gives precise availability predictions for the 'spot beam' links of ACTS. However, the structure of the dynamic portion of the model, which yields performance parameters such as fade duration probabilities, is isomorphic to the state-variable approach of stochastic control theory and is amenable to the design of such statistical fade processing schemes which can be made specific to the particular climatological location at which they are employed.

Manning, Robert M.↗

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗

Optimal Estimation of Rain Rate Profiles from Single-Frequency Radar Echoes

It is well-documented (Hitschfeld and Bordan 1954, Meneghini 1978, Haddad et al 1993) that there are significant ambiguites inherent in the determination of a particular vertical rain intensity profile from a given time profile of radar echo powers measured by a downward-looking (spaceborne or airborne) radar at a single attenuating frequency.

stochastic constraints Ku-band Precipitation Radar↗

Providing an empirical basis for optimizing the verification and testing phases of software development

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 density components so that the 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 an alternative approach for constructing such models that is intended to fulfill specific software engineering needs (i.e. dealing with partial/incomplete information and creating models that are easy to interpret). Our approach to classification is as follows: (1) to measure the software system to be considered; and (2) to build multivariate stochastic models for prediction. We present experimental results obtained by classifying FORTRAN components developed at the NASA/GSFC into two fault density classes: low and high. Also we evaluate the accuracy of the model and the insights it provides into the software process.

Briand, Lionel C.↗

Trends in modern system theory

The topics considered are related to linear control system design, adaptive control, failure detection, control under failure, system reliability, and large-scale systems and decentralized control. It is pointed out that the design of a linear feedback control system which regulates a process about a desirable set point or steady-state condition in the presence of disturbances is a very important problem. The linearized dynamics of the process are used for design purposes. The typical linear-quadratic design involving the solution of the optimal control problem of a linear time-invariant system with respect to a quadratic performance criterion is considered along with gain reduction theorems and the multivariable phase margin theorem. The stumbling block in many adaptive design methodologies is associated with the amount of real time computation which is necessary. Attention is also given to the desperate need to develop good theories for large-scale systems, the beginning of a microprocessor revolution, the translation of the Wiener-Hopf theory into the time domain, and advances made in dynamic team theory, dynamic stochastic games, and finite memory stochastic control.

Athans, M.↗

Structural Properties and Estimation of Delay Systems

Two areas in the theory of delay systems were studied: structural properties and their applications to feedback control, and optimal linear and nonlinear estimation. The concepts of controllability, stabilizability, observability, and detectability were investigated. The property of pointwise degeneracy of linear time-invariant delay systems is considered. Necessary and sufficient conditions for three dimensional linear systems to be made pointwise degenerate by delay feedback were obtained, while sufficient conditions for this to be possible are given for higher dimensional linear systems. These results were applied to obtain solvability conditions for the minimum time output zeroing control problem by delay feedback. A representation theorem is given for conditional moment functionals of general nonlinear stochastic delay systems, and stochastic differential equations are derived for conditional moment functionals satisfying certain smoothness properties.

Kwong, R. H. S.↗

Endogenizing Probabilistic Resource Adequacy Risks in Deterministic Capacity Expansion Models

In this work, we demonstrate how power system capacity expansion models can understate the stochastic effects of thermal outages when considering resource availabilities on an hourly expected value basis, yielding system designs with multiple orders of magnitude more shortfall risk than stated adequacy targets. We develop a novel approximation approach to efficiently endogenize awareness of this risk in a deterministic, linear capacity expansion framework. We compare this approach to exogenous tuning of an energy reserve margin, the leading alternative method to compensate for unmodeled probabilistic shortfall risk. Empirical results from a test system show that the new endogenous method cost-effectively meets all regional reliability targets with a single optimization solve, and produces a near-identical system design as the incumbent method without the need for repeated re-optimizations to find an appropriate reserve level. The endogenous method may also use iterative re-optimizations to further improve solution quality, although these incremental benefits were modest in the system studied.

capacity expansion modeling↗

Optimal Control of Differentially Private EV Charging: A Scalable Learning Approach Under Uncertainty

Internet of Things (IoT)-enabled electric vehicles (IoEVs) enable intelligent charging coordination that accounts for grid congestion. However, increased data exchange raises privacy concerns, as charging patterns can reveal sensitive driver behavior to grid operators. Here, we propose a differentially private (DP) EV charging framework that enables coordinated control while protecting driver data with theoretical privacy guarantees. Nevertheless, integrating DP inevitably introduces uncertainty into the control strategy for EVs, which can lead to infeasible solutions. To tackle this challenge, we develop a feasible and scalable control algorithm based on constrained reinforcement learning (CRL) and convex hulls. While our framework is designed to handle the uncertainty introduced by DP, it is general and also applicable to other sources of uncertainty in EV charging, such as the stochastic nature of driver behavior and renewable variability. This ensures feasible and privacy-preserving coordination of EV charging at scale. Our method constructs convex hulls within the action space to guarantee feasibility under stochastic constraints and incorporates constraint reduction techniques to improve scalability. Case studies based on IEEE benchmark systems demonstrate that the proposed approach effectively balances feasibility under uncertainty, scalability, and privacy in large-scale EV charging control.

Engineering - Power transmission and distribution↗

Current-based metrology with two-terminal mesoscopic conductors

The traditional approach to quantum parameter estimation focuses on the quantum state, deriving fundamental bounds on precision through the quantum Fisher information. In most experimental settings, however, performing arbitrary quantum measurements is highly unfeasible. In open quantum systems, an alternative approach to metrology involves the measurement of stochastic currents flowing from the system to its environment. However, the present understanding of current-based metrology is mostly limited to Markovian master equations. Considering a parameter estimation problem in a two-terminal mesoscopic conductor, we identify the key elements that determine estimation precision within the Landauer-Büttiker formalism. Crucially, this approach allows us to address arbitrary coupling and temperature regimes. Furthermore, we obtain analytical results for the precision in linear-response and zero-temperature regimes. For the specific parameter estimation task that we consider, we demonstrate that the boxcar transmission function is optimal for current-based metrology in all parameter regimes.

Landauer formula↗

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗

Using neural networks and Dyna algorithm for integrated planning, reacting and learning in systems

The traditional AI answer to the decision making problem for a robot is planning. However, planning is usually CPU-time consuming, depending on the availability and accuracy of a world model. The Dyna system generally described in earlier work, uses trial and error to learn a world model which is simultaneously used to plan reactions resulting in optimal action sequences. It is an attempt to integrate planning, reactive, and learning systems. The architecture of Dyna is presented. The different blocks are described. There are three main components of the system. The first is the world model used by the robot for internal world representation. The input of the world model is the current state and the action taken in the current state. The output is the corresponding reward and resulting state. The second module in the system is the policy. The policy observes the current state and outputs the action to be executed by the robot. At the beginning of program execution, the policy is stochastic and through learning progressively becomes deterministic. The policy decides upon an action according to the output of an evaluation function, which is the third module of the system. The evaluation function takes the following as input: the current state of the system, the action taken in that state, the resulting state, and a reward generated by the world which is proportional to the current distance from the goal state. Originally, the work proposed was as follows: (1) to implement a simple 2-D world where a 'robot' is navigating around obstacles, to learn the path to a goal, by using lookup tables; (2) to substitute the world model and Q estimate function Q by neural networks; and (3) to apply the algorithm to a more complex world where the use of a neural network would be fully justified. In this paper, the system design and achieved results will be described. First we implement the world model with a neural network and leave Q implemented as a look up table. Next, we use a lookup table for the world model and implement the Q function with a neural net. Time limitations prevented the combination of these two approaches. The final section discusses the results and gives clues for future work.

Lima, Pedro↗

GCR Transport in the Brain: Assessment of Self-Shielding, Columnar Damage, and Nuclear Reactions on Cell Inactivation Rates

Radiation shield design is driven by the need to limit radiation risks while optimizing risk reduction with launch mass/expense penalties. Both limitation and optimization objectives require the development of accurate and complete means for evaluating the effectiveness of various shield materials and body-self shielding. For galactic cosmic rays (GCR), biophysical response models indicate that track structure effects lead to substantially different assessments of shielding effectiveness relative to assessments based on LET-dependent quality factors. Methods for assessing risk to the central nervous system (CNS) from heavy ions are poorly understood at this time. High-energy and charge (HZE) ion can produce tissue events resulting in damage to clusters of cells in a columnar fashion, especially for stopping heavy ions. Grahn (1973) and Todd (1986) have discussed a microlesion concept or model of stochastic tissue events in analyzing damage from HZE's. Some tissues, including the CNS, maybe sensitive to microlesion's or stochastic tissue events in a manner not illuminated by either conventional dosimetry or fluence-based risk factors. HZE ions may also produce important lateral damage to adjacent cells. Fluences of high-energy proton and alpha particles in the GCR are many times higher than HZE ions. Behind spacecraft and body self-shielding the ratio of protons, alpha particles, and neutrons to HZE ions increases several-fold from free-space values. Models of GCR damage behind shielding have placed large concern on the role of target fragments produced from tissue atoms. The self-shielding of the brain reduces the number of heavy ions reaching the interior regions by a large amount and the remaining light particle environment (protons, neutrons, deuterons. and alpha particles) may be the greatest concern. Tracks of high-energy proton produce nuclear reactions in tissue, which can deposit doses of more than 1 Gv within 5 - 10 cell layers. Information on rates of cell killing from GCR, including patterns of cell killing from single particle tracks. can provide useful information on expected differences between proton and HZE tracks and clinical experiences with photon irradiation. To model effects on cells in the brain, it is important that transport models accurately describe changes in the GCR due to interactions in the cranium and proximate tissues. We describe calculations of the attenuated GCR particle fluxes at three dose-points in the brain and associated patterns of cell killing using biophysical models. The effects of the brain self-shielding and bone-tissue interface of the skull in modulating the GCR environment are considered. For each brain dose-point, the mass distribution in the surrounding 4(pi) solid angle is characterized using the CAM model to trace 512 rays. The CAM model describes the self-shielding by converting the tissue distribution to mass-equivalent aluminum, and nominal values of spacecraft shielding is considered. Particle transport is performed with the proton, neutron, and heavy-ion transport code HZETRN with the nuclear fragmentation model QMSFRG. The distribution of cells killed along the path of individual GCR ions is modeled using in vitro cell inactivation data for cells with varying sensitivity. Monte Carlo simulations of arrays of inactivated cells are considered for protons and heavy ions and used to describe the absolute number of cell killing events of various magnitude in the brain from the GCR. Included are simulations of positions of inactivated cells from stopping heavy ions and nuclear stars produced by high-energy ions most importantly, protons and neutrons.

Shavers, M. R.↗