SEARCH · Engineering Papers
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.
Discrete parameter covariance stationary stochastic process in rotation sampling, deriving minimum variance unbiased linear population mean estimator by constrained optimization procedure
This short paper develops a hierarchically structured, suboptimal controller for a linear stochastic system composed of fast and slow subsystems. It is proved that the controller is optimal in the limit as the separation of time scales of the subsystems becomes infinite. The methodology is illustrated by design of a controller to suppress the phugoid and short-period modes of the longitudinal dynamics of the F-8 aircraft.
This paper develops a hierarchically-structured, suboptimal controller for a linear stochastic system composed of fast and slow subsystems. It is proved that the controller is optimal in the limit as the separation of time scales of the subsystems becomes infinite. The methodology is illustrated by design of a controller to suppress the phugoid and short period modes of the longitudinal dynamics of the F-8 aircraft.
Risk importance measures are indexes that are used to rank systems, structures and components (SSCs) using risk-informed methods. The most used/known measures are: Risk Reduction Worth (RRW), Risk Achievement Worth (RAW), Birnbaum (B) and Fussell-Vesely (FV). Once obtained from classical Probabilistic Risk Analysis (PRA) analyses, these risk measures can be effectively employed to optimize component testing and maintenance. In contrast to classical PRA methods, Dynamic PRA methods couple stochastic methods with safety analysis codes to determine risk associate to complex systems such as nuclear plants. Compared to classical PRA methods, they can evaluate with higher resolution the safety impact of timing and sequencing of events on the accident progression. The objective of this paper is to present a series of algorithms that can be used to determine classical risk importance measures (RRW, RAW, B and FV) along with newly developed ones from a Dynamic PRA analysis.
Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.
We have studied the dynamics of Brownian particles in a confined geometry of dumbbell-shape with periodically oscillating walls. Entropic stochastic resonance (ESR) behavior, characterizing by a maximum value of the coherent factor Q at some optimal level of noise, is observed even without external periodic force in the horizontal direction, which is necessary for conventional ESR where the wall is static and the particle is subjected to the force. Interestingly, the ESR can be remarkably enhanced by the particle gravity G, in contrast to the conventional case. In addition, Q decreases (increases) with G in the small (large) noise limit, respectively, while it non-monotonically changes with G for moderate noise levels. We have applied an effective 1D coarsening description to illustrate such a nontrivial dependence on G, by investigating the property of the 1D effective potential of entropic nature and paying special attention to the excess part resulting from the boundary oscillation. Dependences of the ESR strength with other related parameters are also discussed.
Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.
Many airports are adopting battery electric buses in their shuttle fleets due to concerns over air quality and regulations. This study proposes a simulation-based optimization modeling framework to help airport shuttle operators effectively deploy electric buses. We evaluated a planned airport electric shuttle system with an event-driven simulator. Empirical data collected from existing systems were used to drive the simulations. We then proposed a simulation-based optimization model to determine the battery capacity, charging power, and number of chargers so that predefined objective(s) (e.g., minimizing total capital cost, minimizing emissions) are optimized. Compared to existing studies, the primary contribution of the proposed method is that it can model the real-world stochastic nature of operations in an electric bus system with much higher fidelity. To demonstrate the proposed modeling framework, we study a real-world shuttle system at the Dallas-Fort Worth International Airport, and present extensive numerical studies. When considering partial fleet electrification, the model can provide a set of Pareto optimal solutions. When considering full fleet electrification, the optimal solution requires a 50-kWh battery capacity and four 210-kW chargers, resulting in a total capital cost of $26,744,000. The results demonstrate that the proposed modeling framework can effectively optimize the planning of electric airport shuttle systems with partial or full fleet electrification.
We present a learning-based, demand-supply-coupled optimization model for the charging station location problem (CSLP), aiming to integrate the concept of electric vehicle (EV) charging demand management into the planning of charging infrastructures. In stage one, a gradient boosting-based learning model is developed to predict the charging demand of a charging station based on 15 defined features. Next, in stage two, a demand–supply-coupled CSLP model is developed to optimize the total charging usage rates of both existing and newly selected charging stations. We design a gradient-based stochastic spatial search algorithm to solve the proposed model. A case study with 6-year charging event data from Kansas City Missouri is performed. Results show that the proposed method can generate satisfactory charging demand predictions, and can increase charging usage rates by 14%, outperforming two benchmark approaches. Furthermore, the results of this research are poised to guide agencies in identifying optimal locations for new charging stations.
In this work, we propose a three-stage resilient unit commitment model which considers uncertain typhoon paths and line outages to improve the power system resilience against typhoon events. The proposed solution coordinates resources in response to the worst-case scenario for each possible typhoon path. The optimal decision is based on the characterization of the power system schedule into three stages of preventive control, emergency control, and restoration. Preventive control is performed before the typhoon occurs by quickly adjusting the three-stage resilient unit commitment schedule; emergency control is conducted during the typhoon by shedding local loads to meet the power balance, while other control strategies are assumed to be unavailable due to possible interruptions in the communication system; restoration is realized after the typhoon, when resources are optimally dispatched to repair the outages of critical devices and recover the normal operation state of the power system quickly. Considering the typhoon path uncertainty, we have introduced a stochastic model for possible typhoon paths where all possible affected lines along each typhoon path are assumed to be on outage during the typhoon. Accordingly, we explore the strategy for co-optimizing the three stages in unit commitment. The proposed model is tested on the IEEE 118-bus system and the real-world provincial system to verify its effectiveness.
In this paper, we present a method of optimizing the energy management of a plug-in hybrid electric vehicle (PHEV) using GIS-assisted stochastic trip prediction. A process was developed to synthesize speed profiles through a combination of Markov chains and information from a geographical information system (GIS) about the future route. In a potential real-world scenario, the future trip (speed, grade, stops, etc.) can be estimated, but not deterministically known. The stochastic trip prediction process models such uncertainty. The route-based energy management presented in this paper uses the Pontryagin Minimum Principle (PMP). A PMP strategy was implemented in a Simulink controller for a model of Prius-like PHEV and compared to a baseline strategy using Autonomie, an automotive modeling environment. An itinerary was defined, and several speed profiles were synthesized. It was then possible to evaluate the sensitivity of PMP tuning to the speed profile, providing insights about the applicability of PMP control in real-world situations.
Efficient Boltzmann-sampling using first-principles methods is challenging for extended systems due to the steep scaling of electronic structure methods with the system size. Additionally, stochastic approaches provide a gentler system-size dependency at the cost of introducing “noisy” forces, which could limit the efficiency of the sampling. When the forces are deterministic, the first-order Langevin dynamics (FOLD) offers efficient sampling by combining a well-chosen preconditioning matrix S with a time-step-bias-mitigating propagator [G. Mazzola and S. Sorella, Phys. Rev. Lett. 118, 015703 (2017)]. However, when forces are noisy, S is set equal to the force-covariance matrix, a procedure that severely limits the efficiency and the stability of the sampling. Here, we develop a new, general, optimal, and stable sampling approach for FOLD under noisy forces. We apply it for silicon nanocrystals treated with stochastic density functional theory and show efficiency improvements by an order-of-magnitude.
The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.
Variability on the physical characteristics of feedstock has a relevant effect on the reactor’s reliability and operating cost. Most of the models developed to optimize biomass supply chains have failed to quantify the effect of biomass quality and preprocessing operations required to meet biomass specifications on overall cost and performance. The Integrated Biomass Supply Analysis and Logistics (IBSAL) model estimates the harvesting, collection, transportation, and storage cost while considering the stochastic behavior of the field-to-biorefinery supply chain. This paper proposes an IBSAL-SimMOpt (Simulation-based Multi-Objective Optimization) method for optimizing the biomass quality and costs associated with the efforts needed to meet conversion technology specifications. The method is developed in two phases. For the first phase, a SimMOpt tool that interacts with the extended IBSAL is developed. For the second phase, the baseline IBSAL model is extended so that the cost for meeting and/or penalization for failing in meeting specifications are considered. The IBSAL-SimMOpt method is designed to optimize quality characteristics of biomass, cost related to activities intended to improve the quality of feedstock, and the penalization cost. A case study based on 1916 farms in Ontario, Canada is considered for testing the proposed method. Analysis of the results demonstrates that this method is able to find a high-quality set of non-dominated solutions.
Purpose: To develop a fast optimization method for station parameter optimized radiation therapy (SPORT) and show that SPORT is capable of improving VMAT in both plan quality and delivery efficiency. Methods: The angular space from 0° to 360° was divided into 180 station points (SPs). A candidate aperture was assigned to each of the SPs based on the calculation results using a column generation algorithm. The weights of the apertures were then obtained by optimizing the objective function using a state-of-the-art GPU based Proximal Operator Graph Solver (POGS) within seconds. Apertures with zero or low weight were thrown out. To avoid being trapped in a local minimum, a stochastic gradient descent method was employed which also greatly increased the convergence rate of the objective function. The above procedure repeated until the plan could not be improved any further. A weighting factor associated with the total plan MU also indirectly controlled the complexities of aperture shapes. The number of apertures for VMAT and SPORT was confined to 180. The SPORT allowed the coexistence of multiple apertures in a single SP. The optimization technique was assessed by using three clinical cases (prostate, H&N and brain). Results: Marked dosimetric quality improvement was demonstrated in the SPORT plans for all three studied cases. Prostate case: the volume of the 50% prescription dose was decreased by 22% for the rectum. H&N case: SPORT improved the mean dose for the left and right parotids by 15% each. Brain case: the doses to the eyes, chiasm and inner ears were all improved. SPORT shortened the treatment time by ∼1 min for the prostate case, ∼0.5 min for brain case, and ∼0.2 min for the H&N case. Conclusion: The superior dosimetric quality and delivery efficiency presented here indicates that SPORT is an intriguing alternative treatment modality.
Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.
In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.
We present robust trajectory optimization techniques using a sweeping gradient method for ordinary differential equations with events (SGM) and linear covariance analysis (LinCov). SGM is a method for computing the gradient of trajectory analyses defined by performance indices over initial value problems with events with respect to static parameters. LinCov is an analytic technique for predicting stochastic behavior of dynamical systems. By combining SGM and LinCov, it is possible use efficient, off-the-shelf, gradient-based optimizers to solve robust optimal trajectory design problems. We describe the individual methods and some details on how they can be combined. Then we apply the combined techniques to a variety of orbital trajectory design problems to demonstrate its use, including minimum fuel transfer and mid-course correction burn scheduling.