Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “departure time”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Investigating the Causes and Consequences of Controlled Rest on the Flight Deck

INTRODUCTION: Long and irregular working hours can lead to fatigue in aviation operations. In some regions, a short nap taken on the flight deck (known as controlled rest) can be used as a countermeasure to unexpected in-flight sleepiness. We aimed to investigate the impact of taking controlled rest on self-reported sleepiness at top-of-descent. METHODS: Data from 120 long-haul (> 6 h flight duration), unaugmented flights were analyzed (n = 31 pilots). Pilots wore actigraphs and completed sleep logs before and during trips. At pre-flight and top-of-descent, pilots completed a Karolinska Sleepiness Scale (KSS). A mixed-effects model was used to assess the impact of controlled rest on KSS at top-of-descent. Sleep duration in the 48 hours prior to departure, timing of the flight (day vs. night), and pre-flight KSS scores were included as covariates. RESULTS: Due to missing data, complete data from 83 flights (n = 29 participants) were available in the analyses of the KSS. There were no differences by controlled rest status for KSS scores at top-of-descent (estimated marginal means ± SEM with controlled rest: 5.10 ± 0.22, without controlled rest: 5.37 ± 0.29; p = .45, η2p = 0.01). DISCUSSION: Our results suggest that there is no difference in self-reported sleepiness at top-of-descent on flights in which controlled rest was taken compared to flights without controlled rest. Further research is necessary to determine the impact of controlled rest on objective measures of performance at top-of-descent.

aviation↗
NASA NTRSDate not supplied

The Impact of Controlled Rest on Self-Reported Sleepiness at Top-of-Descent

INTRODUCTION: Long and irregular working hours can lead to fatigue in aviation operations. In some regions, a short nap taken on the flight deck (known as controlled rest) can be used as a countermeasure to unexpected in-flight sleepiness. We aimed to investigate the impact of taking controlled rest on self-reported sleepiness at top-of-descent. METHODS: Data from 120 long-haul (> 6 h flight duration), unaugmented flights were analyzed (n = 31 pilots). Pilots wore actigraphs and completed sleep logs before and during trips. At pre-flight and top-of-descent, pilots completed a Karolinska Sleepiness Scale (KSS). A mixed-effects model was used to assess the impact of controlled rest on KSS at top-of-descent. Sleep duration in the 48 hours prior to departure, timing of the flight (day vs. night), and pre-flight KSS scores were included as covariates. RESULTS: Due to missing data, complete data from 83 flights (n = 29 participants) were available in the analyses of the KSS. There were no differences by controlled rest status for KSS scores at top-of-descent (estimated marginal means ± SEM with controlled rest: 5.10 ± 0.22, without controlled rest: 5.37 ± 0.29; p = .45, η2p = 0.01). DISCUSSION: Our results suggest that there is no difference in self-reported sleepiness at top-of-descent on flights in which controlled rest was taken compared to flights without controlled rest. Further research is necessary to determine the impact of controlled rest on objective measures of performance at top-of-descent.

aviation↗
NASA NTRS1999

Departure Energies, Trip Times and Entry Speeds for Human Mars Missions

The study examines how the mission design variables departure energy, entry speed, and trip time vary for round-trip conjunction-class Mars missions. These three parameters must be balanced in order to produce a mission that is acceptable in terms of mass, cost, and risk. For the analysis, a simple, massless- planet trajectory program was employed. The premise of this work is that if the trans-Mars and trans-Earth injection stages are designed for the most stringent opportunity in the energy cycle, then there is extra energy capability in the "easier" opportunities which can be used to decrease the planetary entry speed, or shorten the trip time. Both of these effects are desirable for a human exploration program.

Munk, Michelle M.↗
NASA NTRS1999

Departure Energies, Trip Times and Entry Speeds for Human Mars Missions

The study examines how the mission design variables departure energy, entry speed, and trip time vary for round-trip conjunction-class Mars missions. These three parameters must be balanced in order to produce a mission that is acceptable in terms of mass, cost, and risk. For the analysis, a simple, massless-planet trajectory program was employed. The premise of this work is that if the trans-Mars and trans-Earth injection stages are designed for the most stringent opportunity in the energy cycle, then there is extra energy capability in the "easier" opportunities which can be used to decrease the planetary entry speed, or shorten the trip time. Both of these effects are desirable for a human exploration program.

Munk, Michelle M.↗
NASA NTRS1993

Algorithm Aligns Gyrocompass In Twisting And Swaying Vehicle

Algorithm proposed for use with strapdown inertial sensors synthesizes gyrocompass and repeatedly refines alignment of synthetic gyrocompass to maintain accuracy until time of departure. In original application, inertial sensors located in spacecraft twisting and swaying in wind on launching pad, and time of departure is time of launch. Also possible to devise terrestrial version of algorithm for use in aircraft, ground vehicle, or vessel. Algorithm includes local-level-navigator, coarse-alignment, and fine-alignment subalgorithms.

Reddy, Narotham S.↗
NASA NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗
NASA NTRS2003

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗
NASA NTRS2020

Investigating Effects of Controlled Flights through Fast-Time Simulation

Departure flights at major U.S. airports are often subject to Traffic Management Initiatives to mitigate congestion and delay due to demand-capacity imbalances. These controlled flights can lead to inefficiency and delay on the airport surface. The integrated arrival, departure, and surface traffic management capabilities developed by NASA’s Airspace Technology Demonstration 2 (ATD-2) sub-project provide enhanced operational efficiency and predictability of flight operations through data exchange and integration, surface metering, and automated coordination of release time of controlled flights for overhead stream insertion. This paper evaluates the impacts of controlled flights on airport performance and assesses the ATD-2 benefits of pushback hold advisories for both controlled and non-controlled flights using fast-time simulation for Charlotte Douglas International Airport.

controlled flight↗
NASA NTRS2003

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗
NASA NTRS2019

Modeling Deicing Operations in Departure Scheduling Using Fast Time Simulation

In winter snow conditions, aircraft need inspection for deicing service before takeoff. Deicing service is a procedure to remove frost, ice, slush, or snow from aircraft for safe operation. Deicing operations vary by airport in many ways. Some airports have designated deicing zones, whereas some use a closed runway or terminal area to perform the procedure. Nonetheless, deicing operations add extra workloads to controllers, and cause increased taxi traffic on the ground. NASA and Korea Aerospace Research Institute (KARI) have been collaborating to model deicing operations at Incheon International Airport (ICN). This paper describes the deicing model and the study of deicing operations in departure scheduling using fast time simulations. The deicing model uses a heuristic algorithm for deicing zone assignment. In the fast time simulations, the model uses probability distributions derived from actual operation data to model deicing request and deicing zone time. It is envisioned that such a deicing model can be useful in airport surface scheduling to provide decision support and improve traffic management performance in winter snow operations.

modeling and simulation↗
NASA NTRS2019

Modeling Deicing Operations in Departure Scheduling using Fast Time Simulation

In winter snow conditions, aircraft need inspection for deicing service before takeoff. Deicing service is a procedure to remove frost, ice, slush, or snow from aircraft for safe operation. Deicing operations vary by airport in many ways. Some airports have designated deicing zones, whereas some use a closed runway or terminal area to perform the procedure. Nonetheless, deicing operations add extra workloads to controllers, and cause increased taxi traffic on the ground. NASA and Korea Aerospace Research Institute (KARI) have been collaborating to model deicing operations at Incheon International Airport (ICN). This paper describes the deicing model and the study of deicing operations in departure scheduling using fast time simulations. The deicing model uses a heuristic algorithm for deicing zone assignment. In the fast time simulations, the model uses probability distributions derived from actual operation data to model deicing request and deicing zone time. It is envisioned that such a deicing model can be useful in airport surface scheduling to provide decision support and improve traffic management performance in winter snow operations.

surface operation↗
NASA NTRS2005

The Effects of the Uncertainty of Departures on Multi-Center Traffic Management Advisor (TMA) Scheduling

The Multi-center Traffic Management Advisor (McTMA) provides a platform for regional or national traffic flow management, by allowing long-range cooperative time-based metering to constrained resources, such as airports or air traffic control center boundaries. Part of the demand for resources is made up of proposed departures, whose actual departure time is difficult to predict. For this reason, McTMA does not schedule the departures in advance, but rather relies on traffic managers to input their requested departure time. Because this happens only a short while before the aircraft's actual departure, McTMA is unable to accurately predict the amount of delay airborne aircraft will need to take in order to accommodate the departures. The proportion of demand which is made up by such proposed departures increases as the horizon over which metering occurs gets larger. This study provides an initial analysis of the severity of this problem in a 400-500 nautical mile metering horizon and discusses potential solutions to accommodate these departures. The challenge is to smoothly incorporate departures with the airborne stream while not excessively delaying the departures.' In particular, three solutions are reviewed: (1) scheduling the departures at their proposed departure time; (2) not scheduling the departures in advance; and (3) scheduling the departures at some time in the future based on an estimated error in their proposed time. The first solution is to have McTMA to automatically schedule the departures at their proposed departure times. Since the proposed departure times are indicated in their flight times in advance, this method is the simplest, but studies have shown that these proposed times are often incorrect2 The second option is the current practice, which avoids these inaccuracies by only scheduling aircraft when a confirmed prediction of departure time is obtained from the tower of the departure airport. Lastly, McTMA can schedule the departures at a predicted departure time based on statistical data of past departure time performance. It has been found that departures usually have a wheels-up time after their indicated proposed departure time, as shown in Figure 1. Hence, the departures were scheduled at a time in the future based on the mean error in proposed departure times for their airport.

Thipphavong, Jane↗
NASA NTRS2019

Electronic Departure Approval Requests in ATD-2 Daily Operations

The NASA Airspace Technology Demonstration 2 project is investigating Integrated Arrival-Departure-Surface air traffic management through progressive refinement of a surface air traffic management system fielded at Charlotte-Douglas International Airport. Among the areas under study are departure release-time approval request (APREQ) traffic management initiatives. Scheduling departures at downstream points and complying with approved departure release times helps flights fit smoothly into busy traffic streams. This paper presents a review of APREQ operations and compliance data from daily electronic APREQ negotiations over fourteen months beginning in January 2018. It describes APREQ-compliance improvements observed as the electronic negotiation process has matured and discusses contributing factors, including renegotiation of departure release times.

Call for release↗
NASA NTRS2021

Analysis of Impacts of Terminal Restrictions on Departures in D10 TRACON

The D10 – Dallas-Fort Worth Terminal Radar Approach CONtrol (TRACON) is an air traffic facility that controls and manages aircraft and airspace that consists of multiple airports located in the North Texas area. From an air traffic management standpoint, one of the main challenges in the D10 TRACON is the departure fix capacity as multiple airports compete for resources. This problem is magnified when en route demand/capacity imbalance and inclement weather around the TRACON reduce the capacity at the terminal fixes. This leads to multiple, dynamic Traffic Management Initiative (TMI) restrictions being issued by the Air Traffic Control (ATC) on departing flights. This, in turn, propagates delay to the surface of each airport within the metroplex. The NASA Airspace Technology Demonstration 2 (ATD-2) Phase 3 is deployed in D10 to demonstrate new technologies developed to manage the Integrated Arrival, Departure, and Surface (IADS) traffic in a metroplex environment where multiple airports are interacting and sharing resources at the terminal boundary. This paper uses the ATD-2 terminal restriction data collected in the D10 TRACON to quantify the impact of restrictions on the demand, analyze the relation between terminal restrictions and departure taxi time on airport surface, and establish relationships between restrictions and surface delay. We found that the restrictions on departure flights have a direct adverse effect on departure excess taxi time on the airport surface.

ATD-2↗
NASA NTRS2021

Analysis of Impacts of Terminal Restrictions on Departures in D10 TRACON

The D10 – Dallas-Fort Worth Terminal Radar Approach CONtrol (TRACON) is an air traffic facility that controls and manages aircraft and airspace that consists of multiple airports located in the North Texas area. From an air traffic management standpoint, one of the main challenges in the D10 TRACON is the departure fix capacity as multiple airports compete for resources. This problem is magnified when en route demand/capacity imbalance and inclement weather around the TRACON reduce the capacity at the terminal fixes. This leads to multiple, dynamic Traffic Management Initiative (TMI) restrictions being issued by the Air Traffic Control (ATC) on departing flights. This, in turn, propagates delay to the surface of each airport within the metroplex. The NASA Airspace Technology Demonstration 2 (ATD-2) Phase 3 is deployed in D10 to demonstrate new technologies developed to manage the Integrated Arrival, Departure, and Surface (IADS) traffic in a metroplex environment where multiple airports are interacting and sharing resources at the terminal boundary. This paper uses the ATD-2 terminal restriction data collected in the D10 TRACON to quantify the impact of restrictions on the demand, analyze the relation between terminal restrictions and departure taxi time on airport surface, and establish relationships between restrictions and surface delay. We found that the restrictions on departure flights have a direct adverse effect on departure excess taxi time on the airport surface.

ATD-2↗