SEARCH · Engineering Papers

Results for “Routing algorithm”

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 109 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS2019

Airspace Technology Demonstration 3 (ATD-3): Dynamic Routes for Arrivals in Weather (DRAW) Technology Transfer Document Summary Version 2.0

Airspace Technology Demonstration – 3 (ATD-3) is part of NASA’s Airspace Operations and Safety Program (AOSP) – specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multi-year research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the third Research Transition Product (RTP) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan, which is Dynamic Routes for Arrivals in Weather (DRAW). This technology transfer consists of artifacts for DRAW Arrival Metering (AM) Operations delivered in June 2018, DRAW AM updates, and DRAW Extended Metering (XM) Operations. Blue highlighting indicates the new or modified deliverables. Some of the artifacts in this technology transfer have distribution restrictions that need to be followed. Distribution information is noted in each section. DRAW is a trajectory-based system that combines the legacy Dynamic Weather Routes (DWR) weather avoidance technology with an arrival-specific rerouting algorithm and arrival scheduler to improve traffic flows on weather-impacted arrival routes into major airports. First, DRAW identifies flights that could be rerouted to more efficient Standard Terminal Arrival Routes (STARs) that may have previously been impacted by weather. Second, when weather is impacting the arrival routing, DRAW proposes simple arrival route corrections that enable aircraft to stay on their flight plan while avoiding weather. The DRAW system proposes reroutes early enough to allow Time Based Flow Management (TBFM) to make the necessary schedule adjustments. As a result, metering operations can be sustained longer and more consistently in the presence of weather because the arrival schedule accounts for the dynamic routing intent of arrival flights to deviate around weather. The first DRAW tech transfer in June 2018 focused on arrival metering operations with the DRAW algorithm implemented in the NASA Center TRACON Automation System (CTAS) automation software. This tech transfer delivery includes updates for DRAW implemented in FAA’s TBFM 4.7 automation software and preliminary research into DRAW for XM operations.

Isaacson, Douglas R.↗

NASA NTRS2015

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Seventh Revision

This paper presents an overview of the seventh revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This paper supersedes the previous documentation and presents a modification to the algorithm referred to as the Airborne Spacing for Terminal Arrival Routes version 13 (ASTAR13). This airborne self-spacing concept contains both trajectory-based and state-based mechanisms for calculating the speeds required to achieve or maintain a precise spacing interval. The trajectory-based capability allows for spacing operations prior to the aircraft being on a common path. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm adds the state-based capability in support of evolving industry standards relating to airborne self-spacing.

Abbott, Terence S.↗

NASA NTRS2017

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Eighth Revision

This paper presents an overview of the eighth revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This paper supersedes the previous documentation and presents a modification to the algorithm referred to as the Airborne Spacing for Terminal Arrival Routes version 13 (ASTAR13). This airborne self-spacing concept contains both trajectory-based and state-based mechanisms for calculating the speeds required to achieve or maintain a precise spacing interval with another aircraft. The trajectory-based capability allows for spacing operations prior to the aircraft being on a common path. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm supports the evolving industry standards relating to airborne self-spacing.

Abbott, Terence S.↗

NASA NTRS2015

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Fifth Edition

This paper presents an overview of the fifth revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This algorithm is referred to as the Airborne Spacing for Terminal Arrival Routes version 12 (ASTAR12). This airborne self-spacing concept is trajectory-based, allowing for spacing operations prior to the aircraft being on a common path. Because this algorithm is trajectory-based, it also has the inherent ability to support required-time-of- arrival (RTA) operations. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm includes a ground speed feedback term to compensate for slower than expected traffic aircraft speeds based on the accepted air traffic control tendency to slow aircraft below the nominal arrival speeds when they are farther from the airport.

Abbott, Terence S.↗

NASA NTRS2012

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Third Revision

This paper presents an overview of the third major revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This algorithm is referred to as the Airborne Spacing for Terminal Arrival Routes version 11 (ASTAR11). This airborne self-spacing concept is trajectory-based, allowing for spacing operations prior to the aircraft being on a common path. Because this algorithm is trajectory-based, it also has the inherent ability to support required time-of-arrival (RTA) operations. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft.

Abbott, Terence S.↗

NASA NTRS2015

Optimizing Integrated Arrival, Departure and Surface Operations Under Uncertainty

In airports and surrounding terminal airspaces, the integration of arrival, departure and surface scheduling and routing have the potential to improve the operations efficiency. Recent research had developed mixed-integer-linear programming algorithm-based scheduler for integrated arrival and departure operations in the presence of uncertainty. This paper extends to the surface previous research performed by the authors to integrate taxiway and runway operations. The developed algorithm is capable of computing optimal aircraft schedules and routings that reflects the integration of air and ground operations. A preliminary study case is conducted for a set of thirteen aircraft evolving in a model of the Los Angeles International airport and surrounding terminal areas. Using historical data, a representative traffic scenario is constructed and probabilistic distributions of pushback delay and arrival gate delay are obtained. To assess the benefits of optimization, a First- Come-First-Serve algorithm approach comparison is realized. Evaluation results demonstrate that the optimization can help identifying runway sequencing and schedule that reduce gate waiting time without increasing average taxi times.

Bosson, Christabelle↗

NASA NTRS2015

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Sixth Revision

This paper presents an overview of the sixth revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This algorithm is referred to as the Airborne Spacing for Terminal Arrival Routes version 13 (ASTAR13). This airborne self-spacing concept contains both trajectory-based and state-based mechanisms for calculating the speeds required to achieve or maintain a precise spacing interval. The trajectory-based capability allows for spacing operations prior to the aircraft being on a common path. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm adds the state-based capability in support of evolving industry standards relating to airborne self-spacing.

Abbott, Terence S.↗

NASA NTRS2013

Costs of Limiting Route Optimization to Published Waypoints in the Traffic Aware Planner

The Traffic Aware Planner (TAP) is an airborne advisory tool that generates optimized, traffic-avoiding routes to support the aircraft crew in making strategic reroute requests to Air Traffic Control (ATC). TAP is derived from a research-prototype self-separation tool, the Autonomous Operations Planner (AOP), in which optimized route modifications that avoid conflicts with traffic and weather, using waypoints at explicit latitudes and longitudes (a technique supported by self-separation concepts), are generated by maneuver patterns applied to the existing route. For use in current-day operations in which trajectory changes must be requested from ATC via voice communication, TAP produces optimized routes described by advisories that use only published waypoints prior to a reconnection waypoint on the existing route. We describe how the relevant algorithms of AOP have been modified to implement this requirement. The modifications include techniques for finding appropriate published waypoints in a maneuver pattern and a method for combining the genetic algorithm of AOP with an exhaustive search of certain types of advisory. We demonstrate methods to investigate the increased computation required by these techniques and to estimate other costs (measured in terms such as time to destination and fuel burned) that may be incurred when only published waypoints are used.

TASAR↗

NASA NTRS2016

Design, Development, and Testing of a UAV Hardware-in-the-Loop Testbed for Aviation and Airspace Prognostics Research

The airspace is becoming more and more complicated, and will continue to do so in the future with the integration of Unmanned Aerial Vehicles (UAVs), autonomy, spacecraft, other forms of aviation technology into the airspace. The new technology and complexity increases the importance and difficulty of safety assurance. Additionally, testing new technologies on complex aviation systems & systems of systems can be very difficult, expensive, and sometimes unsafe in real life scenarios. Prognostic methodology provides an estimate of the health and risks of a component, vehicle, or airspace and knowledge of how that will change over time. That measure is especially useful in safety determination, mission planning, and maintenance scheduling. The developed testbed will be used to validate prediction algorithms for the real-time safety monitoring of the National Airspace System (NAS) and the prediction of unsafe events. The framework injects flight related anomalies related to ground systems, routing, airport congestion, etc. to test and verify algorithms for NAS safety. In our research work, we develop a live, distributed, hardware-in-the-loop testbed for aviation and airspace prognostics along with exploring further research possibilities to verify and validate future algorithms for NAS safety. The testbed integrates virtual aircraft using the X-Plane simulator and X-PlaneConnect toolbox, UAVs using onboard sensors and cellular communications, and hardware in the loop components. In addition, the testbed includes an additional research framework to support and simplify future research activities. It enables safe, accurate, and inexpensive experimentation and research into airspace and vehicle prognosis that would not have been possible otherwise. This paper describes the design, development, and testing of this system. Software reliability, safety and latency are some of the critical design considerations in development of the testbed. Integration of HITL elements in the development phases and veri cation/ validation are key elements to this report.

HITL↗

NASA NTRS2011

Onboard Radar Processing Development for Rapid Response Applications

We are developing onboard processor (OBP) technology to streamline data acquisition on-demand and explore the potential of the L-band SAR instrument onboard the proposed DESDynI mission and UAVSAR for rapid response applications. The technology would enable the observation and use of surface change data over rapidly evolving natural hazards, both as an aid to scientific understanding and to provide timely data to agencies responsible for the management and mitigation of natural disasters. We are adapting complex science algorithms for surface water extent to detect flooding, snow/water/ice classification to assist in transportation/ shipping forecasts, and repeat-pass change detection to detect disturbances. We are near completion of the development of a custom FPGA board to meet the specific memory and processing needs of L-band SAR processor algorithms and high speed interfaces to reformat and route raw radar data to/from the FPGA processor board. We have also developed a high fidelity Matlab model of the SAR processor that is modularized and parameterized for ease to prototype various SAR processor algorithms targeted for the FPGA. We will be testing the OBP and rapid response algorithms with UAVSAR data to determine the fidelity of the products.

dual polarized data↗

NASA NTRSDate not supplied

Detect-and-Avoid Maneuver Planning: Benefits of Including Route Recapture

Development of Detect-and-avoid (DAA) systems’ maneuver guidance requirements at RTCA has centered on tactical maneuvers away from the intruder. Recapturing the flight-plan route the initial maneuver is not directly taken into account by most DAA maneuver guidance algorithms. This work demonstrates potential challenges and inefficiencies that can arise in recapturing the route after resolving a conflict. Horizontal resolution trajectories for a test matrix of encounters with varying aircraft speeds and geometries are computed by minimizing either flight time or deviation to serve as a baseline. Turn directions computed from a reference DAA algorithm coupled with a pilot selection model and a second algorithm called Autoresolver (AR) are compared to these baseline resolution trajectories. Baseline results show that turning into the intruder yields favorable cost for most encounters. Additional analysis of pilot response data shows that only three-fourths of pilots’ horizontal maneuvers turn into intruders, a percentage much lower than the baseline results. Improvement to a DAA guidance algorithm based on findings in this work is discussed.

Route Recapture↗

NASA NTRSDate not supplied

Detect-and-Avoid Maneuver Planning: Benefits of Including Route Recapture

Route Recapture↗

NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗

NASA NTRS2012

Fault Mitigation Schemes for Future Spaceflight Multicore Processors

Future planetary exploration missions demand significant advances in on-board computing capabilities over current avionics architectures based on a single-core processing element. The state-of-the-art multi-core processor provides much promise in meeting such challenges while introducing new fault tolerance problems when applied to space missions. Software-based schemes are being presented in this paper that can achieve system-level fault mitigation beyond that provided by radiation-hard-by-design (RHBD). For mission and time critical applications such as the Terrain Relative Navigation (TRN) for planetary or small body navigation, and landing, a range of fault tolerance methods can be adapted by the application. The software methods being investigated include Error Correction Code (ECC) for data packet routing between cores, virtual network routing, Triple Modular Redundancy (TMR), and Algorithm-Based Fault Tolerance (ABFT). A robust fault tolerance framework that provides fail-operational behavior under hard real-time constraints and graceful degradation will be demonstrated using TRN executing on a commercial Tilera(R) processor with simulated fault injections.

software based↗

NASA NTRS2016

Initial Analysis of and Predictive Model Development for Weather Reroute Advisory Use

In response to severe weather conditions, traffic management coordinators specify reroutes to route air traffic around affected regions of airspace. Providing analysis and recommendations of available reroute options would assist the traffic management coordinators in making more efficient rerouting decisions. These recommendations can be developed by examining historical data to determine which previous reroute options were used in similar weather and traffic conditions. Essentially, using previous information to inform future decisions. This paper describes the initial steps and methodology used towards this goal. A method to extract relevant features from the large volume of weather data to quantify the convective weather scenario during a particular time range is presented. Similar routes are clustered. A description of the algorithm to identify which cluster of reroute advisories were actually followed by pilots is described. Models built for fifteen of the top twenty most frequently used reroute clusters correctly predict the use of the cluster for over 60 of the test examples. Results are preliminary but indicate that the methodology is worth pursuing with modifications based on insight gained from this analysis.

machine learning↗

NASA NTRS2016

A Review of Function Allocation and En Route Separation Assurance

Today's air traffic control system has reached a limit to the number of aircraft that can be safely managed at the same time. This air traffic capacity bottleneck is a critical problem along the path to modernization for air transportation. The design of the next separation assurance system to address this problem is a cornerstone of air traffic management research today. This report reviews recent work by NASA and others in the areas of function allocation and en route separation assurance. This includes: separation assurance algorithms and technology prototypes; concepts of operations and designs for advanced separation assurance systems; and specific investigations into air-ground and human-automation function allocation.

Lewis, Timothy A.↗

NASA NTRS1995

Scheduling logic for Miles-In-Trail traffic management

This paper presents an algorithm which can be used for scheduling arrival air traffic in an Air Route Traffic Control Center (ARTCC or Center) entering a Terminal Radar Approach Control (TRACON) Facility . The algorithm aids a Traffic Management Coordinator (TMC) in deciding how to restrict traffic while the traffic expected to arrive in the TRACON exceeds the TRACON capacity. The restrictions employed fall under the category of Miles-in-Trail, one of two principal traffic separation techniques used in scheduling arrival traffic . The algorithm calculates aircraft separations for each stream of aircraft destined to the TRACON. The calculations depend upon TRACON characteristics, TMC preferences, and other parameters adapted to the specific needs of scheduling traffic in a Center. Some preliminary results of traffic simulations scheduled by this algorithm are presented, and conclusions are drawn as to the effectiveness of using this algorithm in different traffic scenarios.

Synnestvedt, Robert G.↗

NASA NTRS1998

Using Collective Intelligence to Route Internet Traffic

A Collective Intelligence (COIN) is a community of interacting reinforcement learning (RL) algorithms designed so that their collective behavior maximizes a global utility function. We introduce the theory of COINs, then present experiments using that theory to design COINs to control internet traffic routing. These experiments indicate that COINs outperform previous RL-based systems for such routing that have previously been investigated.

Wolpert, David H.↗