SEARCH · Engineering Papers

Results for “Routing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,387 records · Page 77

All sources NASA NTRS DOE OSTI

DOE OSTI2019

GeI 2 Additive for High Optoelectronic Quality CsPbI 3 Quantum Dots and Their Application in Photovoltaic Devices

Trioctylphosphine (TOP)-based syntheses of CsPbI 3 perovskite quantum dots (QDs) yield unprecedented high photoluminescence quantum yield (PL QY), lower Stokes shifts, and longer carrier lifetimes due to their enhanced crystallinity. This synthetic route relies on a heavily Pb-rich condition or a large Pb:Cs molar ratio in precursor solution to produce QDs with appropriate stoichiometry as well as to guarantee a good colloidal stability. The high Pb condition is achieved by a high concentration of PbI 2 prepared in TOP. Here we find such Pb-rich strategies can be avoided by providing additional iodine ions using other metal halide salts. In particular GeI 2 , which contrary to PbI 2 , readily dissolves in TOP. CsPbI 3 QDs prepared using PbI 2 /GeI 2 combination show near-unity PL QY and improved chemical stability compared to the previous synthetic route. Furthermore, we find no sign of Ge incorporation in the QDs (compositionally or energetically). The ensuing QD solar cells deliver power conversion efficiency of 12.15% and retain 85% of its peak performance after storage over 90 days. The PbI 2 /GeI 2 dual-source iodine synthetic approach presented here represents a more rational and robust route to high-quality CsPbI 3 QDs. to guarantee a good colloidal stability. The high Pb condition is achieved by a high concentration of PbI2 prepared in TOP. Here we find such Pb-rich strategies can be avoided by providing additional iodine ions using other metal halide salts. In particular GeI 2 , which contrary to PbI 2 , readily dissolves in TOP. CsPbI 3 QDs prepared using PbI 2 /GeI 2 combination show near-unity PL QY and improved chemical stability compared to the previous synthetic route. Furthermore, we find no sign of Ge incorporation in the QDs (compositionally or energetically). The ensuing QD solar cells deliver power conversion efficiency of 12.15% and retain 85% of its peak performance after storage over 90 days. The PbI 2 /GeI 2 dual-source iodine synthetic approach presented here represents a more rational and robust route to high-quality CsPbI 3 QDs.

14 SOLAR ENERGY↗

DOE OSTI2014

Passage Distribution and Federal Columbia River Power System Survival for Steelhead Kelts Tagged Above and at Lower Granite Dam, Year 2

Steelhead (Oncorhynchus mykiss) populations have declined throughout their range in the last century and many populations, including those of the Snake River Basin are listed under the Endangered Species Act of 1973. The reasons for their decline are many and complex, but include habitat loss and degradation, overharvesting, and dam construction. The 2008 Biological Opinion calls for an increase in the abundance of female steelhead through an increase in iteroparity (i.e., repeat spawning) and this can be realized through a combination of reconditioning and in-river survival of migrating kelts. The goal of this study is to provide the data necessary to inform fisheries managers and dam operators of Snake River kelt migration patterns, survival, and routes of dam passage. Steelhead kelts (n = 487) were captured and implanted with acoustic transmitters and passive integrated transponder (PIT)-tags at the Lower Granite Dam (LGR) Juvenile Fish Facility and at weirs located in tributaries of the Snake and Clearwater rivers upstream of LGR. Kelts were monitored as they moved downstream through the Federal Columbia River Power System (FCRPS) by 15 autonomous and 3 cabled acoustic receiver arrays. Cabled receiver arrays deployed on the dam faces allowed for three-dimensional tracking of fish as they approached the dam face and were used to determine the route of dam passage. Overall, 27.3% of the kelts tagged in this study successfully migrated to Martin Bluff (rkm 126, as measured from the mouth of the Columbia River), which is located downstream of all FCRPS dams. Within individual river reaches, survival per kilometer estimates ranged from 0.958 to 0.999; the lowest estimates were observed in the immediate forebay of FCRPS dams. Steelhead kelts tagged in this study passed over the spillway routes (spillway weirs, traditional spill bays) in greater proportions and survived at higher rates compared to the few fish passed through powerhouse routes (turbines and juvenile bypass systems). The results of this study provide information about the route of passage and subsequent survival of steelhead kelts that migrated through the Snake and Columbia rivers from LGR to Bonneville Dam in 2013. These data may be used by fisheries managers and dam operators to identify potential ways to increase the survival of kelts during their seaward migrations.

Colotelo, Alison H.↗

DOE OSTI2014

Passage Distribution and Federal Columbia River Power System Survival for Steelhead Kelts Tagged Above and at Lower Granite Dam, Year 2 (Rev. 1)

13 HYDRO ENERGY↗

DOE OSTI2022

Recycling of Lead Pastes from Spent Lead–Acid Batteries: Thermodynamic Constraints for Desulphurization

Lead–acid batteries are important to modern society because of their wide usage and low cost. The primary source for production of new lead–acid batteries is from recycling spent lead–acid batteries. In spent lead–acid batteries, lead is primarily present as lead pastes. In lead pastes, the dominant component is lead sulfate (PbSO 4 , mineral name anglesite) and lead oxide sulfate (PbO•PbSO 4 , mineral name lanarkite), which accounts for more than 60% of lead pastes. In the recycling process for lead–acid batteries, the desulphurization of lead sulfate is the key part to the overall process. In this work, the thermodynamic constraints for desulphurization via the hydrometallurgical route for recycling lead pastes are presented. The thermodynamic constraints are established according to the thermodynamic model that is applicable and important to recycling of lead pastes via hydrometallurgical routes in high ionic strength solutions that are expected to be in industrial processes. The thermodynamic database is based on the Pitzer equations for calculations of activity coefficients of aqueous species. The desulphurization of lead sulfates represented by PbSO 4 can be achieved through the following routes. (1) conversion to lead oxalate in oxalate-bearing solutions; (2) conversion to lead monoxide in alkaline solutions; and (3) conversion to lead carbonate in carbonate solutions. Among the above three routes, the conversion to lead oxalate is environmentally friendly and has a strong thermodynamic driving force. Oxalate-bearing solutions such as oxalic acid and potassium oxalate solutions will provide high activities of oxalate that are many orders of magnitude higher than those required for conversion of anglesite or lanarkite to lead oxalate, in accordance with the thermodynamic model established for the oxalate system. An additional advantage of the oxalate conversion route is that no additional reductant is needed to reduce lead dioxide to lead oxide or lead sulfate, as there is a strong thermodynamic force to convert lead dioxide directly to lead oxalate. As lanarkite is an important sulfate-bearing phase in lead pastes, this study evaluates the solubility constant for lanarkite regarding the following reaction, based on the solubility data, PbO•PbSO 4 + 2H + ⇌ 2Pb 2+ + SO 4 2– + H 2 O(l).

25 ENERGY STORAGE↗

NASA NTRS1990

A manned maneuvering unit proximity operations planning and flight guidance display and control system

This task concerns the design, development, testing, and evaluation of a new proximity operations planning and flight guidance display and control system for manned space operations. A forecast, derivative manned maneuvering unit (MMU) was identified as a candidate for the application of a color, highway-in-the-sky display format for the presentation of flight guidance information. A silicon graphics 4D/20-based simulation is being developed to design and test display formats and operations concepts. The simulation includes the following: (1) real-time color graphics generation to provide realistic, dynamic flight guidance displays and control characteristics; (2) real-time graphics generation of spacecraft trajectories; (3) MMU flight dynamics and control characteristics; (4) control algorithms for rotational and translational hand controllers; (5) orbital mechanics effects for rendezvous and chase spacecraft; (6) inclusion of appropriate navigation aids; and (7) measurement of subject performance. The flight planning system under development provides for: (1) selection of appropriate operational modes, including minimum cost, optimum cost, minimum time, and specified ETA; (2) automatic calculation of rendezvous trajectories, en route times, and fuel requirements; (3) and provisions for manual override. Man/machine function allocations in planning and en route flight segments are being evaluated. Planning and en route data are presented on one screen composed of two windows: (1) a map display presenting a view perpendicular to the orbital plane, depicting flight planning trajectory and time data attitude display presenting attitude and course data for use en route; and (2) an attitude display presenting local vertical-local horizontal attitude data superimposed on a highway-in-the-sky or flight channel representation of the flight planned course. Both display formats are presented while the MMU is en route. In addition to these displays, several original display elements are being developed, including a 3DOF flight detector for attitude commanding, a different flight detector for translation commands, and a pictorial representation of velocity deviations.

Gershzohn, Gary R.↗

NASA NTRS1992

An acetate precursor process for BSCCO (2223) thin films and coprecipitated powders

Since the discovery of high temperature superconducting oxides much attention has been paid to finding better and useful ways to take advantage of the special properties exhibited by these materials. One such process is the development of thin films for engineering applications. Another such process is the coprecipitation route to producing superconducting powders. An acetate precursor process for use in thin film fabrication and a chemical coprecipitation route to Bismuth based superconducting materials has been developed. Data obtained from the thin film process were inconclusive to date and require more study. The chemical coprecipitation method of producing bulk material is a viable method, and is preferred over the previously used solid state route. This method of powder production appears to be an excellent route to producing thin section tape cast material and screen printed devices, as it requires less calcines than the oxide route to produce quality powders.

Haertling, Gene H.↗

NASA NTRS1992

Scheduling of an aircraft fleet

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

Paltrinieri, Massimo↗

NASA NTRS1994

Continental-scale river flow in climate models

The hydrologic cycle is a major part of the global climate system. There is an atmospheric flux of water from the ocean surface to the continents. The cycle is closed by return flow in rivers. In this paper a river routing model is developed to use with grid box climate models for the whole earth. The routing model needs an algorithm for the river mass flow and a river direction file, which has been compiled for 4 deg x 5 deg and 2 deg x 2.5 deg resolutions. River basins are defined by the direction files. The river flow leaving each grid box depends on river and lake mass, downstream distance, and an effective flow speed that depends on topography. As input the routing model uses monthly land source runoff from a 5-yr simulation of the NASA/GISS atmospheric climate model (Hansen et al.). The land source runoff from the 4 deg x 5 deg resolution model is quartered onto a 2 deg x 2.5 deg grid, and the effect of grid resolution is examined. Monthly flow at the mouth of the world's major rivers is compared with observations, and a global error function for river flow is used to evaluate the routing model and its sensitivity to physical parameters. Three basinwide parameters are introduced: the river length weighted by source runoff, the turnover rate, and the basinwide speed. Although the values of these parameters depend on the resolution at which the rivers are defined, the values should converge as the grid resolution becomes finer. When the routing scheme described here is coupled with a climate model's source runoff, it provides the basis for closing the hydrologic cycle in coupled atmosphere-ocean models by realistically allowing water to return to the ocean at the correct location and with the proper magnitude and timing.

Miller, James R.↗

NASA NTRS1999

Avoiding Braess' Paradox Through Collective Intelligence

In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a particular router, its routing that traffic via an ISPA is optimal, as far as cost incurred by that traffic is concerned. We demonstrate though that in many cases, due to the side-effects of one router's actions on another routers performance, having routers use ISPA's is suboptimal as far as global aggregate cost is concerned, even when only used to route infinitesimally small amounts of traffic. As a particular example of this we present an instance of Braess' paradox for ISPA'S, in which adding new links to a network decreases overall throughput. We also demonstrate that load-balancing, in which the routing decisions are made to optimize the global cost incurred by all traffic currently being routed, is suboptimal as far as global cost averaged across time is concerned. This is also due to "side-effects", in this case of current routing decision on future traffic. The theory of COllective INtelligence (COIN) is concerned precisely with the issue of avoiding such deleterious side-effects. We present key concepts from that theory and use them to derive an idealized algorithm whose performance is better than that of the ISPA, even in the infinitesimal limit. We present experiments verifying this, and also showing that a machine-learning-based version of this COIN algorithm in which costs are only imprecisely estimated (a version potentially applicable in the real world) also outperforms the ISPA, despite having access to less information than does the ISPA. In particular, this COIN algorithm avoids Braess' paradox.

Wolpert , David H.↗

NASA NTRS2002

Mobile Router Technology Development

Cisco Systems and NASA have been performing joint research on mobile routing technology under a NASA Space Act Agreement. Cisco developed mobile router technology and provided that technology to NASA for applications to aeronautic and space-based missions. NASA has performed stringent performance testing of the mobile router, including the interaction of routing and transport-level protocols. This paper describes mobile routing, the mobile router, and some key configuration parameters. In addition, the paper describes the mobile routing test network and test results documenting the performance of transport protocols in dynamic routing environments.

Ivancic, William D.↗

NASA NTRS1991

Method and apparatus for eliminating unsuccessful tries in a search tree

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

Peterson, John C.↗

NASA NTRS2009

Wireless Avionics Packet to Support Fault Tolerance for Flight Applications

In this protocol and packet format, data traffic is monitored by all network interfaces to determine the health of transmitter and subsystems. When failures are detected, the network inter face applies its recover y policies to provide continued service despite the presence of faults. The protocol, packet format, and inter face are independent of the data link technology used. The current demonstration system supports both commercial off-the-shelf wireless connections and wired Ethernet connections. Other technologies such as 1553 or serial data links can be used for the network backbone. The Wireless Avionics packet is divided into three parts: a header, a data payload, and a checksum. The header has the following components: magic number, version, quality of service, time to live, sending transceiver, function code, payload length, source Application Data Interface (ADI) address, destination ADI address, sending node address, target node address, and a sequence number. The magic number is used to identify WAV packets, and allows the packet format to be updated in the future. The quality of service field allows routing decisions to be made based on this value and can be used to route critical management data over a dedicated channel. The time to live value is used to discard misrouted packets while the source transceiver is updated at each hop. This information is used to monitor the health of each transceiver in the network. To identify the packet type, the function code is used. Besides having a regular data packet, the system supports diagnostic packets for fault detection and isolation. The payload length specifies the number of data bytes in the payload, and this supports variable-length packets in the network. The source ADI is the address of the originating interface. This can be used by the destination application to identify the originating source of the packet where the address consists of a subnet, subsystem class within the subnet, a subsystem unit, and the local ADI number. The destination ADI is used to route the packet to its ultimate destination. At each hop, the sending interface uses the destination address to determine the next node for the data. The sending node is the node address of the interface that is broadcasting the packet. This field is used to determine the health of the subsystem that is sending the packet. In the case of a packet that traverses several intermediate nodes, it may be the node address of the intermediate node. The target node is the node address of the next hop for the packet. It may be an intermediate node, or the final destination for the packet. The sequence number is used to identify duplicate packets. Because each interface has multiple transceivers, the same packet will appear at both receivers. The sequence number allows the interface to correlate the reception and forward a single, unique packet for additional processing. The subnet field allows data traffic to be partitioned into segregated local networks to support large networks while keeping each subnet at a manageable size. This also keeps the routing table small enough so routing can be done by a simple table lookup in an FPGA device. The subsystem class identifies members of a set of redundant subsystems, and, in a hot standby configuration, all members of the subsystem class will receive the data packets. Only the active subsystem will generate data traffic. Specific units in a class of redundant units can be identified and, if the hot standby configuration is not used, packets will be directed to a specific subsystem unit.

Block, Gary L.↗

NASA NTRS2010

MMIC Amplifiers and Wafer Probes for 350 to 500 GHz

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Samoska, Lorene A.↗

NASA NTRS2010

Cruise-Efficient Short Takeoff and Landing (CESTOL): Potential Impact on Air Traffic Operations

The National Aeronautics and Space Administration (NASA) is investigating technological and operational concepts for introducing Cruise-Efficient Short Takeoff and Landing (CESTOL) aircraft into a future US National Airspace System (NAS) civil aviation environment. CESTOL is an aircraft design concept for future use to increase capacity and reduce emissions. CESTOL provides very flexible takeoff, climb, descent and landing performance capabilities and a high-speed cruise capability. In support of NASA, this study is a preliminary examination of the potential operational impact of CESTOL on airport and airspace capacity and delay. The study examines operational impacts at a subject site, Newark Liberty Intemational Airport (KEWR), New Jersey. The study extends these KEWR results to estimate potential impacts on NAS-wide network traffic operations due to the introduction of CESTOL at selected major airports. These are the 34 domestic airports identified in the Federal Aviation Administration's Operational Evolution Plan (OEP). The analysis process uses two fast-time simulation tools to separately model local and NAS-wide air traffic operations using predicted flight schedules for a 24-hour study period in 2016. These tools are the Sen sis AvTerminal model and NASA's Airspace Concept Evaluation System (ACES). We use both to simulate conventional-aircraft-only and CESTOL-mixed-with-conventional-aircraft operations. Both tools apply 4-dimension trajectory modeling to simulate individual flight movement. The study applies AvTerminal to model traffic operations and procedures for en route and terminal arrival and departures to and from KEWR. These AvTerminal applications model existing arrival and departure routes and profiles and runway use configurations, with the assumption jet-powered, large-sized civil CESTOL aircraft use a short runway and standard turboprop arrival and departure procedures. With these rules, the conventional jet and CESTOL aircraft are procedurally separated from each other geographically and in altitude during tenninal airspace approach and departure operations, and each use a different arrival runway. AvTeminal implements its unique Focal-point Scheduling Process to sequence, space and delay aircraft to resolve spacing and overtake conflicts among flights in the airspace and airport system serving KEWR. This Process effectively models integrated arrival and departure operations. AvTerminal assesses acceptance rates and delay magnitude and causality at selected locations, including en route outer boundary fixes, tenninal airspace arrival and departure boundary fixes, terminal airspace arrival merge and departure diverge fixes, and runway landing and takeoff runways. The analysis compares the resulting capacity impacts, flight delays and delay sources between CESTOL and conventional KEWR operations. AvTerminal quantitative results showed that CESTOL has significant capability to increase airport arrival acceptance rates (35-40% at KEWR) by taking advantage of otherwise underused airspace and runways where available. The study extrapolates the AvTerminal-derived KEWR peak arrival and departure acceptance rates to estimate capacity parameter values for each of the OEP airports in the ACES modeling of traffic through the entire NAS network. The extrapolations of acceptance rates allow full, partial or no achievement of CESTOL capacity gains at an OEP airport as determined by assessments of the degree to which local procedures allow leveraging of CESTOL capabilities. These assessments consider each OEP airport's runway geometries, runway system configurations, airport and airspace operations, and potential CESTOL traffic loadings. The ACES modeling, simulates airport and airspace spacing constraints imposed by airport runway system, terminal and en route air traffic control and traffic flow management operations using airport acceptance rates representing conventional-aircraft-only and CESTOL-mixed operations. CEOL aircraft are assumed to have Mach 0.8, and alternatively Mach 0.7, cruise speeds to examine compatibility with conventional aircraft operations in common airspace. The ACES results provides estimates of CESTOL delay impact NAS-wide and at OEP airports due to changes in OEP airport acceptance rates and changes in en route airspace potential conflict rates. Preliminary results show meaningful nationwide delay reductions (20%) due to CESTOL operations at 34 major domestic airports.

Couluris, G. J.↗

NASA NTRS2011

Traverse Planning Experiments for Future Planetary Surface Exploration

This paper describes the results of a recent (July-August 2010 and July 2011) planetary surface traverse planning experiment. The purpose of this experiment was to gather data relevant to robotically repositioning surface assets used for planetary surface exploration. This is a scenario currently being considered for future human exploration missions to the Moon and Mars. The specific scenario selected was a robotic traverse on the lunar surface from an outpost at Shackleton Crater to the Malapert Massif. As these are exploration scenarios, the route will not have been previously traversed and the only pre-traverse data sets available will be remote (orbital) observations. Devon Island was selected as an analog location where a traverse route of significant length could be planned and then traveled. During the first half of 2010, a team of engineers and scientists who had never been to Devon Island used remote sensing data comparable to that which is likely to be available for the Malapert region (eg., 2-meter/pixel imagery, 10-meter interval topographic maps and associated digital elevation models, etc.) to plan a 17-kilometer (km) traverse. Surface-level imagery data was then gathered on-site that was provided to the planning team. This team then assessed whether the route was actually traversable or not. Lessons learned during the 2010 experiment were then used in a second experiment in 2011 for which a much longer traverse (85 km) was planned and additional surface-level imagery different from that gathered in 2010 was obtained for a comparative analysis. This paper will describe the route planning techniques used, the data sets available to the route planners and the lessons learned from the two traverses planned and carried out on Devon Island.

Hoffman, S. J.↗

NASA NTRS2012

Comparison of Controller and Flight Deck Algorithm Performance During Interval Management with Dynamic Arrival Trees (STARS)

Managing the interval between arrival aircraft is a major part of the en route and TRACON controller s job. In an effort to reduce controller workload and low altitude vectoring, algorithms have been developed to allow pilots to take responsibility for, achieve and maintain proper spacing. Additionally, algorithms have been developed to create dynamic weather-free arrival routes in the presence of convective weather. In a recent study we examined an algorithm to handle dynamic re-routing in the presence of convective weather and two distinct spacing algorithms. The spacing algorithms originated from different core algorithms; both were enhanced with trajectory intent data for the study. These two algorithms were used simultaneously in a human-in-the-loop (HITL) simulation where pilots performed weather-impacted arrival operations into Louisville International Airport while also performing interval management (IM) on some trials. The controllers retained responsibility for separation and for managing the en route airspace and some trials managing IM. The goal was a stress test of dynamic arrival algorithms with ground and airborne spacing concepts. The flight deck spacing algorithms or controller managed spacing not only had to be robust to the dynamic nature of aircraft re-routing around weather but also had to be compatible with two alternative algorithms for achieving the spacing goal. Flight deck interval management spacing in this simulation provided a clear reduction in controller workload relative to when controllers were responsible for spacing the aircraft. At the same time, spacing was much less variable with the flight deck automated spacing. Even though the approaches taken by the two spacing algorithms to achieve the interval management goals were slightly different they seem to be simpatico in achieving the interval management goal of 130 sec by the TRACON boundary.

Battiste, Vernol↗

NASA NTRS2017

Method and System for Air Traffic Rerouting for Airspace Constraint Resolution

A dynamic constraint avoidance route system automatically analyzes routes of aircraft flying, or to be flown, in or near constraint regions and attempts to find more time and fuel efficient reroutes around current and predicted constraints. The dynamic constraint avoidance route system continuously analyzes all flight routes and provides reroute advisories that are dynamically updated in real time. The dynamic constraint avoidance route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

Sheth, Kapil S.↗

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↗