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.
Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.
Consideration is given to planning and scheduling operations concepts from an end-to-end perspective, through both mission operations and institutional support functions. An operations concept is proposed which is based on a flexible request language used to state resource requirements and mission constraints to a scheduling system. The language has the potential to evolve into an international standard for exchanging service request information on international space networks. The key benefit of the flexible scheduling request concept is the shift of a significant conflict resolution effort from humans to computers, reducing the time for generating a week's worth of schedules to hours instead of days.
This paper describes NASA's new spacecraft acquisition system provided by the Tracking and Data Relay Satellite System (TDRSS). Four satellites in geostationary orbit and a ground terminal will provide complete tracking, telemetry, and command service for all of NASA's orbital satellites below a 12,000 km altitude. Western Union will lease the system, operate the ground terminal and provide operational satellite control. NASA's network control center will be the focal point for scheduling user services and controlling the interface between TDRSS and the NASA communications network, project control centers, and data processing. TDRSS single access user spacecraft data systems will be designed for time shared data relay support, and reimbursement policy and rate structure for non-NASA users are being developed.
Abstract Modern data mining techniques using machine learning (ML) and deep learning (DL) algorithms have been shown to excel in the regression-based task of materials property prediction using various materials representations. In an attempt to improve the predictive performance of the deep neural network model, researchers have tried to add more layers as well as develop new architectural components to create sophisticated and deep neural network models that can aid in the training process and improve the predictive ability of the final model. However, usually, these modifications require a lot of computational resources, thereby further increasing the already large model training time, which is often not feasible, thereby limiting usage for most researchers. In this paper, we study and propose a deep neural network framework for regression-based problems comprising of fully connected layers that can work with any numerical vector-based materials representations as model input. We present a novel deep regression neural network, iBRNet, with branched skip connections and multiple schedulers, which can reduce the number of parameters used to construct the model, improve the accuracy, and decrease the training time of the predictive model. We perform the model training using composition-based numerical vectors representing the elemental fractions of the respective materials and compare their performance against other traditional ML and several known DL architectures. Using multiple datasets with varying data sizes for training and testing, We show that the proposed iBRNet models outperform the state-of-the-art ML and DL models for all data sizes. We also show that the branched structure and usage of multiple schedulers lead to fewer parameters and faster model training time with better convergence than other neural networks. Scientific contribution: The combination of multiple callback functions in deep neural networks minimizes training time and maximizes accuracy in a controlled computational environment with parametric constraints for the task of materials property prediction.
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.
The next generation of missions in NASA's Human Space Flight program focuses on the development and deployment of highly complex systems (e.g., Orion Multi-Purpose Crew Vehicle, Space Launch System, 21st Century Ground System) that will enable astronauts to venture beyond low Earth orbit and explore the moon, near-Earth asteroids, and beyond. Architecting these highly complex system-of-systems requires formal systems engineering techniques for managing the evolution of the technical features in the information exchange domain (e.g., data exchanges, communication networks, ground software) and also, formal correlation of the technical architecture to stakeholders' programmatic concerns (e.g., budget, schedule, risk) and design development (e.g., assumptions, constraints, trades, tracking of unknowns). This paper will describe how the authors have applied System Modeling Language (SysML) to implement model-based systems engineering for managing the description of the End-to-End Information System (EEIS) architecture and associated development activities and ultimately enables stakeholders to understand, reason, and answer questions about the EEIS under design for proposed lunar Exploration Missions 1 and 2 (EM-1 and EM-2).
Polynomial optimization techniques for activity scheduling (optimization based prototype scheduler) are presented in the form of the viewgraphs. The following subject areas are covered: agenda; need and viability of polynomial time techniques for SNC (Space Network Control); an intrinsic characteristic of SN scheduling problem; expected characteristics of the schedule; optimization based scheduling approach; single resource algorithms; decomposition of multiple resource problems; prototype capabilities, characteristics, and test results; computational characteristics; some features of prototyped algorithms; and some related GSFC references.
In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.
An example system includes an aggregator configured to receive a service collaboration request and iteratively determine, based on minimum and maximum power values for DERs under its management, an optimized operation schedule. The aggregator may also be configured to iteratively determine, based on the optimized operation schedule, an estimated flexibility range for devices under its management and output an indication thereof. The system may also include a power management unit (PMU) configured to iteratively receive the indication and determine, based on a network model that includes the estimated flexibility range, a reconfiguration plan and an overall optimized operation schedule for the network. The PMU may also be configured to iteratively cause reconfiguration of the network based on the plan. The PMU and aggregator may also be configured to iteratively, at a fast timescale, cause energy resources under their management to modify operation based on the overall optimized operation schedule.
Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.
Ensuring safe separation between aircraft is a critical challenge in air traffic management, particularly in urban air mobility (UAM) environments where high traffic density and low altitudes require precise control. In these environments, conflicts often arise at the intersections of flight corridors, posing significant risks. We propose a tactical separation approach leveraging shared scheduling protocols, originally designed for Ethernet networks and operating systems, to coordinate access to these intersections. Using a decentralized Markov decision process framework, the proposed approach enables aircraft to autonomously adjust their speed and timing as they navigate these critical areas, maintaining safe separation without a central controller. We evaluate the effectiveness of this approach in simulated UAM scenarios, demonstrating its ability to reduce separation violations to zero while acknowledging trade-offs in flight times as traffic density increases. Additionally, we explore the impact of non-compliant aircraft, showing that while shared scheduling protocols can no longer guarantee safe separation, they still provide significant improvements over systems without scheduling protocols.
Ensuring safe separation between aircraft is a critical challenge in air traffic management, particularly in urban air mobility (UAM) environments where high traffic density and low altitudes require precise control. In these environments, conflicts often arise at the intersections of flight corridors, posing significant risks. We propose a tactical separation approach leveraging shared scheduling protocols, originally designed for Ethernet networks and operating systems, to coordinate access to these intersections. Using a decentralized Markov decision process framework, the proposed approach enables aircraft to autonomously adjust their speed and timing as they navigate these critical areas, maintaining safe separation without a central controller. We evaluate the effectiveness of this approach in simulated UAM scenarios, demonstrating its ability to reduce separation violations to zero while acknowledging trade-offs in flight times as traffic density increases. Additionally, we explore the impact of non-compliant aircraft, showing that while shared scheduling protocols can no longer guarantee safe separation, they still provide significant improvements over systems without scheduling protocols.
Active distribution networks are being challenged by frequent and rapid voltage violations due to renewable energy integration. Conventional model-based voltage control methods rely on accurate parameters of the distribution networks, which are difficult to achieve in practice. This paper proposes a novel physical-model-free two-timescale voltage control framework for active distribution systems. To achieve fast control of PV inverters, the whole network is first partitioned into several subnetworks using voltage-reactive power sensitivity. Then, the scheduling of PV inverters in the multiple sub-networks is formulated as Markov games and solved by a multi-agent soft actor-critic (MASAC) algorithm, where each subnetwork is modeled as an intelligent agent. All agents are trained in a centralized manner to learn a coordinated strategy while being executed based on only local information for fast response. For the slower time-scale control, OLTCs and switched capacitors are coordinated by a single agent-based SAC algorithm using the global information with considering control behaviors of the inverters. Particularly, the two-level agents are trained concurrently with information exchange according to the reward signal calculated from the data-driven surrogate model. Comparative tests with different benchmark methods on IEEE 33-and 123-bus systems and 342-node low voltage distribution system demonstrate that the proposed method can effectively mitigate the fast voltage violations and achieve systematical coordination of different voltage regulation assets without the knowledge of accurate system model.
Affordable public transit services are crucial for communities since they enable residents to access employment, education, and other services. Unfortunately, transit services that provide wide coverage tend to suffer from relatively low utilization, which results in high fuel usage per passenger per mile, leading to high operating costs and environmental impact. Electric vehicles (EVs) can reduce energy costs and environmental impact, but most public transit agencies have to employ them in combination with conventional, internal-combustion engine vehicles due to the high upfront costs of EVs. To make the best use of such a mixed fleet of vehicles, transit agencies need to optimize route assignments and charging schedules, which presents a challenging problem for large transit networks. We introduce a novel problem formulation to minimize fuel and electricity use by assigning vehicles to transit trips and scheduling them for charging, while serving an existing fixed-route transit schedule. We present an integer program for optimal assignment and scheduling, and we propose polynomial-time heuristic and meta-heuristic algorithms for larger networks. We evaluate our algorithms on the public transit service of Chattanooga, TN using operational data collected from transit vehicles. Our results show that the proposed algorithms are scalable and can reduce energy use and, hence, environmental impact and operational costs. For Chattanooga, the proposed algorithms can save $145,635 in energy costs and 576.7 metric tons of CO 2 emission annually.
Routing in Delay-/Disruption-Tolerant Networking (DTN) requires specific solutions as link impairments prevent the use of ordinary Internet algorithms, based on a timely dissemination of network topology information. Among DTN routing algorithms there is a dichotomy between opportunistic and deterministic (scheduled) solutions. The former are numerous and apply to terrestrial environments; CGR is the most widely supported algorithm designed for scheduled connectivity, and it is usually applied to space networks. However, in an attempt to provide a unified approach, an opportunistic variant of CGR, Opportunistic CGR (OCGR) has been recently proposed by some of the authors. Performance evaluations are normally carried out for opportunistic solutions by means of simulators, such as The ONE considered in this paper. CGR by contrast is more often studied by means of small testbeds. As the simulation approach could be complementary for CGR, and essential for OCGR, the authors have recently ported both of them into The ONE, by developing and releasing as free software a specific additional package. The aim of this paper is to show the rationale of this choice and discuss the many challenges that needed to be tackled to achieve this primary goal.
Building energy simulations often rely on abstract assumptions when it comes to natural ventilation, such as ‘windows always open [or closed]’ or ‘windows open when outdoor temperature is below a certain threshold.’ However, simulations based on these assumptions fail to fully exploit the cooling potential of natural ventilation, as its effectiveness can be enhanced or diminished by various factors, including the presence of thermal mass. This issue also extends to smart home controls, where determining the window schedule becomes challenging without information about the building's response to outdoor conditions. To address these issues, this study has developed an analytical model for window operation schedules that leverages the passive cooling from natural ventilation. The analytical model was validated against a Modelica simulation. A case study utilizing the BESTEST model of ANSI/ASHRAE Standard 140 underwent validation with EnergyPlus simulations, showing strong concordance. The algorithm provides window schedule recommendations adapted to various airflow rates, thermal masses, and climate variations. Notably, the case study demonstrated that proper window scheduling could reduce indoor temperature by up to 8 °C under the given simulation settings, thereby improving resilience and indicating potential energy savings. Furthermore, the paper explores the potential opportunities and challenges this approach presents, especially for building simulation and smart home applications.
The U.S. power sector has become increasingly reliant on gas pipeline networks to deliver fuel to natural gas power plants. In addition to supplying relatively low-cost fuel, gas networks offer generators flexibility in their operations through the ability to deliver fuel when needed by using gas storage facilities or linepack if the gas network is at an operating point below its design capacity. However, disruptions or stress events on the gas network - like those occurring in the Northeast and Texas in recent years - can result in limitations on gas availability to generators at times when generation is in short supply. Here we examine a period of stress that occurred in the winter of 2022 in the Western United States. Using data on the region's natural gas pipeline network and electric generators, we build an integrated gas and electric model that closely replicates the actual dispatch of the period. We then evaluate the implications of removing flexibility employed by the gas network operator, which during that period curtailed scheduled gas deliveries to other parties to increase deliveries to natural gas power plants, which requested more gas than initially forecasted. We find that without the flexibility supplied by the gas network operator, there would have been curtailment of gas generation due to gas offtake constraints, requiring the power system operator to redispatch relying on more expensive generation or to potentially shed load. A sensitivity exploring a wind drought further exacerbates the strain, illustrating the potential challenge of managing gas and grid interactions as systems move to higher shares of variable renewable electricity. Based on this example, we discuss potential coordination strategies between the two system operators to ensure that the power system can successfully utilize and rely on the flexibility offered by natural gas networks.
In the mid nineties, the Earth Observing System (EOS) will generate an estimated 10 terabytes of data per day. This enormous amount of data will require the use of sophisticated technologies from real time distributed Artificial Intelligence (AI) and data management. Without regard to the overall problems in distributed AI, efficient models were developed for doing query planning and/or scheduling in intelligent user interfaces that reside in a network environment. Before intelligent query/planning can be done, a model for real time AI planning and/or scheduling must be developed. As Connectionist Models (CM) have shown promise in increasing run times, a connectionist approach to AI planning and/or scheduling is proposed. The solution involves merging a CM rule based system to a general spreading activation model for the generation and selection of plans. The system was implemented in the Rochester Connectionist Simulator and runs on a Sun 3/260.