Results for “Routing algorithm” — Page 11

NASA NTRS1989

Piloted simulation of a ground-based time-control concept for air traffic control

A concept for aiding air traffic controllers in efficiently spacing traffic and meeting scheduled arrival times at a metering fix was developed and tested in a real time simulation. The automation aid, referred to as the ground based 4-D descent advisor (DA), is based on accurate models of aircraft performance and weather conditions. The DA generates suggested clearances, including both top-of-descent-point and speed-profile data, for one or more aircraft in order to achieve specific time or distance separation objectives. The DA algorithm is used by the air traffic controller to resolve conflicts and issue advisories to arrival aircraft. A joint simulation was conducted using a piloted simulator and an advanced concept air traffic control simulation to study the acceptability and accuracy of the DA automation aid from both the pilot's and the air traffic controller's perspectives. The results of the piloted simulation are examined. In the piloted simulation, airline crews executed controller issued descent advisories along standard curved path arrival routes, and were able to achieve an arrival time precision of + or - 20 sec at the metering fix. An analysis of errors generated in turns resulted in further enhancements of the algorithm to improve the predictive accuracy. Evaluations by pilots indicate general support for the concept and provide specific recommendations for improvement.

Davis, Thomas J.↗

NASA NTRS2022

A Generalized Approach to Aircraft Trajectory Prediction via Supervised Deep Learning

As research advances diverse forms and missions of aircraft, the National Airspace System (NAS) will become increasingly crowded, limiting current communications resources to accommodate aviation operations. Ongoing research proposes a paradigm of airspace communications, such that resources are autonomously and dynamically allocated via intelligent agents; this allocation requires accurate representations of the NAS, including the predicted positions of aircraft. State-of-the-art research emphasizes the importance of a hybrid-recurrent framework for trajectory prediction and compares the impact of commonly considered weather data on prediction accuracy. However, current research has been limited in its scope of efforts, frequently utilizing a unique flight route, architecture, set of weather data, and date range. This article considers the challenges of generalizing hybrid-recurrent predictive models for flight trajectories. Results illustrate an increase in error variance when identical models are trained over a generalized set of flights; this may be mitigated with careful tuning of hyperparameters, both in the network structure and optimization algorithms. Even so, an irreducible vertical error was identified, resulting from the complex takeoff and landing procedures which can not be correlated to functions of weather or additional assumptions of aircraft behavior. Finally, the use of a test route indicates that generalized models still do not possess sufficient knowledge for general aircraft predictions, with mean error increases ranging from 70-500%. These results illustrate the need for continued efforts on improving model versatility, as well as potential limitations for spectrum allocation near airports and other centers.

Nathan Schimpf↗

NASA NTRS2021

Applying the Cognitive Space Gateway to Swarm Topologies

NASA's future vision for interplanetary networking includes a lunar network, Cube Satellite (CubeSat) constellations, and deep space robotic missions, comprising what could be viewed as a network of networks. Delay-tolerant networking (DTN) architecture and protocols provide a standard network layer among these varying scenarios and mitigate many challenges of the space environment, such as long delays, unplanned service interruptions, and asymmetric links. The Cognitive Space Gateway (CSG) is a routing method in a DTN architecture that uses spiking neural networks as the learning element to optimize routing decisions in a complex environment. This work aims to further develop cognitive networking technologies in several critical areas, including DTN, the CSG algorithm, CubeSat swarm topologies, and cloud services. To test the algorithm in a realistic scenario, the emulated network topology is based on a CubeSat swarm. The swarm may function as a mesh of nodes or as a hub-and-spoke network. An emulation environment will be built upon a commercial cloud service, such as Amazon Web Services (AWS) Elastic Compute Cloud. The cloud environment may enable a flexible, lower maintenance approach versus a multi-hop network based in a physical laboratory. The cloud platform will provide a secure environment allowing for collaboration among government and academic entities.

Ricardo Lent↗

NASA NTRSDate not supplied

Demand Capacity Balancing at Vertiports for Initial Strategic Conflict Management of Urban Air Mobility Operations

Urban Air Mobility (UAM) is a new transportation concept that enables highly automated, cooperative, passenger or cargo-carrying air transportation services in and around urban areas. To achieve the high level of operational density and complexity desired by the UAM community, an airspace system that allows UAM operators to readily access and operate safely and efficiently in the airspace is needed. This airspace system will require air traffic management designed to reduce the risk of conflicts and loss of separation between UAM flights. In general, strategic conflict management is considered as the first layer of conflict management for safe flight operations to condition the traffic to reduce the need for airborne separation provision, the second layer of conflict management. Demand Capacity Balancing (DCB) is one of the concept components to achieve strategic conflict management. DCB strategically evaluates traffic demand and resource capacities to allow UAM operators to determine when, where and how they operate, while mitigating conflicting needs for airspace and vertiport capacity. DCB can be applied whenever UAM demand exceeds the capacity in airspace or at vertiports. As the UAM ecosystem evolves with advanced technologies and matured operational procedures, more complicated conflict management will likely be needed. In the current UAM ‘Concept of Operation (ConOps) 1.0’ operational stage defined by FAA, however, it will be meaningful to explore the demand capacity balancing at vertiports only, as an initial strategic conflict management approach for UAM operations because vertiport capacity seems to be a bottleneck of UAM traffic. For this research, we developed a demand-capacity imbalance detection and resolution service for UAM. This DCB service identifies the demand from operators and compares the demand to a given capacity at the shared resources (i.e., vertiports) over the upcoming time horizon which is divided into time bins having a constant interval. When a new flight plan is submitted, the algorithm embedded in the DCB service checks the available time bins based on the desired departure time and estimated arrival time at origin and destination vertiports, respectively. If the time bins for the originally desired times are already occupied by other flights (i.e., demand is at or above capacity), the algorithm finds the next available time bins for takeoff and landing and shifts the conflicting departure time to the earliest time that satisfies the capacity constraints at both origin and destination vertiports. The details of the algorithm will be described in the final manuscript. Figure 1 shows that the proposed DCB algorithm works well for a sample traffic scenario. In this example, a total of 144 flights, split between two operators, are planned over 2 hours, traveling 10 routes between five vertiports. In the heatmaps, the horizontal axis shows 12 time bins where each bin represents a 12-minute interval, and the vertical axis shows five vertiports. The number in each cell shows the number of operations, counting both departures and arrivals, at a specific vertiport in each time bin. For the given capacity of 2 operations/vertiport/bin, Figure 1 shows that the original demand sometimes exceeds the capacity, but the modified demand is reduced to the given capacity after resolving demand-capacity imbalances. When UAM flights are operated, it is expected that many practical issues would arise in the federated system architecture with multiple operators. UAM operators may experience a time synchronization issue due to communication delay between operator and vehicle. UAM vehicles would fly at different flight speeds, depending on vehicle models. Actual departure and arrival times can have large variations, compared to the schedule. The lead time from flight plan submission to desired departure time can vary by service type (e.g., regular shuttle service vs. on-demand service). Using the proposed DCB algorithm, we also investigated how the actual flight schedule and DCB performance are affected by these uncertainties such as unsynchronized times between operators, flight speed differences, lead time differences, and departure time errors. The final manuscript will include the background of this research work, the description of the DCB algorithm and its use cases with traffic scenarios. It will also provide the analytical results about the impact of various uncertainties that can occur in actual UAM operations on the DCB at vertiports, in terms of demand distribution changes, number of simultaneous operations, and delay propagation.

Urban Air Mobility↗

NASA NTRS1988

A parallel row-based algorithm with error control for standard-cell replacement on a hypercube multiprocessor

A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.

Sargent, Jeff Scott↗

NASA NTRS2017

Flight Test Evaluation of the ATD-1 Interval Management Application

Interval Management (IM) is a concept designed to be used by air traffic controllers and flight crews to more efficiently and precisely manage inter-aircraft spacing. Both government and industry have been working together to develop the IM concept and standards for both ground automation and supporting avionics. NASA contracted with Boeing, Honeywell, and United Airlines to build and flight test an avionics prototype based on NASA's spacing algorithm and conduct a flight test. The flight test investigated four different types of IM operations over the course of nineteen days, and included en route, arrival, and final approach phases of flight. This paper examines the spacing accuracy achieved during the flight test and the rate of speed commands provided to the flight crew. Many of the time-based IM operations met or exceeded the operational design goals set out in the standards for the maintain operations and a subset of the achieve operations. Those operations which did not meet the goals were due to issues that are identified and will be further analyzed.

Swieringa, Kurt A.↗

NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗

NASA NTRS1998

An Operational Concept for Flying FMS Trajectories in Center and TRACON Airspace

Current Flight Management Systems (FMS) do a good job of constructing and flying an optimal trajectory for a single aircraft. Unfortunately, flight crews are often unable to fly these FMS routes during arrivals at busy airports. The Center TRACON Automation System (CTAS) has been designed to aid Center and TRACON (Terminal Radar Approach Control) controllers in assigning runways, sequencing and vectoring all classes of aircraft. CTAS bases its advisories on trajectory predictions for arriving aircraft using algorithms very similar to those in airborne FMS systems. This paper presents near and far term operational concepts for how a ground ATM (air traffic management) automation system like CTAS could work more effectively with the airborne automation in FMS equipped aircraft. The concepts for a more compatible air-ground system include: 1) a common route databases for both CTAS and FMS; 2) datalink to downlink information on aircraft weight, final approach speed and trajectory intent and to uplink wind information; 3) new FMS functions to allow flight crews to easily update their FMS trajectory to match the trajectory suggested by the ground automation with voice clearances, and 4) in the far term, datalink to downlink user preferred trajectories and to uplink trajectory clearances in the terminal area. The paper analyses some of the human factors issues that may result in allowing aircraft to fly FMS routes during enroute descent and in the terminal area. A series of linked human in the loop flight deck and air traffic control simulations and a field test with the NASA 757 are being conducted at NASA's Ames and Langley Research Centers to address these issues and to evaluate the operational feasibility of these approaches to more efficient flight and increased airport throughput.

Palmer, Everett↗

NASA NTRS2019

Airborne Spacing for Terminal Arrival Routes (ASTAR) Proof-of-Concept Flight Test

The Airborne Spacing for Terminal Arrival Routes (ASTAR) Flight Test was conducted by the NASA Air Traffic Management Technology Demonstration – 1 (ATD- 1) project to demonstrate the use of NASA’s ASTAR algorithm beyond a simulated environment and assess the operational risks of performing a multi-aircraft flight test of Flight-deck Interval Management (FIM). Utilizing contemporary tools of the Federal Aviation Administration’s Next Generation Air Transportation System (NextGen) such as ADS-B, the ASTAR algorithm calculated speeds that the flight crew flew to achieve a precise spacing interval behind another aircraft at the final approach fix. Airspeed commands issued by the algorithm were flown by the flight crew of the FIM-equipped aircraft to achieve or maintain an assigned spacing goal from a target vehicle. The ASTAR algorithm was integrated with the Boeing supplied B-787 ecoDemonstrator aircraft, and five flight trials were conducted as a joint effort between NASA and Boeing on December 12, 2014. Initial results indicated arrival times within several seconds of accuracy of the planned termination point between two aircraft performing FIM in a real world environment. This flight test opened the way for the much more expansive ATD-1 Avionics Phase II flight test which occurred in early 2017. The flight trials under Phase II preceded further testing by the community in preparation for inclusion of the Interval Management concept as a part of the NextGen environment.

Roper, Roy D.↗

NASA NTRS2001

Satellite Ocean Color Validation Using Merchant Ships

A collaborative measurement program for evaluating satellite-derived ocean color has been developed based on ships of opportunity (merchant, oceanographic) and specific instrumentation, the SIMBAD radiometer. The purpose of the measurement program is to complement, in a cost-effective way, dedicated evaluation experiments at sea, which are expensive, cannot be carried out over the full range of expected oceanic and atmospheric conditions, and generally provide a few match-ups. Ships participate in the program on a volunteer basis or at a very small cost, and measurement procedures do not interfere with other ship activities. The SIMBAD radiometer is a portable, easy-to-operate instrument that measures the basic ocean color variables, namely aerosol optical thickness and water-leaving radiance, in typical spectral bands of ocean-color sensors, i.e., 443, 490, 560, 670, and 870 nm. Measuring these variables at the time of satellite overpass is usually sufficient to verify satellite-derived ocean color and to evaluate atmospheric correction algorithms. Any ordinary crew can learn quickly how to make measurements. Importantly, the ship is not required to stop, making it possible to collect data along regular routes traveled by merchant ships in the world's oceans.

Frouin, Robert↗

NASA NTRS1981

An innovative air data system for the Space Shuttle Orbiter - Data analysis techniques

The Shuttle Entry Air Data System (SEADS) is an experimental system designed to supply research quality air data and to meet Orbiter operational air data requirements throughout entry. SEADS incorporates no mechanical devices but is based on the concept that the fuselage proper, whether symmetrical or not, can be instrumented so as to function both as a pitot-static probe and as a differential pressure flow direction sensor. Specifically SEADS consists of 20 flush orifices, each routed to a pair of absolute pressure transducers. A computational technique has been developed capable of extracting air data parameters solely from surface pressure measurements. The digital filtering algorithm implemented in SEADS is the natural adaptation to air data sensing of a technology widely used in navigation, guidance, and control systems.

Pruett, C. D.↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

NASA NTRS1991

Simulation Test Of Descent Advisor

Report describes piloted-simulation test of Descent Advisor (DA), subsystem of larger automation system being developed to assist human air-traffic controllers and pilots. Focuses on results of piloted simulation, in which airline crews executed controller-issued descent advisories along standard curved-path arrival routes. Crews able to achieve arrival-time precision of plus or minus 20 seconds at metering fix. Analysis of errors generated in turns resulted in further enhancements of algorithm to increase accuracies of its predicted trajectories. Evaluations by pilots indicate general support for DA concept and provide specific recommendations for improvement.

Davis, Thomas J.↗

NASA NTRSDate not supplied

Quantifying Effects of Departure and Flight Time Uncertainty on Urban Air Mobility Operations

Demand capacity balancing is a key mechanism for maintaining safe and efficient Urban Air Mobility (UAM) operations. However, uncertainties such as departure delays and flight time variation may reduce the effectiveness of algorithms used for balancing and detrimentally impact the safety and efficiency of UAM operations. In this paper, the effects of these uncertainties on UAM operations are quantified by modeling a distribution of departure and flight time errors. A route network in the Dallas/Fort Worth metropolitan area was used to simulate traffic demand with and without uncertainty. Simulations were conducted with three main models of uncertainty – first uncertainty in departure time delay resulting in late takeoffs, second with uncertainty in flight times in addition to departure delays, and finally, uncertainty in departure times that cause either late or early takeoffs. Each of these simulations were performed using varied standard deviations to fully understand the effects of uncertainties. Results from these simulations were compared to a baseline simulation using the same parameters, but without any uncertainty. The results suggest that both safety and efficiency are significantly impacted by uncertainty even with relatively low uncertainty introduced. These results work towards quantifying the effects of uncertainty in flight scheduling for UAM. They will also aid in the further development of the demand capacity balancing algorithms for UAM operations and associated air traffic management.

Urban Air Mobility↗

NASA NTRSDate not supplied

Quantifying the Effects of Departure and Flight Time Uncertainty on Urban Air Mobility Operations

Demand capacity balancing is a key mechanism for maintaining safe and efficient Urban Air Mobility (UAM) operations. However, uncertainties such as departure delays and flight time variation may reduce the effectiveness of algorithms used for balancing and detrimentally impact the safety and efficiency of UAM operations. In this paper, the effects of these uncertainties on UAM operations are quantified by modeling a distribution of departure and flight time errors. A route network in the Dallas/Fort Worth metropolitan area was used to simulate traffic demand with and without uncertainty. Simulations were conducted with three main models of uncertainty – first uncertainty in departure time delay resulting in late takeoffs, second with uncertainty in flight times in addition to departure delays, and finally, uncertainty in departure times that cause either late or early takeoffs. Each of these simulations were performed using varied standard deviations to fully understand the effects of uncertainties. Results from these simulations were compared to a baseline simulation using the same parameters, but without any uncertainty. The results suggest that both safety and efficiency are significantly impacted by uncertainty even with relatively low uncertainty introduced. These results work towards quantifying the effects of uncertainty in flight scheduling for UAM. They will also aid in the further development of the demand capacity balancing algorithms for UAM operations and associated air traffic management.

Urban Air Mobility↗

NASA NTRS1972

An investigation of vehicle dependent aspects of terminal area ATC operation.

Description of a terminal area simulation which permits analysis and synthesis of current and advanced air traffic management system configurations including ground and airborne instrumentation and new and modified aircraft characteristics. Ground elements in the simulation include navigation aids, surveillance radars, communication links, air-route structuring, ATC procedures, airport geometries, and runway handling constraints. Airborne elements include traffic samples with individual aircraft performance and operating characteristics and aircraft navigation equipment. The simulation also contains algorithms for conflict detection, conflict resolution, sequencing and pilot-controller data links.

Britt, C. L., Jr.↗

NASA NTRS1972

Development of simulation techniques suitable for the analysis of air traffic control situations and instrumentation

A terminal area simulation is described which permits analysis and synthesis of current and advanced air traffic management system configurations including ground and airborne instrumentation and new and modified aircraft characteristics. Ground elements in the simulation include navigation aids, surveillance radars, communication links, air-route structuring, ATC procedures, airport geometries and runway handling constraints. Airborne elements include traffic samples with individual aircraft performance and operating characteristics and aircraft navigation equipment. The simulation also contains algorithms for conflict detection, conflict resolution, sequencing and pilot-controller data links. The simulation model is used to determine the sensitivities of terminal area traffic flow, safety and congestion to aircraft performance characteristics, avionics systems, and other ATC elements.

Source record↗