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.
Automated planning and scheduling, including automated path planning, has been integrated with an internet-based distributed operations system for planetary rover operations.
A number of successful applications of automated planning and scheduling applications to spacecraft operations have recently been reported in the literature. However, these applications have been one-of-a-kind applications that required a substantial amount of development effort. In this paper, we describe ASPEN, a modular, reconfigurable application framework which is capable of supporting a wide variety of planning applications. We describe the architecture of ASPEN, as well as a number of current spacecraft control/operations applications in progress.
Operations Mission Planner (OMP) is an ongoing research project at JPL that utilizes Artificial Intelligence techniques to create an intelligent, automated planning and scheduling system. The challenge with a user interface is to 1) present as much information as possible at a given moment and 2) allow the user to quickly navigate through the various types of displays. This paper describes a design which applies the hypertext model to solve user interface problems. The general paradigm is to provide maps and search queries to allow the user to quickly find an interesting conflict or problem. Then allow the user to navigate through the displays in a hypertext fashion.
A replicated field trial was performed on a Chualar sandy loam in California’s Salinas Valley during 2020 to investigate the yield response of drip-irrigated red cabbage to applied water volume. The crop was transplanted on 29-April and established with approximately 4 inches of water uniformly applied by overhead sprinklers. At 22 days after transplanting (DAT), five drip-irrigation treatments were established at 50, 75, 100, 125, and 150% of estimated daily crop evapotranspiration (ETc). The treatments were replicated 6 times following a randomized complete block design. The 100% crop water requirement was specified by CropManage, an irrigation scheduling application that combines a crop coefficient approach with reference evapotranspiration data from the California Irrigation Management Information System. The crop was irrigated 3 times per week. Nitrogen fertilizer, totaling 320 lbs/ac, was applied through the drip system once per week. Commercial carton yields were evaluated 85 DAT. The 100% ETc treatment received a total of 18.3 inches of water including sprinkler establishment and had the highest yield at 57 tons/ac, while the 50% treatment (11.5 inches) yielded a low of 32 tons/ac. For reference, average applied water reported for this crop on the Central Coast is about 22.5 inches by way of a variety of irrigation methods including drip, sprinkler, and furrow. Aboveground biomass was evaluated 91 DAT. The 100% treatment had the highest fresh (105 tons/ac) and dry (7.7 tons/ac) biomass yield. Commercial bulk yields at 98 DAT and were maximized by 20-24 inches of water (100%, 125% treatments) and ranged from a high of 67 tons/ac for 125% ETc treatment (24.3 inches of water) to 35 tons/ac for the 50% treatment (12.6 inches). The results demonstrated that yield and quality targets for this crop can be met by drip irrigation, and CropManage is an effective decision support tool for evaluating crop water requirements based on weather data.
As NASA turns its sights to deep-space exploration, a greater focus on sup-porting crew autonomy has led to the development of Playbook, a self-scheduling software tool. Evaluating the user satisfaction of Playbook is essential in ensuring its usability for critical spaceflight operations. Satisfaction of an interface is often quantified with attitude surveys, such as the User Experience Questionnaire (UEQ). This paper demonstrates an application of the UEQ in comparing the user experience of Playbook interface de-signs for displaying graphical data. We lay the foundation for future user experience comparisons by defining a satisfaction baseline, which is crucial as more features are integrated into Playbook’s interface. This work ex-tends a validated user experience framework into a spaceflight domain, allowing optimization of human-computer interaction as future operational tools are developed.
The growing demands for electricity and the increase in extreme weather conditions are putting unprecedented pressure on our electrical grids. Oftentimes, this pressure leads to electrical components failures which might ignite wildfires. This work develops a novel model to balance the reliability of power networks operations and risks of wildfires ignition by optimizing the operational schedule of power transmission networks considering time-varying risk measures that consider exogenous and operational factors. Energy storage systems are considered to deliver power during peak wildfire hours and enable temporal load shifting. The problem is formulated as a mixed-integer linear program that maximizes a weighted sum of the served power demand and the reduction in grid-induced wildfires risk. The results demonstrate the ability of the model to reduce wildfires risks significantly without considerable load shedding.
This document describes how a reactor developer applies for time in the Demonstration of Microreactor Experiments (DOME) facility. It also describes how applications are evaluated to develop the annual and outyear DOME schedule. The application process assumes that testing in DOME is funded by the applicant, and may be superseded by government-funded projects to accommodate government priorities.
The increasing demand for computational resources, particularly in High-Performance Computing environments, necessitates to rethink how we handle job scheduling strategies. This work addresses the challenge of managing concurrent jobs with differing priorities on overloaded parallel systems, where strict QoS constraints are often difficult for users to define. Our solution relies on a qualitative description of priorities and pulls from two key approaches: the Easy-BF algorithm and the Conservative Backfilling algorithms. This solution improves the response time for high-priority jobs by 50% without affecting the overall system utilization. We show its applicability in several critical scenarios such as High-Performance Computing (HPC) resource management and in-situ computing.
The global climate crisis is expected to reshape the energy generation landscape in the coming decades. Increasing integration of non-dispatchable renewable energy resources into energy infrastructures and markets creates uncertainty as well as new opportunities for flexible energy systems. To conduct proper economic evaluation of flexible energy systems, such as integrated energy systems (IES), advancements in modelling of market interactions, such as bidding, is crucial. This work presents a shortcut algorithm which uses two mixed integer linear programs to compute dispatch schedules (e.g., hourly power production targets) that are constrained by the resource's bid information and characteristics (e.g., minimum up and down times) based on historical locational marginal price (LMP) data. The proposed algorithm is approximately 100 times faster and uses orders of magnitude less data than a full production cost model (PCM). We find the shortcut simulator recapitulates generator dispatch signals for the Prescient PCM with approximately 4% error for the RTS-GMLC test system.
To accelerate adoption of non-residential charging for electric vehicles, sites must maximize utilization of existing electrical infrastructure. In this study we model electric vehicle charging at a workplace using real charging data and evaluate the lifetime of the site’s transformer as the number of charging stations is incrementally increased. We implement and compare a range of control schemes for workplace charging including minimizing the peak load, capping the total load, minimizing bills under different rate structures with time-of-use energy costs and demand charges, and directly minimizing the transformer’s aging. These are compared by the number of vehicles they allow the transformer to support, the transformer’s health, and the operator’s electricity bill. We draw a connection between minimizing the peak load and improving the transformer’s health. We observe that minimizing the electricity bill is the best scheme by both criteria when the bill includes a demand charge; in our experiment it allowed the infrastructure to support over 67% more cars than under uncontrolled charging. To protect the transformer we recommend that demand charges or capacity management be applied to parking lots of charging electric vehicles with high infrastructure utilization, and operators schedule charging to minimize their electricity bills.
Uncertainties arising from complicated natural and market environments pose great challenges for the efficient operation of cascaded hydroelectric systems. To overcome these challenges, this paper studies the day-ahead scheduling of cascaded hydroelectric systems in a restructured electricity market with the presence of uncertainties in electricity price and natural water inflow. To properly model the uncertainty, we consider the unique characteristics of these two types of uncertainties and capture them via the uncertainty set and stochastic scenarios, respectively. Further, a hybrid robust-stochastic optimization model is developed to simultaneously hedge against these two types of uncertainties, which is formulated as a large-scale non-convex optimization problem with mixed integer recourse. After introducing linearization of nonlinear terms, a tailored hybrid decomposition scheme combining Lagrangian relaxation and Dantzig-Wolfe decomposition is adopted to achieve efficient computation of the proposed model. Two real-world cases are conducted to demonstrate the capability and characteristics of the proposed model and algorithms.
This paper develops a novel continuous-time look-ahead optimization model for co-optimizing balancing energy and flexible ramp products in real-time power systems operation. In addition, a continuous-time day-ahead operation model is developed to commit and schedule an adequate subset of generating units for providing balancing energy and ramping requirements in real-time operation. The up and down flexible ramp products are defined as continuous-time decision trajectories that continuously supply the real-time up and down ramping requirements of the system. The deliverability of flexible ramp products is secured through reserving the respective power requirements in generation capacity constraints of generating units. A function space solution method is proposed to reduce the dimensionality of day-ahead and real-time models through projecting them into finite-dimensional function spaces spanned by Bernstein polynomials, where the real-time operation decisions are modeled with a higher accuracy level than day-ahead decisions. Simulations are conducted on the IEEE-RTS system using CAISO load data, and the numerical results showcase the effectiveness of the proposed model in supplying the energy and flexible ramp requirements and avoiding ramping scarcity in the system, while reducing the operation costs.
We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.
Given the anticipated increase in the amount of scientific data, it is widely accepted that primarily disk based storage will become prohibitively expensive. Tape based storage, on the other hand, provides a viable and affordable solution for the ever increasing demand for storage space. Coupled with a disk caching layer that temporarily holds a small fraction of the total data volume to allow for low latency access, it turns tape based systems into active archival storage (write once, read many) that imposes additional demands on data flow optimization compared to traditional backup setups (write once, read never). In order to preserve the lifetime of tapes and minimize the inherently higher access latency, different tape usage strategies are being evaluated. As an important disk storage system for scientific data that transparently handles tape access, dCache is making efforts to evaluate its recall optimization potential and is introducing a proof-of-concept, high-level stage request scheduling component within its SRM implementation.
The CMS experiment started to utilize Graphics Processing Units (GPU) to accelerate the online reconstruction and event selection running on its High Level Trigger (HLT) farm in the 2022 data taking period. The projections of the HLT farm to the High-Luminosity LHC foresee a significant use of compute accelerators in the LHC Run 4 and onwards in order to keep the cost, size, and power budget of the farm under control. This direction of leveraging compute accelerators has synergies with the increasing use of HPC resources in HEP computing, as HPC machines are employing more and more compute accelerators that are predominantly GPUs today. In this work we review the features developed for the CMS data processing framework, CMSSW, to support the effective utilization of both compute accelerators and many-core CPUs within a highly concurrent task-based framework. We measure the impact of various design choices for the scheduling of heterogeneous algorithms on the event processing throughput, using the Run-3 HLT application as a realistic use case.
The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024
With the increased occurrence of various major extreme weather events, power outages and prompt power system restorations have recently drawn more attention to the resilience and recovery of power systems. From the perspective of a more resilient power delivery at the distribution grid, system restoration using network topology reconfiguration together with optimal scheduling of distributed energy resources are adopted in this paper. The proposed optimization model aims at minimizing the total load shedding cost and other operational costs, in which linearized topological constraints borrowed from graph theory and linearized DistFlow models are respectively used to maintain the radial network topology and power flow balance after system contingencies. To demonstrate the applicability of the proposed strategy, a real-world case study of a networked three-microgrid system in Adjuntas, Puerto Rico, is used with the consideration of different independent/interconnected microgrid scenarios, contingencies, and fairness settings. Furthermore, hardware-in-the-loop testing is conducted for the same three-microgrid network, where the closely matched results with the simulated ones have validated the effectiveness of the proposed restoration strategy, which is now ready to move one step forward towards field deployment. Finally, to test the proposed restoration strategy in a larger networked system, the modified IEEE-33 bus test distribution system is considered, and the results show a more resilient power delivery for critical loads under three and four line outages.
The conventionally independent power, water, and heating networks are becoming more tightly connected, which motivates their joint optimal energy scheduling to improve the overall efficiency of an integrated energy system. However, such a joint optimization is known as a challenging problem with complex network constraints and couplings of electric, hydraulic, and thermal models that are nonlinear and nonconvex. We formulate an optimal power-water-heat flow (OPWHF) problem and develop a computationally efficient heuristic to solve it. The proposed heuristic decomposes OPWHF into subproblems, which are iteratively solved via convex relaxation and convex-concave procedure. Simulation results validate that the proposed framework can improve operational flexibility and social welfare of the integrated system, wherein the water and heating networks respond as virtual energy storage to time-varying energy prices and solar photovoltaic generation. Moreover, we perform sensitivity analysis to compare two modes of heating network control: by flow rate and by temperature. Our results reveal that the latter is more effective for heating networks with a wider space of pipeline parameters.