Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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.

At least 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Calculation of Flight Deck Interval Management Assigned Spacing Goals Subject to Multiple Scheduling Constraints

The Federal Aviation Administration's Next Generation Air Transportation System will combine advanced air traffic management technologies, performance-based procedures, and state-of-the-art avionics to maintain efficient operations throughout the entire arrival phase of flight. Flight deck Interval Management (FIM) operations are expected to use sophisticated airborne spacing capabilities to meet precise in-trail spacing from top-of-descent to touchdown. Recent human-in-the-loop simulations by the National Aeronautics and Space Administration have found that selection of the assigned spacing goal using the runway schedule can lead to premature interruptions of the FIM operation during periods of high traffic demand. This study compares three methods for calculating the assigned spacing goal for a FIM operation that is also subject to time-based metering constraints. The particular paradigms investigated include: one based upon the desired runway spacing interval, one based upon the desired meter fix spacing interval, and a composite method that combines both intervals. These three paradigms are evaluated for the primary arrival procedures to Phoenix Sky Harbor International Airport using the entire set of Rapid Update Cycle wind forecasts from 2011. For typical meter fix and runway spacing intervals, the runway- and meter fix-based paradigms exhibit moderate FIM interruption rates due to their inability to consider multiple metering constraints. The addition of larger separation buffers decreases the FIM interruption rate but also significantly reduces the achievable runway throughput. The composite paradigm causes no FIM interruptions, and maintains higher runway throughput more often than the other paradigms. A key implication of the results with respect to time-based metering is that FIM operations using a single assigned spacing goal will not allow reduction of the arrival schedule's excess spacing buffer. Alternative solutions for conducting the FIM operation in a manner more compatible with the arrival schedule are discussed in detail.

ATD-1↗
NASA NTRS2013

Experiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling

Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growing availability of multi-core processors in end user workstations, and even laptops, has raised the question of the extent to which such hardware can be used to speed up evolutionary algorithms. In this paper we report on early experiments in parallelizing a Generalized Differential Evolution (GDE) algorithm for scheduling long-range activities on NASA's Deep Space Network. Initial results show that significant speedups can be achieved, but that performance does not necessarily improve as more cores are utilized. We describe our preliminary results and some initial suggestions from parallelizing the GDE algorithm. Directions for future work are outlined.

scheduling↗
NASA NTRS2014

Precision Arrival Scheduling for Tactical Reconfiguration

This research adapts the concept of precision arrival scheduling to accommodate reconfiguration operations between two sets of fixed arrival routes modeled for Chicago O'Hare International Airport (ORD). Integrated fixed path routing from en-route to runways was modeled for ORD's top two peak traffic configurations, as well as transition routing between the two configurations. A first-come-first-served multi-point scheduler was adapted to the reconfiguration problem by prioritizing the rescheduling of aircraft within the terminal airspace at the time of reconfiguration notification. Arrival rescheduling was then tested for a range of arrival rates and reconfiguration notification lead-times in fasttime simulation. Reconfigurations with lead-times as short as 10 minutes at a nominal static configuration arrival rate (~25 arrivals per quarter hour) could be accommodated with little impact to throughput. However, as lead-time shortened below 25 minutes, individual aircraft efficiency quickly degraded due to extra flight time at lower altitude and speed. In general, first-come-first-served arrival scheduling on fixed routing for this sample reconfiguration problem is promising if at least 10-15 minutes lead-time is given before the reconfiguration is in effect.

airport reconfiguration↗
NASA NTRS2019

Alternatives for Scheduling Departures for Efficient Surface Metering in ATD-2: Exploration in a Human-in-the-Loop Simulation

A Human-in-the-Loop (HITL) simulation was conducted to explore whether Ramp Controllers at Charlotte Douglas International Airport (CLT) could both release departing aircraft at an advised time at the gate and also meet an advised time at the spot, where Air Traffic Control (ATC) takes control. Three conditions were compared: (1) Baseline, with no scheduling advisories, (2) instructions to meet advisory times at the gate only, and (3) instructions to meet advisory times at both the gate and the spot. Surprisingly, results showed increased compliance with advisories at the spot in the second condition. This was likely due to increased ramp congestion in the third condition as well as higher Ramp Controller workload and lower situation awareness. Instructing Ramp Controllers to meet scheduling times at the spots, in addition to the gates, is therefore not likely to improve surface scheduling predictability at CLT and may indeed worsen it.

airport surface scheduling↗
NASA NTRSDate not supplied

Capacity and Throughput of Urban Air Mobility Vertiports with a First-Come, First-Served Vertiport Scheduling Algorithm

In this paper, a first-come, first-served vertiport scheduling algorithm for Urban Air Mobility (UAM) was exercised to assess and compare the capacity and throughput of various vertiport configurations. The scheduler models each vertiport by the number of vertipads and parking spaces, and manages reservations on timelines for those vertiport resources, at a level of fidelity suitable for fast-time and system-level analyses of UAM concepts and other airspace studies. The paper defines the theoretical model that can be used to estimate the capacity of various vertiport configurations. The theoretical model provides an understanding of the conditions that can lead to either a parking space-limited or a vertipad-limited vertiport. Examples of potential throughput for some vertiport configurations are provided using both a queueing approach as well as a simulated UAM demand scenario. The study demonstrated that a first-come, first-served scheduling approach can have inefficiencies in the use of the vertiport resources. The inefficiencies can increase as the number of resources increases. Nonetheless, 80% or better peak throughput to capacity ratio was observed for most vertiport configurations.

UAM↗
NASA NTRS1997

Resource Scheduling for a Network of Communications Antennas

This paper describes tha Demand Access Network Scheduler (DANS) system for automatically scheduling and rescheduling resources for a network of communication antennas. DANS accepts a baseline schedule and supports rescheduling of antenna and subsystem resources to satisfy tracking goals in the event of changing track requests, equipment outages, and inclement weather.

Deep↗
NASA NTRS2021

Simulation Study for Interoperability of Urban Air Mobility Scheduling and Separation Services in Ideal Conditions

Provision of strategic scheduling and tactical separation services is vital to the safe and efficient operation of vehicles in the urban airspace. This paper describes the efforts made towards the integration of two such services in a simulation environment under ideal conditions and the subsequent studies done on evaluation of system performance. The scheduling and separation services are set up to complement each other to ensure safe separation between airborne aircraft. The utility of these services will become important as the level of traffic increases. This paper describes the simulation experiments conducted to identify cases where the system performance measured by the number of observed losses of separation degrades even with the scheduling and separation services active. From the results obtained, we identify conditions under which the required maneuvers increase and when we observe airborne conflicts even with separation service active. Results obtained will inform requirements for future advancements both in these services independently and in their joint operations.

Urban Air Mobility↗
NASA NTRSDate not supplied

Simulation Study for Interoperability of Urban Air Mobility Scheduling and Separation Services in Ideal Conditions

Provision of strategic scheduling and tactical separation services is vital to the safe and efficient operation of vehicles in the urban airspace. This paper describes the efforts made towards the integration of two such services in a simulation environment under ideal conditions and the subsequent studies done on evaluation of system performance. The scheduling and separation services are set up to complement each other to ensure safe separation between airborne aircraft. The utility of these services will become important as the level of traffic increases. This paper describes the simulation experiments conducted to identify cases where the system performance measured by the number of observed losses of separation degrades even with the scheduling and separation services active. From the results obtained, we identify conditions under which the required maneuvers increase and when we observe airborne conflicts even with separation service active. Results obtained will inform requirements for future advancements both in these services independently and in their joint operations.

Urban Air Mobility↗
NASA NTRSDate not supplied

Separation Assurance in Urban Air Mobility Systems Using Shared 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.

Separation Assurance↗
NASA NTRSDate not supplied

Separation Assurance in Urban Air Mobility Systems Using Shared 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.

system safety↗
DOE OSTI2023

Outage Forecast-Based Preventative Scheduling Model for Distribution System Resilience Enhancement: Preprint

Distribution system resilience enhancement is an important topic to ensure customers have access to the power supply during extreme events. In fact, certain weather-related extreme events can be predicted ahead of time. Therefore, it is important to investigate how to predict grid outages using extreme weather forecasts, and how outage predictions can be incorporated into distribution system resilience enhancement. In this paper, a preventative scheduling model for distribution systems is proposed. The model targets at allocating resources, especially mobile responsive resources such as mobile backup generators and mobile energy storage systems, to prepare for an extreme event in the day-ahead context. To achieve efficient resource allocation and scheduling, a machine learning-based outage prediction module is developed to predict vulnerable or risky segments of the distribution system based on historical operating records and extreme weather event forecasts. By integrating the outage prediction results into the scheduling model, optimal resource allocation can be derived to help distribution systems prepare for an upcoming event and improve resilience performance. A real distribution feeder in North Carolina, U.S. is used in the case study to validate the proposed approach.

distributed energy resources↗
DOE OSTI2023

Outage Forecast-Based Preventative Scheduling Model for Distribution System Resilience Enhancement

Distribution system resilience enhancement is an important topic to ensure customers have access to power supply during extreme events. In fact, certain weather-related extreme events can be predicted ahead of time. Therefore, it is important to investigate how to predict grid outages using extreme weather forecasts, and how outage predictions can be incorporated into distribution system resilience enhancement. In this paper, a preventative scheduling model for distribution systems is proposed. The model targets at allocating resources, especially mobile responsive resources such as mobile backup generators and mobile energy storage systems, to prepare for an extreme event in the day-ahead context. To achieve efficient resource allocation and scheduling, a machine learning-based outage prediction module is developed to predict vulnerable or risky segments of the distribution system based on historical operating records and extreme weather event forecast. By integrating the outage prediction results into the scheduling model, optimal resource allocation can be derived to help distribution systems prepare for an upcoming event and improve resilience performance. A real distribution feeder in North Carolina, U.S. is used in the case study to validate the proposed approach.

distributed energy resources↗
DOE OSTI2025

Energy Scheduling-based Operating Envelopes including a Distribution System Branch Screening Algorithm

This paper presents an energy scheduling-based formulation for computing operating envelopes including a distribution branch screening algorithm, termed DBS-ES. The contribution of the paper is two-fold: firstly, it presents an innovative methodology for calculating operating envelopes using energy scheduling (baseline), and secondly, it enhances this methodology by incorporating a custom distribution branch screening algorithm (DBS-ES). The custom algorithm leverages power system knowledge to reduce both model build time and total processing time while maintaining the same scheduling results as the baseline. The effectiveness of the proposed approach is demonstrated through experiments on the IEEE13, IEEE123, and EPRI Secondary test feeders. Results highlight a 24.5% decrease in model build time and an 8.17% decrease in total processing time when using DBS-ES compared to the baseline, specifically for the IEEE123 test feeder. Additionally, the paper briefly discusses the influence of utility-controlled storage on computing operating envelopes, noting a general incre

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

QoS-aware edge AI placement and scheduling with multiple implementations in FaaS-based edge computing

Resource constraints on the computing continuum require that we make smart decisions for serving AI-based services at the network edge. AI-based services typically have multiple implementations (e.g., image classification implementations include SqueezeNet, DenseNet, and others) with varying trade-offs (e.g., latency and accuracy). The question then is how should AI-based services be placed across Function-as-a-Service (FaaS) based edge computing systems in order to maximize total Quality-of-Service (QoS). To address this question, we propose a problem that jointly aims to solve (i) edge AI service placement and (ii) request scheduling. These are done across two time-scales (one for placement and one for scheduling). Here we first cast the problem as an integer linear program. We then decompose the problem into separate placement and scheduling subproblems and prove that both are NP-hard. We then propose a novel placement algorithm that places services while considering device-to-device communication across edge clouds to offload requests to one another. Our results show that the proposed placement algorithm is able to outperform a state-of-the-art placement algorithm for AI-based services, and other baseline heuristics, with regard to maximizing total QoS. Additionally, we present a federated learning-based framework, FLIES, to predict the future incoming service requests and their QoS requirements. Our results also show that our FLIES algorithm is able to outperform a standard decentralized learning baseline for predicting incoming requests and show comparable predictive performance when compared to centralized training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Control coordination in inverter‐based microgrids using AoI‐based 5G schedulers

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.

Choudhury, Biplav↗
DOE OSTI2020

Using OpenMP for HEP framework algorithm scheduling

The OpenMP standard is the primary mechanism used at high performance computing facilities to allow intra-process parallelization. In contrast, many HEP specific software packages (such as CMSSW, GaudiHive, and ROOT) make use of Intel’s Threading Building Blocks (TBB) library to accomplish the same goal. In these proceedings we will discuss our work to compare TBB and OpenMP when used for scheduling algorithms to be run by a HEP style data processing framework. This includes both scheduling of different interdependent algorithms to be run concurrently as well as scheduling concurrent work within one algorithm. As part of the discussion we present an overview of the OpenMP threading model. We also explain how we used OpenMP when creating a simplified HEP-like processing framework. Using that simplified framework, and a similar one written using TBB, we will present performance comparisons between TBB and different compiler versions of OpenMP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Leveraging Pre-Built Catalogs and Object-Level Scheduling to Eliminate I/O Bottlenecks in HPC Environments

Modern High-Performance Computing (HPC) environments face mounting challenges due to the shift from large to small file datasets, along with an increasing number of users and parallelized applications. As HPC systems rely on Parallel File Systems (PFS), such as Lustre for data processing, performance bottlenecks stemming from Object Storage Target (OST) contention have become a significant concern. Existing solutions, such as LADS with its object-level scheduling approach, fall short in large-scale HPC environments due to their inability to effectively address metadata I/O bottlenecks and the growing number of I/O processes. This study highlights the pressing need for a comprehensive solution that tackles both OST contention and metadata I/O challenges in diverse HPC workloads. To address these challenges, we propose SwiftLoad, an object-level I/O scheduling framework that leverages a metadata catalog to enhance the performance and efficiency of parallel HPC utilities. The adoption of the metadata catalog mitigates the metadata I/O bottlenecks that commonly occur in HPC utilities, a challenge that is particularly pronounced in object-level I/O scheduling. SwiftLoad addresses OST contention and the uneven distribution of I/O processes across different OSTs through mathematical modeling and incorporates a Loader Configuration Module to regulate the number of I/O processes. Evaluated with two representative utilities—data deduplication profiling and data augmentation—SwiftLoad achieved performance improvements of up to 5.63x and 11.0x, respectively, on a production supercomputer.

HPC↗
DOE OSTI2025

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗