SEARCH · Search NASA
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.
This paper describes an approach for optimizing over interdependent planning goals. We have implemented a methodology for representing and utilizing information about interdependent goals and their related utilities using the ASPEN planning and scheduling system.
This paper presents a new approach to optimal trajectory design that considers uncertainties in the system, referred to herein as robust trajectory optimization. This approach assumes an existing reference trajectory and optimizes the locations of midcourse correction burns and utilization of onboard navigation sensors to minimize dispersions in ∆v or final position. Navigation errors, maneuver execution errors, orbit insertion errors, and environmental modeling errors are considered. The application in this paper is cislunar flight with the goal of injecting into a Near-Rectilinear Halo Orbit for rendezvous with a target vehicle. Two complementary optimization problems are proposed. One problem minimizes the total ∆v dispersion subject to a final position dispersion constraint. The other problem minimizes the final position dispersion subject to a total ∆v dispersion constraint. The results from each optimization problem are shown for a complete mission profile.
Abnormal climates due to global warming have emerged as a big concern in the global community. To mitigate climate change and achieve sustainability, distributed energy resources (DERs), including solar and wind, have been recently deployed in power systems. As the penetration level of DERs has increased, however, it caused a multitude of issues in the power systems, such as voltage fluctuation in the distribution network limiting renewable hosting capacity. On the other hand, the electric vehicle (EV) industry is rapidly growing to facilitate the transition to a carbon-neutral community, illuminating the potential of EVs as a flexible grid asset to mitigate some of the issues and improve grid operation, if properly exploited. To explore the potential of EVs, this paper proposes an EV scheduling strategy. By using an optimal EV charging scheduling proposed, distribution system operators (DSOs) can minimize their operating costs and stably operate the system with a high level of DERs. To validate the method, a modified IEEE 33-bus system with DERs is developed. The case study shows the proposed scheduling strategizes EV charging to reduce the cost of PV curtailment. In the study, the method outperforms the renewable-only case with curtailment by 4.97% in DSO cost. It also demonstrates its potential to increase the renewable hosting capacity by harmonizing EV charging with renewables.
Planetary protection (PP) is a discipline that focuses on minimizing the biological contamination of spacecraft to ensure compliance with international policy. Precise estimation of bioburden - the total number of microbes in or on spacecraft hardware – and the bioburden density are of utmost importance for PP. Such estimation is the way concordance with requirements is demonstrated, and it is critical for quantifying the potential risk of inadvertently contaminating other planetary bodies. Although a suite of molecular techniques have been used to thoroughly characterize and profile the microbiome of various cleanroom environments and spacecraft, the gold standard remains the physical enumeration of microbes via culturing of samples directly taken from spacecraft and associated surfaces. However, due to technical, budgetary, and programmatic constraints, only a manageable portion (around 10%) of the entire spacecraft surface is directly sampled with cotton swabs or wipes. To generate the bioburden current best estimate (CBE) for components not directly verifiable, the accepted approach is to apply a NASA-defined bioburden estimate based on the components’ manufacturing or assembly environment. This approach utilizes a prespecified bioburden density estimation that applies a maximum value across the total surface area of the specified component. For hardware components that underwent similar assembly processes, an implied bioburden is adopted for all components, based on a direct verification of a representative component within the same lot. Once all components have a CBE, the bioburden estimates are generated. In previous publication [ 1], we have shown that statistical risks quantifying the accuracy of the estimates for sampled, prespecified, and implied components can be derived and ranked. For mean squared error (MSE) function, the risks are available analytically and hence a cost function can be obtained to optimize the risks with respect to the sampling area and sampling cost. Since the sampling area and sampling cost are two complimentary variables, their sum will have a well-defined minimum. This paper presents the multivariate optimization of the integrated risk of an empirical Bayes estimator to determine the optimal sampling schedule for a given number of components. It is assumed that given a number of components, N, the bioburden density for each component can either be sampled, implied, or prespecified. The multivariate optimization searches through different options to sample, imply or prespecify the bioburden density for a component, and account for the component’s surface area and cost of sampling. The idea of the optimization is based on the observation that the statistical risk of using an estimator is a monotonically decreasing function of the sampled area. The larger the sampled area, the lower the risk of using the estimator as the estimator becomes more and more accurate as the sampling area increases. On the other hand, the cost of sampling is monotonically increasing as the sampled surface grows. This makes the risk and total cost of sampling complimentary variables which can be counterbalanced to achieve an optimal overall value with respect to the sampled surface. In this paper, the integrated risk has been used to quantify the accuracy of the estimator. This risk has been selected because it depends on neither the true value of the parameter nor on the collected data. The cost of each sample was also available to obtain the total cost of sampling of N components. The paper will present the results based on computer-simulated data as well as the data collected during the InSight mission. The computer-simulated data have N components with randomly generated total areas and each component assigned to one of the three categories according to the method of estimating of bioburden density: sampled, implied, or prespecified. The cost of sampling is also available. The cost of sampling is estimated based on a cost model provided by the planetary protection group at JPL. For this paper, the overall cost was assumed to be a linear function of exposure. The optimization process finds the allocation of the components to the three categories that minimizes the tradeoff between integrated risk and total cost. For the InSight data, a set of components is selected representing all three categories, and optimization is performed to determine if the performed allocation was optimal or if a better allocation could have been obtained. To the best of our knowledge, this work is the first attempt not only perform an accurate estimation of bioburden density but also do it in an optimal way.
This paper presents a novel model-free multi-agent Reinforcement Learning (RL) control method to enhance the resilience of community energy systems in island mode, which coordinates multiple objectives without the necessity of identifying system models that require expert knowledge. Specifically, a community-level coordinator agent is designed to allocate renewable energy resources among different buildings, and multiple building-level agents are developed to optimize load schedules based on limited energy resources and requirements of building loads and occupants’ comfort. In a two-day evaluation, our RL approach demonstrated a similar performance against MPC without requiring system models and formulation of optimization problems as required in MPC.
Background Immunotherapies, driven by immune-mediated antitumorigenicity, offer the potential for significant improvements to the treatment of multiple cancer types. Identifying therapeutic strategies that bolster antitumor immunity while limiting immune suppression is critical to selecting treatment combinations and schedules that offer durable therapeutic benefits. Combination oncolytic virus (OV) therapy, wherein complementary OVs are administered in succession, offer such promise, yet their translation from preclinical studies to clinical implementation is a major challenge. Overcoming this obstacle requires answering fundamental questions about how to effectively design and tailor schedules to provide the most benefit to patients. Methods We developed a computational biology model of combined oncolytic vaccinia (an enhancer virus) and vesicular stomatitis virus (VSV) calibrated to and validated against multiple data sources. We then optimized protocols in a cohort of heterogeneous virtual individuals by leveraging this model and our previously established in silico clinical trial platform. Results Enhancer multiplicity was shown to have little to no impact on the average response to therapy. However, the duration of the VSV injection lag was found to be determinant for survival outcomes. Importantly, through treatment individualization, we found that optimal combination schedules are closely linked to tumor aggressivity. We predicted that patients with aggressively growing tumors required a single enhancer followed by a VSV injection 1 day later, whereas a small subset of patients with the slowest growing tumors needed multiple enhancers followed by a longer VSV delay of 15 days, suggesting that intrinsic tumor growth rates could inform the segregation of patients into clinical trials and ultimately determine patient survival. These results were validated in entirely new cohorts of virtual individuals with aggressive or non-aggressive subtypes. Conclusions Based on our results, improved therapeutic schedules for combinations with enhancer OVs can be studied and implemented. Our results further underline the impact of interdisciplinary approaches to preclinical planning and the importance of computational approaches to drug discovery and development.
This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.
The Flexible Resource Scheduler is a hierarchical controller that manages the distributed energy resources in a distribution substation or distribution feeder to provide a firm commitment of power flow at the substation or feeder head to be scheduled in transmission-level markets as an aggregated demand resource. It is the reference controller for the FAST-DERMS Architecture, developed in tandem with the architecture under the DOE FAST-DERMS project. It is comprised of a day-ahead stochastic optimization, which schedules substation power flow and reserves, a intra-hour MPC, which generates dispatch base points for DER, and a real-time PID controller maintaining that dispatches DER to maintain the substation power around the base points. The repository also includes a representative aggregator controller, and all of the necessary components to run a simulation using PNNL's GridAPPS-D software with the controller.
An aerodynamic shape optimization method that treats the design of complex aircraft configurations subject to high fidelity computational fluid dynamics (CFD), geometric constraints and multiple design points is described. The design process will be greatly accelerated through the use of both control theory and distributed memory computer architectures. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods. The resulting problem is implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on a higher order CFD method. In order to facilitate the integration of these high fidelity CFD approaches into future multi-disciplinary optimization (NW) applications, new methods must be developed which are capable of simultaneously addressing complex geometries, multiple objective functions, and geometric design constraints. In our earlier studies, we coupled the adjoint based design formulations with unconstrained optimization algorithms and showed that the approach was effective for the aerodynamic design of airfoils, wings, wing-bodies, and complex aircraft configurations. In many of the results presented in these earlier works, geometric constraints were satisfied either by a projection into feasible space or by posing the design space parameterization such that it automatically satisfied constraints. Furthermore, with the exception of reference 9 where the second author initially explored the use of multipoint design in conjunction with adjoint formulations, our earlier works have focused on single point design efforts. Here we demonstrate that the same methodology may be extended to treat complete configuration designs subject to multiple design points and geometric constraints. Examples are presented for both transonic and supersonic configurations ranging from wing alone designs to complex configuration designs involving wing, fuselage, nacelles and pylons.
Price dynamics in wholesale electricity markets are driven by supply and demand. In markets with hydroelectric dams, the timing and amount of hydropower offered can influence prices in similar ways to wind and solar power. Unlike variable renewable energy, however, the supply of hydropower in wholesale markets is a function of both water availability and operational decisions at dams. Dam operators maximize revenues in wholesale markets by aligning generation with the periods of highest expected prices, and these scheduling decisions may in turn influence prices. Here, we examine the relative importance of two types of information in predicting forward electricity prices: a) water availability at dams, in the form of short-to-medium-range hydrological forecasts; and b) hourly scheduling decisions at dams. Using softly coupled hydrologic, hydropower scheduling, and power systems models spanning the U.S. Western Interconnection, we quantify the importance of hydrologic forecast accuracy in correctly predicting wholesale electricity prices and compare this with the influence of dam operators’ own hourly scheduling decisions on realized market prices. We find that aligning hydropower generation schedules with the periods of high forecasted prices causes larger, inadvertent price forecast errors than imperfect hydrologic forecasts. This suggests that knowledge of how water is managed by dam operators within the week is more important than weekly inflow forecast errors when predicting forward electricity prices. Our findings have implications for optimal hydropower scheduling by region. Specifically, accounting for price effects is critical in markets dominated by hydropower capacity.
This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods. The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations. In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that this basic methodology could be ported to distributed memory parallel computing architectures. In this paper, our concern will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.
A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.
Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.
Integrated Energy Systems (IES) combine two or more processes to increase the efficiency, flexibility of operation, and the overall reliability. However, analyzing IESs in volatile electricity markets is challenging, since the volatility in electricity prices makes the conventional levelized cost-type analysis less realistic. This work presents two approaches to address the challenge: price-taker and a surrogates-based approach for incorporating market interactions. The price-taker approach formulates a multiperiod optimization problem that takes the time-varying electricity prices into account, and solves the optimization problem to determine the optimal operational schedule that maximizes the chosen economic metric. This approach is successfully applied to investigate the performance of flexible power and hydrogen co-production systems. The market surrogates approach trains a machine learning model to predict the market behavior as a function of the characteristics of the IES. The trained surrogate model is used to optimize the design and operation of the given IES in an electricity market. This approach is demonstrated on a case study involving a nuclear power plant retrofitted with a low-temperature electrolysis unit to co-produce power and hydrogen.
This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods (13, 12, 44, 38). The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method (19, 20, 21, 23, 39, 25, 40, 41, 42, 43, 9) was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations (39, 25). In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that the basic methodology could be ported to distributed memory parallel computing architectures [241. In this paper, our concem will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.
The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.
In this work, a post-disaster distribution system repair and restoration (DSRR) strategy is proposed to improve distribution system resilience. The DSRR strategy is formulated as a two-stage optimization. The first stage is a comprehensive co-optimization of repair crew scheduling, dynamic network reconfiguration, and distributed energy resource (DER) dispatch based on the forecast load profile. The goal is to minimize the accumulative operating cost caused by the load reduction payment as well as DER operating cost. In particular, since the number of available repair crews is usually smaller than the number of faulted lines after a disaster event, the DSRR strategy determines the optimal scheduling for repairing faulted lines. The second stage is a re-dispatch of the DER power output and load shedding based on the real-time load demand of each bus. The proposed algorithm is validated by case studies of the IEEE 33-bus and 123-bus test systems. We consider those scenarios in which faults occur in multiple heavy-loaded feeders. The simulation results demonstrate that the DSRR strategy effectively coordinate the repair scheduling, network reconfiguration and load shedding to minimize the operating cost.
This report details recent progress for the ASCR funded project “Integrated End-to-end Performance Prediction and Diagnosis for Extreme Scientific Workflows”. We refer to the project as IPPD/2, reflecting the 2017 renewal under expanded scope and partners In IPPD/2, we increased our research scope to include data motion. We are focusing on three major aspects: a) observe how data is generated, distributed, and used; b) analyze how data is (repeatedly) consumed with a focus both on repeated patterns and anomalies; and c) explore how to optimize data motion. This new work on data motion will augment and complement IPPD/2’s research that focused on the computational aspects of tasks. We leverage and extend our existing tools and demonstrate our work on the Belle II workflow suite as well as on workflows from NSLS-II. The highlights of our work are as follows: Provenance for Workflows: Provenance is used to provide information enabling quality control, re-run computational workflows, and reproduce results. IPPD/2 has been building a scalable provenance management system that enables the capture of provenance from the high-level workflow through all relevant system levels in one integrated environment. Leveraging this work, our recent efforts have included using provenance as an enabling technique. Workload characterization: Leveraging provenance and analysis, we characterize data movement within network, storage, and memory over a variety of workloads. This characterization enables an understanding by performance analysts and application developers of the range of behaviors that could be expected. Performance Prediction for Workflows: The goal of modeling distributed workflows is to understand performance bottlenecks and enable more intelligent task scheduling to optimize selected metrics of interest (e.g., task throughput or output data rate). IPPD/2 has utilized both analytical and AI/ML modeling methodologies for performance modeling. Advanced Scheduling and Fault Modeling for Workflows: Scheduling of large-scale scientific workflows on geographically distributed resources is a challenging problem. To improve workflow throughput, we combined novel scheduling algorithms with task predictions from performance modeling and fault modeling. Dynamically Alleviating Bottlenecks in Workflows: Exploiting our provenance, analysis, and modeling efforts, we have explored and developed several techniques for dynamically detecting and alleviating bottlenecks in data movement. In particular, we have spent considerable effort demonstrating our techniques on production-like workflow configurations.