Search NASA⌕ Search

SEARCH · Search NASA

Results for “route extensions”

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 19 records

Exploring Management of Arrival Spacing Using Route Extensions with Terminal Spacing Tools

Airports with shared runway operations between arrivals and departures can experience severe departure gridlock and delays during a heavy arrival push due to insufficient gaps in the arrival stream for aircraft to depart. The problem is accentuated in situations when a large gap in the arrival spacing has to be created at the last minute due to wake vortex separation requirements. At LaGuardia airport, wake vortex separation problems arise when a heavy jet, such as a B757, departing on Runway 31 needs additional spacing between arrivals on Runway 22. A standard solution for controllers in many airports in situations such as this is to extend the downwind leg of arrival aircraft to create extra space between the arrivals. The question addressed in this paper is how such route extensions would work with terminal scheduling operations, namely (1) the automated Terminal Sequencing and Spacing (TSS) tools and (2) a new scheduling tool which increases the availability of gaps for departure aircraft (Departure Sensitive Arrival Spacing or DSAS). In a simulated LaGuardia airport (LGA) Terminal Radar Approach Control (TRACON) airspace, two new RNAV arrival routes were created along with extensions to these routes. The arrival route from the south had a downwind leg extension near the airport in the final sector. The arrival route from the north had an extension in a feeder sector further from the airport. An exploratory one-hour run with the route extensions was compared to an hour run without the extensions. Topics included in the paper are 1) how the route extensions were developed, 2) a procedure outlining how the aircraft could be scheduled to the extensions and who would do it, and 3) the results of the exploratory run compared to the original run without the extensions. The results indicated that the extended downwind leg route helped to create a B757 departure gap in the middle of a packed arrival stream, resulting in a reduction of 11 minutes in average wait time for the B757s, but at a cost of increased controller self-reported workload from low to moderate.

time based flow management↗

Overview and extensions of a system for routing directed graphs on SIMD architectures

Many problems can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from adjacent vertices. A method is given for parallelizing such problems on an SIMD machine model that uses only nearest neighbor connections for communication, and has no facility for local indirect addressing. Each vertex of the graph will be assigned to a processor in the machine. Rules for a labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithms defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. Additionally, researchers present an extension to the above method which allows for enhanced performance by allowing some broadcasting capabilities.

Tomboulian, Sherryl↗

Parallel Adaptive Mesh Refinement Library

Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.

Mac-Neice, Peter↗

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗

A parallel algorithm for global routing

A Parallel Hierarchical algorithm for Global Routing (PHIGURE) is presented. The router is based on the work of Burstein and Pelavin, but has many extensions for general global routing and parallel execution. Main features of the algorithm include structured hierarchical decomposition into separate independent tasks which are suitable for parallel execution and adaptive simplex solution for adding feedthroughs and adjusting channel heights for row-based layout. Alternative decomposition methods and the various levels of parallelism available in the algorithm are examined closely. The algorithm is described and results are presented for a shared-memory multiprocessor implementation.

Brouwer, Randall J.↗

Jet stream winds - Enhanced aircraft data acquisition and analysis over Southwest Asia

A project is described for providing the accurate initial and verification analyses for the jet stream in regions where general circulation models are known to have large systematic errors, either due to the extreme sparsity of data or to incorrect physical parameterizations. For this purpose, finely spaced aircraft-based meteorological data for the Southwest Asian regions collected for three 10-day periods in the winter of 1988-1989 will be used, together with corresponding data for the North American regions used as a control, to rerun the assimilation cycles and forecast models of the NMC and the NASA Goddard Laboratory for Atmospheres. Data for Southeast Asia will be collected by three carriers with extensive wide-body routes crossing the total region, while data for the North American region will be obtained from the archives of ACARS and GTS.

Tenenbaum, J.↗

Evaluating the WRF-Hydro Modeling System in Alaska

National Water Model (NWM) implemented operationally in August 2016 to improve hydrological prediction (OWP, 2017). (1) Four operational configurations (2) Only covers contiguous United States (US). NWM is instantiation of Weather Research and Forecasting model hydrological extension package (WRF-Hydro)(Gochis et al., 2013) coupled with Noah Land Surface Model with Multi-Parameterization options (Noah-MP)(Niu et al., 2011). WRF-Hydro is extensible, high-resolution hydrologic routing and streamflow modeling framework, coupling column land surface, terrain routing, and channel routing modules (NCAR, 2017). This project uses experimental version of WRF-Hydro in Alaska mimicking the NWM to: (1) Identify modeling challenges for NWM development in Alaska (2) Assess WRF-Hydro and NWM ability to represent unique hydrological processes of arctic regions and accurately predict high and low flow events (3) Examine impacts of assimilating Surface Water Ocean Topography (SWOT) (Biancamaria et al., 2016) observations to improve model initialization.

Hydrology↗

A System Concept for Facilitating User Preferences in En Route Airspace

The Federal Aviation Administration is trying to make its air traffic management system more responsive to the needs of the aviation community by exploring the concept of 'free flight' for aircraft flying under instrument flight rules. A logical first step toward free flight could be made without significantly altering current air traffic control (ATC) procedures or requiring new airborne equipment by designing a ground-based system to be highly responsive to 'user preference' in en route airspace while providing for an orderly transition to the terminal area. To facilitate user preference in all en route environments, a system based on an extension of the Center/TRACON Automation System (CTAS) is proposed in this document. The new system would consist of two integrated components. An airspace tool (AT) focuses on unconstrained en route aircraft (e.g., not transitioning to the terminal airspace), taking advantage of the relatively unconstrained nature of their flights and using long-range trajectory prediction to provide cost-effective conflict resolution advisories to sector controllers. A sector tool (ST) generates efficient advisories for all aircraft, with a focus on supporting controllers in analyzing and resolving complex, highly constrained traffic situations. When combined, the integrated AT/ST system supports user preference in any air route traffic control center sector. The system should also be useful in evaluating advanced free-flight concepts by serving as a test bed for future research. This document provides an overview of the design concept, explains its anticipated benefits, and recommends a development strategy that leads to a deployable system.

Vivona, R. A.↗

Autonomous Operations Planner: A Flexible Platform for Research in Flight-Deck Support for Airborne Self-Separation

The Autonomous Operations Planner (AOP), developed by NASA, is a flexible and powerful prototype of a flight-deck automation system to support self-separation of aircraft. The AOP incorporates a variety of algorithms to detect and resolve conflicts between the trajectories of its own aircraft and traffic aircraft while meeting route constraints such as required times of arrival and avoiding airspace hazards such as convective weather and restricted airspace. This integrated suite of algorithms provides flight crew support for strategic and tactical conflict resolutions and conflict-free trajectory planning while en route. The AOP has supported an extensive set of experiments covering various conditions and variations on the self-separation concept, yielding insight into the system s design and resolving various challenges encountered in the exploration of the concept. The design of the AOP will enable it to continue to evolve and support experimentation as the self-separation concept is refined.

Karr, David A.↗

Analysis of Multi-Flight Common Routes for Traffic Flow Management

This paper presents an approach for creating common weather avoidance reroutes for multiple flights and the associated benefits analysis, which is an extension of the single flight advisories generated using the Dynamic Weather Routes (DWR) concept. These multiple flight advisories are implemented in the National Airspace System (NAS) Constraint Evaluation and Notification Tool (NASCENT), a nation-wide simulation environment to generate time- and fuel-saving alternate routes for flights during severe weather events. These single flight advisories are clustered together in the same Center by considering parameters such as a common return capture fix. The clustering helps propose routes called, Multi-Flight Common Routes (MFCR), that avoid weather and other airspace constraints, and save time and fuel. It is expected that these routes would also provide lower workload for traffic managers and controllers since a common route is found for several flights, and presumably the route clearances would be easier and faster. This study was based on 30-days in 2014 and 2015 each, which had most delays attributed to convective weather. The results indicate that many opportunities exist where individual flight routes can be clustered to fly along a common route to save a significant amount of time and fuel, and potentially reducing the amount of coordination needed.

weather uncertainty↗

Responding to Climate Change: Adelie Penguins Confront Astronomical and Ocean Boundaries

Long-distance migration enables many organisms to take advantage of lucrative breeding and feeding opportunities during summer at high latitudes and then to move to lower, more temperate latitudes for the remainder of the year. The latitudinal range of the Ad lie penguin spans ~ 22 deg. Penguins from northern colonies may not migrate, but due to the high latitude of Ross Island colonies, these penguins almost certainly undertake the longest migrations for the species. Previous work has suggested that Adelies require both pack ice and some ambient light at all times of year. Over a 3-yr period, which included winters of both extensive and reduced sea ice, we investigated migratory routes and characteristics and wintering locations of Adelie Penguins from two colonies of very different size on Ross Island, Ross Sea, the southernmost colonies for any penguin. We acquired data from 3-16 Geolocation Sensors affixed to penguins each year at both Cape Royds and Cape Crozier in 2003-2005. Migrations averaged 12,760 km, with the longest being 17,600 km, and were in part facilitated by pack ice movement. Trip distances varied annually, but not by colony. Penguins rarely traveled north of the main sea ice pack, and used areas with high sea-ice concentration, ranging from 75-85%, about 500 km inward from the ice edge. They also used locations where there was some twilight (2-7 hr with sun greater than 6 below horizon). We review how Adelie Penguin migration has likely changed since withdrawal of the West Antarctic Ice 35 Sheet across the Ross Sea beginning 12,000 yBP. If sea ice extent in the Ross Sea sector decreases, as predicted by climate models, we can expect change in wintering areas, the location of which ultimately may be limited more by the availability of adequate light for visual foraging than by the availability of suitable pack-ice.

Ballard, Grant↗

The route to chaos for the Kuramoto-Sivashinsky equation

The results of extensive numerical experiments of the spatially periodic initial value problem for the Kuramoto-Sivashinsky equation. This paper is concerned with the asymptotic nonlinear dynamics at the dissipation parameter decreases and spatio-temporal chaos sets in. To this end the initial condition is taken to be the same for all numerical experiments (a single sine wave is used) and the large time evolution of the system is followed numerically. Numerous computations were performed to establish the existence of windows, in parameter space, in which the solution has the following characteristics as the viscosity is decreased: a steady fully modal attractor to a steady bimodal attractor to another steady fully modal attractor to a steady trimodal attractor to a periodic attractor, to another steady fully modal attractor, to another periodic attractor, to a steady tetramodal attractor, to another periodic attractor having a full sequence of period-doublings (in parameter space) to chaos. Numerous solutions are presented which provide conclusive evidence of the period-doubling cascades which precede chaos for this infinite-dimensional dynamical system. These results permit a computation of the length of subwindows which in turn provide an estimate for their successive ratios as the cascade develops. A calculation based on the numerical results is also presented to show that the period doubling sequences found here for the Kuramoto-Sivashinsky equation, are in complete agreement with Feigenbaum's universal constant of 4,669201609... . Some preliminary work shows several other windows following the first chaotic one including periodic, chaotic, and a steady octamodal window; however, the windows shrink significantly in size to enable concrete quantitative conclusions to be made.

Papageorgiou, Demetrios T.↗

The route to chaos for the Kuramoto-Sivashinsky equation

The results of extensive numerical experiments of the spatially periodic initial value problem for the Kuramoto-Sivashinsky equation. This paper is concerned with the asymptotic nonlinear dynamics at the dissipation parameter decreases and spatio-temporal chaos sets in. To this end the initial condition is taken to be the same for all numerical experiments (a single sine wave is used) and the large time evolution of the system is followed numerically. Numerous computations were performed to establish the existence of windows, in parameter space, in which the solution has the following characteristics as the viscosity is decreased: a steady fully modal attractor to a steady bimodal attractor to another steady fully modal attractor to a steady trimodal attractor to a periodic attractor, to another steady fully modal attractor, to another periodic attractor, to a steady tetramodal attractor, to another periodic attractor having a full sequence of period-doublings (in parameter space) to chaos. Numerous solutions are presented which provide conclusive evidence of the period-doubling cascades which precede chaos for this infinite-dimensional dynamical system. These results permit a computation of the length of subwindows which in turn provide an estimate for their successive ratios as the cascade develops. A calculation based on the numerical results is also presented to show that the period doubling sequences found here for the Kuramoto-Sivashinsky equation, are in complete agreement with Feigenbaum's universal constant of 4,669201609 .... Some preliminary work shows several other windows following the first chaotic one including periodic, chaotic, and a steady octamodal window; however, the windows shrink significantly in size to enable concrete quantitative conclusions to be made.

Papageorgiou, Demetrios T.↗

Toward a Unified Routing Framework for Delay-Tolerant Networking

Routing in Delay-/Disruption-Tolerant Networking (DTN) has long been recognized as a challenging research topic. The difficulty lies in the fact that link intermittency and network partitioning, possibly coupled with long delays, prevent the use of Internet solutions based on an up-to-date comprehensive knowledge of network topology, as communicated by routing protocols. In the literature on DTN routing, there is a dichotomy between solutions designed for deterministic (e.g., space flight) networks, such as Contact Graph Routing (CGR), and the wide variety of protocols designed for opportunistic terrestrial networks. After a discussion of the origin and motivations of this duality, the paper presents an opportunistic extension of CGR (OCGR). The aim is to try to resolve the DTN routing dichotomy by providing a unified approach suitable for all DTN environments.

Routing↗

The Conference Proceedings of the 1999 Air Transport Research Group (ATRG) of the WCTR Society

In this paper, we develop a model with which allows us to measure not only the changes in equilibrium outcomes and welfare consequences of liberalizing a bilateral air transport agreement, but also the distribution of the gains and losses to carriers and consumers of each bilateral country and those of the third foreign countries. Our model also allows to measure the effects of changes in a bilateral agreement on the amount of traffic diversion between the direct bilateral routes and the indirect routes via a third country. We also provide an extension of our model to a case of oligopoly market outcome (Coumot Nash equilibrium). In our model, quality aspects are treated in the framework of hedonic price theory by specifying the quality-adjusted price (quantity) as a multiplication of the observed price (quantity) by the reciprocal quality index function (the quality index function). Numerical simulations were conducted to measure the effects of changing the following major policy levers in a bilateral air transport agreement: 1) Removing price regulation while retaining frequency and entry restrictions; 2) Removing price and entry regulation while retaining frequency restrictions; 3) Removing frequency regulations while retaining price and entry regulations; 4) Removing frequency and entry regulations while retaining price regulation; 5) Removing price and frequency regulations while retaining entry restriction; and 6) Removing all price, frequency and entry regulations (de facto, open skies).

Zhang, Anming↗

The Future of Air Traffic Management

A system for the control of terminal area traffic to improve productivity, referred to as the Center-TRACON Automation System (CTAS), is being developed at NASA's Ames Research Center under a joint program with the FAA. CTAS consists of a set of integrated tools that provide computer-generated advisories for en-route and terminal area controllers. The premise behind the design of CTAS has been that successful planning of traffic requires accurate trajectory prediction. Data bases consisting of representative aircraft performance models, airline preferred operational procedures and a three dimensional wind model support the trajectory prediction. The research effort has been the design of a set of automation tools that make use of this trajectory prediction capability to assist controllers in overall management of traffic. The first tool, the Traffic Management Advisor (TMA), provides the overall flow management between the en route and terminal areas. A second tool, the Final Approach Spacing Tool (FAST) provides terminal area controllers with sequence and runway advisories to allow optimal use of the runways. The TMA and FAST are now being used in daily operations at Dallas/Ft. Worth airport. Additional activities include the development of several other tools. These include: 1) the En Route Descent Advisor that assist the en route controller in issuing conflict free descents and ascents; 2) the extension of FAST to include speed and heading advisories and the Expedite Departure Path (EDP) that assists the terminal controller in management of departures; and 3) the Collaborative Arrival Planner (CAP) that will assist the airlines in operational decision making. The purpose of this presentation is to review the CTAS concept and to present the results of recent field tests. The paper will first discuss the overall concept and then discuss the status of the individual tools.

Denery, Dallas G.↗

Traffic Aware Planner (TAP) Flight Evaluation

NASA's Traffic Aware Planner (TAP) is a cockpit decision support tool that has the potential to achieve significant fuel and time savings when it is embedded in the data-rich Next Generation Air Transportation System (NextGen) airspace. To address a key step towards the operational deployment of TAP and the NASA concept of Traffic Aware Strategic Aircrew Requests (TASAR), a system evaluation was conducted in a representative flight environment in November, 2013. Numerous challenges were overcome to achieve this goal, including the porting of the foundational Autonomous Operations Planner (AOP) software from its original simulation-based, avionics-embedded environment to an Electronic Flight Bag (EFB) platform. A flight-test aircraft was modified to host the EFB, the TAP application, an Automatic Dependent Surveillance Broadcast (ADS-B) processor, and a satellite broadband datalink. Nine Evaluation Pilots conducted 26 hours of TAP assessments using four route profiles in the complex eastern and north-eastern United States airspace. Extensive avionics and video data were collected, supplemented by comprehensive inflight and post-flight questionnaires. TAP was verified to function properly in the live avionics and ADS-B environment, characterized by recorded data dropouts, latency, and ADS-B message fluctuations. Twelve TAP-generated optimization requests were submitted to ATC, of which nine were approved, and all of which resulted in fuel and/or time savings. Analysis of subjective workload data indicated that pilot interaction with TAP during flight operations did not induce additional cognitive loading. Additionally, analyses of post-flight questionnaire data showed that the pilots perceived TAP to be useful, understandable, intuitive, and easy to use. All program objectives were met, and the next phase of TAP development and evaluations with partner airlines is in planning for 2015.

Maris, John M.↗

Human-in-the-Loop Evaluation of Dynamic Multi-Flight Common Route Advisories

Flights often experience large delays when they are routed around weather. Multi-flight common route advisories provide delay recovery by suggesting time-saving re-routes for groups of flights whose current weather-avoidance routes have become outdated because the weather has dissipated and/or moved away. A laboratory evaluation of these advisories was conducted by four subject matter experts having extensive experience in traffic flow management operations. These experts provided a total of 120 data points in the airspace of Houston Center. The multi-flight common route tool provides time-saving route change advisories taking into account flight plans, wind fields, and the spatio-temporal evolution of predicted convective weather. It is not designed to account for complex operational factors such as non-standard sector traversal and interactions with local traffic management initiatives; hence a relatively low percentage (37%) of advisories generated by the tool were rated as acceptable. However, a high percentage (81%) of advisories were rated as acceptable after the subject matter experts used the tool's user interface to make route modifications that accounted for relevant operational factors not considered by the tool. The workload associated with using the tool, as measured by the NASA Task Load Index, was quite low (1.1 on a scale of 0 to 10). The results of this evaluation make a good case for human-automation teaming to design operationally valid weather re-routes for delay recovery.

Traffic Flow Management↗