Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Deterministic transport”

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.

114 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Comparison of Different Control Schemes for Strategic Departure Metering

Airports and their terminal airspaces are key choke points in the air transportation system causing major delays and adding to pollution. A solution aimed at mitigating these chokepoints integrates the scheduling of runway operations, flight release from the gates and ramp into the airport movement area, and merging with other traffic competing for downstream airspace points. Within this integrated concept, we present a simulation-based analysis of the departure metering process, which delays the release of flights into the airport movement area while balancing two competing objectives: (1) maintaining large enough queues at the airport resources to maximize throughput and (2) absorbing excess delays at the gates or in ramp areas to save on fuel consumption, emissions, noise, and passenger discomfort. Three metering strategies are compared which respectively attempt to control the number of flights that (1) left the gate but did not take off, (2) left the ramp but did not take off, and (3) spent their unimpeded transit time to the runway but did not take off. It was observed that under deterministic and demand uncertainty conditions, the first strategy performed better than the other two strategies in terms of maintaining the runway throughput while transferring a significant average delay of two minutes to the gate. On the other hand, under uncertainties of flight transit time and runway service rate, all the strategies struggled to delay flights at the gate without a significant impact on the runway throughput.

air traffic management↗
NASA NTRS2004

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗
NASA NTRS2020

Intelligent Contingency Management for Urban Air Mobility

The third aviation revolution is seeking to enable transportation where users have access to immediate and flexible air travel; the users dictate trip origin, destination and timing. One of the major components of this vision is urban air mobility (UAM) for the masses. UAM means a safe and efficient system for vehicles to move passengers and cargo within a city. In order to reach UAM’s full market potential the vehicle will have to be autonomous. One of the primary challenges of autonomous flight is dealing with off-nominal events, both common and unforeseen; thus, intelligent contingency management (ICM) is one of the enabling technologies. In this context, the vehicle has to be aware of its internal state and external environment at all times, ascertain its capability and make decisions about mission completion or modification. All of these functions require data to model and assess the environment and then take actions based on these models. Necessarily, there is uncertainty associated with the data and the models generated from it. Since we are dealing with safety-critical systems, one of the main challenges of ICM is to generate sufficient data and to minimize its uncertainty to enable practical and safe decision making. We propose an overall architecture that incorporates deterministic and learning algorithms together to assess vehicle capabilities, project these into the future and make decisions on mission management level. A layered approach allows for mature parts and technologies to be integrated into early highly automated vehicles before the final state of autonomy is reached.

data-driven systems↗
NASA NTRS2009

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗
NASA NTRS2011

Integration of Dust Prediction Systems and Vegetation Phenology to Track Pollen for Asthma Alerts in Public Health

Pollen can be transported great distances. Van de Water et. al., 2003 reported Juniperus pollen, a significant aeroallergen was transported 200-600 km. Hence local observations of plant phenology may not be consistent with the timing and source of pollen collected by pollen sampling instruments. The DREAM (Dust REgional Atmospheric Model, Yin 2007) is a verified model for atmospheric dust transport modeling using MODIS data products to identify source regions and quantities of dust (Yin 2007). The use of satellite data products for studying phenology is well documented (White and Nemani 2006). We are modifying the DREAM model to incorporate pollen transport. The linkages already exist with DREAM through PHAiRS (Public Health Applications in remote Sensing) to the public health community. This linkage has the potential to fill this data gap so that health effects of pollen can better be tracked for linkage with health outcome data including asthma, respiratory effects, myocardial infarction, and lost work days. DREAM is based on the SKIRON/Eta modeling system and the Eta/NCEP regional atmospheric model. The dust modules of the entire system incorporate the state of the art parameterizations of all the major phases of the atmospheric dust life such as production, diffusion, advection, and removal. These modules also include effects of the particle size distribution on aerosol dispersion. The dust production mechanism is based on the viscous/turbulent mixing, shear-free convection diffusion, and soil moisture. In addition to these sophisticated mechanisms, very high resolution databases, including elevation, soil properties, and vegetation cover are utilized. The DREAM model was modified to use pollen sources instead of dust (PREAM). Pollen release will be estimated based on satellite-derived phenology of Juniperus spp. communities. The MODIS surface reflectance product (MOD09) will provide information on the start of the plant growing season, growth stage, peak greenness, dry-down and pollen release. Ground based observational records of pollen release timing and quantities will be used as verification. Techniques developed using MOD09 surface reflectance products will be directly applicable to the next generation sensors such as VIIRS. The resulting deterministic model for predicting and simulating pollen emission and downwind concentration to study details of phenology and meteorology and their dependencies. This information will be used to support the Centers for Disease Control and Prevention (CDC)'s National Environmental Public Health Tracking Program (EPHT) and the State of New Mexico environmental public health decision support for asthma and allergies alerts

Luvall, Jeffrey C.↗
NASA NTRS2009

Convective Weather Avoidance with Uncertain Weather Forecasts

Convective weather events have a disruptive impact on air traffic both in terminal area and in en-route airspaces. In order to make sure that the national air transportation system is safe and efficient, it is essential to respond to convective weather events effectively. Traffic flow control initiatives in response to convective weather include ground delay, airborne delay, miles-in-trail restrictions as well as tactical and strategic rerouting. The rerouting initiatives can potentially increase traffic density and complexity in regions neighboring the convective weather activity. There is a need to perform rerouting in an intelligent and efficient way such that the disruptive effects of rerouting are minimized. An important area of research is to study the interaction of in-flight rerouting with traffic congestion or complexity and developing methods that quantitatively measure this interaction. Furthermore, it is necessary to find rerouting solutions that account for uncertainties in weather forecasts. These are important steps toward managing complexity during rerouting operations, and the paper is motivated by these research questions. An automated system is developed for rerouting air traffic in order to avoid convective weather regions during the 20- minute - 2-hour time horizon. Such a system is envisioned to work in concert with separation assurance (0 - 20-minute time horizon), and longer term air traffic management (2-hours and beyond) to provide a more comprehensive solution to complexity and safety management. In this study, weather is dynamic and uncertain; it is represented as regions of airspace that pilots are likely to avoid. Algorithms are implemented in an air traffic simulation environment to support the research study. The algorithms used are deterministic but periodically revise reroutes to account for weather forecast updates. In contrast to previous studies, in this study convective weather is represented as regions of airspace that pilots are likely to avoid. The automated system periodically updates forecasts and reassesses rerouting decisions in order to account for changing weather predictions. The main objectives are to reroute flights to avoid convective weather regions and determine the resulting complexity due to rerouting. The eventual goal is to control and reduce complexity while rerouting flights during the 20 minute - 2 hour planning period. A three-hour simulation is conducted using 4800 flights in the national airspace. The study compares several metrics against a baseline scenario using the same traffic and weather but with rerouting disabled. The results show that rerouting can have a negative impact on congestion in some sectors, as expected. The rerouting system provides accurate measurements of the resulting complexity in the congested sectors. Furthermore, although rerouting is performed only in the 20-minute - 2-hour range, it results in a 30% reduction in encounters with nowcast weather polygons (100% being the ideal for perfectly predictable and accurate weather). In the simulations, rerouting was performed for the 20-minute - 2-hour flight time horizon, and for the en-route segment of air traffic. The implementation uses CWAM, a set of polygons that represent probabilities of pilot deviation around weather. The algorithms were implemented in a software-based air traffic simulation system. Initial results of the system's performance and effectiveness were encouraging. Simulation results showed that when flights were rerouted in the 20-minute - 2-hour flight time horizon of air traffic, there were fewer weather encounters in the first 20 minutes than for flights that were not rerouted. Some preliminary results were also obtained that showed that rerouting will also increase complexity. More simulations will be conducted in order to report conclusive results on the effects of rerouting on complexity. Thus, the use of the 20-minute - 2-hour flight time horizon weather avoidance teniques performed in the simulation is expected to provide benefits for short-term weather avoidance.

Karahan, Sinan↗