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.
A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.
This paper presents the development of methods and tools that are being designed to optimize plant operations (e.g., maintenance/replacement schedules and optimal maintenance postures for plant components) in a manner that is more cost effective than current approaches and makes better use of available component health and cost data. These methods include both data- and model-based optimization methods. Model-based optimization methods directly include reliability and cost models to determine an optimal plant operational strategy. We consider gradient-based and evolutionary (based on genetic algorithms) optimization methods. The second class of methods target more specific use cases (e.g., project schedule optimization) and are not based on reliability models directly, but they require specific component reliability and cost data. This class of methods is based on variants of the knapsack problem with an aim to determine an optimal project schedule that maximizes the overall NPV. This paper also presents multi-objective methods designed to identify an optimal maintenance posture based on a Pareto frontier analysis. Rather than dictating the “right” tradeoff (i.e., identify the absolute best posture), we show how it is possible to perform a trade space exploration approach (i.e., identify value and costs of several postures and let the analysis account for desired value and cost metrics). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space. For all these methods we present detailed applicative examples that show their validity from a decision-making perspective.
With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.
With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.
The NASA roadmap for 2020 and beyond includes several key technologies which will have a game-changing impact on planetary exploration. The first of these is High Performance Spaceflight Computing (HPSC), which will provide orders of magnitude increases in processing power for next-generation rovers and orbiters (Doyle et al. 2013). The second is Delay Tolerant Networking, which overlays the Deep Space Network, providing internet-like abstractions and store-forward to route data through intermittent delays in connectivity. The third is a trend toward small, co-dependent robots included in flagship missions (MarCO, PUFFER, and Mars Heli). Taken together, these imply an increasing amount of communication and computing heterogeneity on Mars in coming decades. Motivated by these technological trends, we study the concept of Mars on-site shared analysis, information, and communication (MOSAIC) for Mars exploration. The key algorithmic problem associated with MOSAIC networks is simultaneous scheduling of computation, communication, and caching of data, which we illustrate using the three scenarios. We present models, preliminary solutions, and simulation results for two scenarios, showing how mission efficiency relates to communication bandwidth, processing power, geography of the environment, and optimal scheduling of computation, communication, and data caching. The third scenario illustrates future directions of this work.
On October 28, 2009 the Ares I-X flight test rocket launched from Kennedy Space Center and flew its suborbital trajectory as designed. The mission was successfully completed as data from the test, and associated development activities were analyzed, transferred to stakeholders, and well documented. Positive lessons learned from Ares I-X were that the application of lean thinking principles and kaizen practices are effective in streamlining development activities. Ares I-X, like other historical rocket development projects, was hampered by technical, cost, and schedule challenges and if not addressed boldly could have resulted in cancellation of the test. The mission management team conducted nine major meetings, referred to as lean events, across its elements to assess plans, procedures, processes, requirements, controls, culture, organization, use of resources, and anything that could be changed to optimize schedule or reduce risk. The preeminent aspect of the lean events was the focus on value added activities and the removal or at least reduction in non-value activities. Trained Lean Six Sigma facilitators assisted the Ares I-X developers in conducting the lean events. They indirectly helped formulate the mission s own unique methodology for assessing schedule. A core team was selected to lead the events and report to the mission manager. Each activity leveraged specialized participants to analyze the subject matter and its related processes and then recommended alternatives and solutions. Stakeholders were the event champions. They empowered and encouraged the team to succeed. The keys to success were thorough preparation, honest dialog, small groups, adherence to the Ares I-X ground rules, and accountability through disciplined reporting and tracking of actions. This lean event formula was game-changing as demonstrated by the success of Ares I-X. It is highly recommended as a management tool to help develop other complex systems efficiently. The key benefits for Ares I-X were obtaining unambiguous schedule margin, defining enabling options for risk reduction, and most importantly a stronger more unified team.
On October 28, 2009 the Ares I-X flight test rocket launched from Kennedy Space Center and flew its suborbital trajectory as designed. The mission was successfully completed as data from the test, and associated development activities were analyzed, transferred to stakeholders, and well documented. A positive lesson learned from Ares I-X was that the application of lean thinking principles and kaizen practices was very effective in streamlining development activities. Ares I-X, like other historical rocket development projects, was hampered by technical, cost, and schedule challenges and if not addressed boldly could have resulted in cancellation of the test. The mission management team conducted nine major meetings, referred to as lean events, across its elements to assess plans, procedures, processes, requirements, controls, culture, organization, use of resources, and anything that could be changed to optimize schedule or reduce risk. The preeminent aspect of the lean events was the focus on value added activities and the removal or at least reduction in non-value added activities. Trained Lean Six Sigma facilitators assisted the Ares I-X developers in conducting the lean events. They indirectly helped formulate the mission s own unique methodology for assessing schedule. A core team was selected to lead the events and report to the mission manager. Each activity leveraged specialized participants to analyze the subject matter and its related processes and then recommended alternatives and solutions. Stakeholders were the event champions. They empowered and encouraged the team to succeed. The keys to success were thorough preparation, honest dialog, small groups, adherence to the Ares I-X ground rules, and accountability through disciplined reporting and tracking of actions. This lean event formula was game-changing as demonstrated by Ares I-X. It is highly recommended as a management tool to help develop other complex systems efficiently. The key benefits for Ares I-X were obtaining unambiguous schedule margin, defining enabling options for risk reduction, and most importantly a stronger more unified team.
This paper presents a framework for modeling, scheduling, and controlling residential thermostatically controlled loads (TCLs) to provide multiple grid services, such as energy shifting, peak load reduction, and ancillary services. A modeling method is proposed to characterize the aggregate flexibility from heterogeneous TCLs using a battery-equivalent model. Based on the flexibility model, a multi-period optimal scheduling formulation is developed to best utilize the flexibility from building loads and maximize total benefits from stacked value streams. An algorithm is proposed to control individual TCLs to follow the desired power consumption in real-time. The proposed methods are illustrated and validated through simulations.
Abstract A coordinated set point automatic adjustment with correction enabled (C‐SPAACE) framework that uses 5G communication for real‐time control coordination between inverter‐based resources (IBR) in microgrids is proposed. Utilising slicing capability, 5G offers low‐latency communication to C‐SPAACE under normal conditions. However, given the multitude of power grid use cases, a certain 5G slice for C‐SPAACE may have access only to limited radio spectrum resources, which if not managed well, greatly undermines the communication needs of C‐SPAACE framework. Thus, optimally scheduling the available spectrum resources among IBRs in a sliced 5G network‐based C‐SPAACE framework becomes a critical problem. To address this issue, the authors utilise a novel age of information (AoI) metric and designs an AoI‐based 5G scheduler to provide low‐latency communication to C‐SPAACE. Following this, a co‐simulation environment is designed using PSCAD/EMTDC and Python to simulate a microgrid supported by 5G communication. Time‐domain simulation case studies are performed using the proposed co‐simulation environment to evaluate the performance of C‐SPAACE using 5G with both AoI‐based and other baseline (non‐AoI) schedulers.
We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.
Incorporating battery electric buses into bus fleets faces three primary challenges: a BEB’s extended refuel time, the cost of charging, both by the consumer and the power provider, and large compute demands for planning methods. When BEBs charge, the additional demands on the grid may exceed hardware limitations, so power providers divide a consumer’s energy needs into separate meters even though doing so is expensive for both power providers and consumers. Prior work has developed a number of strategies for computing charge schedules for bus fleets; however, prior work has not worked to reduce costs by aggregating meters. Additionally, because many works use mixed integer linear programs, their compute needs make planning for commercial-sized bus fleets intractable. This work presents a multi-program approach to computing charge plans for electric bus fleets. The proposed method solves a series of subproblems where the solution to the charge problem becomes more refined with each problem, moving closer to the optimal schedule. The results demonstrate how runtimes are reduced by using intermediate subproblems to refine the bus charge solution so that the proposed method can be applied to large bus fleets of 100+ buses. Not only will we demonstrate that runtimes scale linearly with the number of buses but we will also show how the proposed method scales to large bus fleets of over 100 buses while managing the monthly cost of energy.
Manufacturing industries continue to face challenges in reducing waste, as upstream strategies such as source reduction and product redesign require a deeper understanding of processes compared to conventional recycling methods. Recent advancements in artificial intelligence (AI) and machine learning (ML) have opened new opportunities to integrate modern computational techniques with traditional waste minimization strategies. This paper explores AI-enabled approaches for product redesign, source reduction, and recycling that can significantly reduce waste generation while improving efficiency and sustainability. AI-driven material substitution and lightweighting in product design enable discovery of novel materials with optimized properties, reducing waste without compromising performance. Reinforcement learning models optimize process parameters, raw material specifications, and machine sequencing to minimize production losses, while Industrial Internet of Things (IIoT) systems paired with AI analytics enhance real-time waste tracking, predictive maintenance, and quality inspection. Furthermore, AI-based demand forecasting and production planning reduce overproduction and excess inventory, as demonstrated in industrial applications. In recycling, ML-powered pattern recognition and robotic sorting technologies achieve higher accuracy in waste segregation, directly improving recycling efficiency. Complementary solutions such as smart bins and AI-enabled waste pickup scheduling optimize collection logistics, reducing both costs and emissions. Although implementation requires upfront investment in infrastructure and training, the long-term benefits include higher material efficiency, reduced waste, improved product quality, and stronger sustainability outcomes across the supply chain. By leveraging AI-enabled systems, manufacturers can align waste minimization efforts with circular economy principles, creating scalable solutions for both industry and society.
Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.
We present optimal algorithms for nadir (instrument pointing straight down) observation scheduling for spacecraft with fixed orbits.
This paper studies the performance of a model predictive control (MPC) algorithm in a home energy management system (HEMS) as the set of controllable resources varies and under both a constant and a time-of-use (TOU) electricity price structure. The set of controllable resources includes residentially-owned photovoltaic (PV) panels, a home battery system (HBS), an electric vehicle (EV), and a home heating, ventilation, and air conditioning (HVAC) system. The HEMS optimally schedules the set of controllable resources given user preferences such as indoor thermal comfort and electricity cost sensitivity. The home energy management system is built on a chance constrained, MPC-based algorithm, where the chance constraint ensures the indoor thermal comfort is satisfied with a high probability given uncertainty in the outdoor temperature and solar irradiance forecasts. Simulation results for varying sets of controllable resources under two different electricity price structures demonstrate the variation in the HEMS control with respect to HBS operation, electricity cost, and grid power usage.
Continued integration of distributed energy resources (DERs) into the grid, such as solar PVs, at a large-scale, contributes into the famous Duck Curve. New DER management algorithms are therefore deemed necessary to alleviate rapid variations within net load profiles of distribution systems. Herein this paper proposes a process to determine the optimal energy storage schedules for leveling the distribution circuit feederhead net load. A series of sensitivity analyses shows how the proposed method can be used to determine the optimal energy storage schedules with different capacities, state of charge requirements, and net load ramp rate limitations.
Abstract A principal challenge facing the control of floating offshore wind turbines (FOWTs) is the problem of instability, or “negative damping,” when using blade pitch feedback to control generator speed. This closed‐loop instability can be attributed to non‐minimum phase zeros in the transfer function from blade pitch to generator speed. Standard approaches to improving stability and performance include robust tuning of control gains and introducing multiple feedback loops to respond to platform motion. Combining these approaches is nontrivial because multiple control loops complicate the impact of coupling in the system dynamics. The single‐loop approach to analyzing stability robustness neglects inter‐loop coupling, while a simplistic multi‐loop approach is highly sensitive to dimensional scaling and overestimates the robustness of the single‐loop controller. This work proposes a sensitivity representation that separates some of the natural FOWT dynamic coupling into a parallel feedback loop in the sensitivity function loop to address both of these concerns. The modified robustness measure is used with a simplified linear FOWT model to optimize scheduled multi‐loop control parameters in an automated tuning procedure. This controller is implemented for the 10‐MW Ultraflexible Smart FLoating Offshore Wind Turbine (USFLOWT) and compared against conventional single‐ and multi‐loop controllers tuned using frequency‐domain analysis and high‐fidelity OpenFAST simulations. The multi‐loop robust controller shows the highest overall performance in generator speed regulation and tower load reduction, though consideration of power quality, actuator usage, and other structural loading leads to additional trade‐offs.
The production tax credit (PTC) promotes wind energy development, reduces power generation costs, and can affect merchants’ joint economic dispatch, particularly for electricity merchants with both energy storage and wind farms. Two common PTC policies are studied – in the first policy, a wind farm receives PTC by selling wind generation to the market and its storage can be used to store energy from the wind generation and energy purchased from the grid but the energy released from the storage cannot receive PTC; in the second policy, the energy released from the storage can also qualify for PTC but purchasing energy from the grid is not allowed. We then employ dynamic programming to study merchants' optimal decision-making while considering PTC and the physical characteristics of storage systems. We analytically show that the state of charge (SOC) range can be segmented into different regions by SOC reference points under two PTC policies. The merchant's optimal action can be conveniently and uniquely determined based on the region within which the current SOC falls. Moreover, this study illustrates that PTC could substantially alter the optimal scheduling policy structures by affecting reference points and their relationships. The results showed that the frequencies for charging and discharging storage decisions decreased with an increase in PTC subsidy. Last, we confirm that, although the first policy allows merchants to buy electricity from the market, the second policy can bring more profits when the PTC is large at the current PTC rates. Furthermore, the findings can provide multistage decision-making guidance to electricity merchants in the wholesale power market.