SEARCH · Search NASA

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 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS2013

Acceptability of Flight Deck-Based Interval Management Crew Procedures

The Interval Management for Near-term Operations Validation of Acceptability (IM-NOVA) experiment was conducted at the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC) in support of the NASA Next Generation Air Transportation System (NextGen) Airspace Systems Program's Air Traffic Management Technology Demonstration - 1 (ATD-1). ATD-1 is intended to showcase an integrated set of technologies that provide an efficient arrival solution for managing aircraft using NextGen surveillance, navigation, procedures, and automation for both airborne and ground-based systems. The goal of the IM-NOVA experiment was to assess if procedures outlined by the ATD-1 Concept of Operations, when used with a minimum set of Flight deck-based Interval Management (FIM) equipment and a prototype crew interface, were acceptable to and feasible for use by flight crews in a voice communications environment. To investigate an integrated arrival solution using ground-based air traffic control tools and aircraft automatic dependent surveillance broadcast (ADS-B) tools, the LaRC FIM system and the Traffic Management Advisor with Terminal Metering and Controller Managed Spacing tools developed at the NASA Ames Research Center (ARC) were integrated in LaRC's Air Traffic Operations Laboratory. Data were collected from 10 crews of current, qualified 757/767 pilots asked to fly a high-fidelity, fixed based simulator during scenarios conducted within an airspace environment modeled on the Dallas-Fort Worth (DFW) Terminal Radar Approach Control area. The aircraft simulator was equipped with the Airborne Spacing for Terminal Area Routes algorithm and a FIM crew interface consisting of electronic flight bags and ADS-B guidance displays. Researchers used "pseudo-pilot" stations to control 24 simulated aircraft that provided multiple air traffic flows into DFW, and recently retired DFW air traffic controllers served as confederate Center, Feeder, Final, and Tower controllers. Pilot participant feedback indicated that the procedures used by flight crews to receive and execute interval management (IM) clearances in a voice communications environment were logical, easy to follow, did not contain any missing or extraneous steps, and required the use of an acceptable level of workload. The majority of the pilot participants found the IM concept, in addition to the proposed FIM crew procedures, to be acceptable and indicated that the ATD-1 procedures can be successfully executed in a near-term NextGen environment.

Murdock, Jennifer L.↗

NASA NTRS2014

802.11s Wireless Mesh Network Visualization Application

Results of past experimentation at NASA Johnson Space Center showed that the IEEE 802.11s standard has better performance than the widely implemented alternative protocol B.A.T.M.A.N (Better Approach to Mobile Ad hoc Networking). 802.11s is now formally incorporated into the Wi- Fi 802.11-2012 standard, which specifies a hybrid wireless mesh networking protocol (HWMP). In order to quickly analyze changes to the routing algorithm and to support optimizing the mesh network behavior for our intended application a visualization tool was developed by modifying and integrating open source tools.

Mauldin, James Alexander↗

NASA NTRS2019

Quantifying Water Storage Change and Land Subsidence Induced by Reservoir Impoundment Using GRACE, Landsat, and GPS Data

The construction of hydropower dams is a common strategy to support a country's increasing need for electricity and river water management for industry and agriculture. Although the hydrological and geophysical impacts of water relocation are usually assessed prior to impoundment, their accuracy is generally limited due to the lack of in situ observations, especially in a remote area. This study presents a workflow to quantify the terrestrial water storage change (TWS) and land subsidence induced by a reservoir's water impoundment using multiple satellite observations (GRACE, Landsat), land surface models (CABLE, GLDAS, NCEP, ECMWF), and GPS data. The study site is the Bakun Dam, located in Sarawak, Malaysia, which is the largest hydropower dam in Southeast Asia. Commencing operation in late 2010, the dam induced a change of water mass and lake surface area that was clearly observed by GRACE and Landsat observations, respectively. During the 17-month impounding period (from August 2010 to December 2011), GRACE observed a dramatic increase of approximately 200 mm equivalent water height, while Landsat detected an increased lake extent of around 600 km2. In this paper, a forward model is developed to determine the increased water surface level corresponding to GRACE observations, estimated to be about 120 m. In contrast to GRACE, the TWS derived from land surface models cannot capture the increased TWS, due to the lack of reservoir routing algorithms in the models. In addition, the land subsidence was calculated using the disk load model constructed based on the GRACE-derived lake level and Landsat-derived lake extent; the result is validated with the GPS data from BIN1 station, located at the western coast of Borneo. The commencement stage of the Bakun Dam induces the large-scale land subsidence, which causes the GPS-BIN1 station to subside by ~9 mm, and move toward the Bakun Lake by ~4 mm. Computation of the surface displacements directly from GRACE spherical harmonic coefficient data fails to capture the subsidence feature, mainly due to the truncation error. Overall, this study demonstrates that evaluating GRACE in conjunction with Landsat, LSMs, and GPS data allows the exploitation of the gravity signal at a much smaller spatial scale than its intrinsic resolution. Benefiting from global coverage, the newly developed satellite-based algorithm is a valuable tool for assessing the impacts of reservoir operation on hydrological and geophysical changes from local to regional scales.

Natthachet Tangdamrongsub↗

NASA NTRS2019

Quantifying Water Storage Change and Land Subsidence Induced by Reservoir Impoundment Using GRACE, Landsat, and GPS Data

The construction of hydropower dams is a common strategy to support a country's increasing need for electricityand river water management for industry and agriculture. Although the hydrological and geophysical impacts ofwater relocation are usually assessed prior to impoundment, their accuracy is generally limited due to the lack ofin situ observations, especially in a remote area. This study presents a workflow to quantify the terrestrial waterstorage change (TWS) and land subsidence induced by a reservoir's water impoundment using multiple satelliteobservations (GRACE, Landsat), land surface models (CABLE, GLDAS, NCEP, ECMWF), and GPS data. The studysite is the Bakun Dam, located in Sarawak, Malaysia, which is the largest hydropower dam in Southeast Asia.Commencing operation in late 2010, the dam induced a change of water mass and lake surface area that wasclearly observed by GRACE and Landsat observations, respectively. During the 17-month impounding period(from August 2010 to December 2011), GRACE observed a dramatic increase of approximately 200mmequivalent water height, while Landsat detected an increased lake extent of around 600 km2. In this paper, aforward model is developed to determine the increased water surface level corresponding to GRACE observations,estimated to be about 120 m. In contrast to GRACE, the TWS derived from land surface models cannotcapture the increased TWS, due to the lack of reservoir routing algorithms in the models. In addition, the landsubsidence was calculated using the disk load model constructed based on the GRACE-derived lake level andLandsat-derived lake extent; the result is validated with the GPS data from BIN1 station, located at the westerncoast of Borneo. The commencement stage of the Bakun Dam induces the large-scale land subsidence, whichcauses the GPS-BIN1 station to subside by ~9 mm, and move toward the Bakun Lake by ~4 mm. Computation ofthe surface displacements directly from GRACE spherical harmonic coefficient data fails to capture the subsidencefeature, mainly due to the truncation error. Overall, this study demonstrates that evaluating GRACE inconjunction with Landsat, LSMs, and GPS data allows the exploitation of the gravity signal at a much smallerspatial scale than its intrinsic resolution. Benefiting from global coverage, the newly developed satellite-basedalgorithm is a valuable tool for assessing the impacts of reservoir operation on hydrological and geophysicalchanges from local to regional scales.

Tangdamrongsub, Natthachet↗

NASA NTRS1991

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗

NASA NTRS2023

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts: Fifth Revision

This document describes an algorithm for the generation of a four dimensional trajectory. Input data for this algorithm are similar to an augmented Standard Terminal Arrival (STAR) with the augmentation in the form of altitude or speed crossing restrictions at waypoints on the route. The algorithm calculates the altitude, speed, along path distance, and along path time for each of these waypoints. Wind data at each of these waypoints are also used for the calculation of ground speed and turn radius. This revision of the algorithm now accommodates linear decelerations between two speed-constrained waypoints. While this modification may appear trivial, the calculation of the deceleration rate cannot be accomplished using a closed-form solution. An iterative solution was developed that allowed for the variability of path distance due to speed influence on turn radii, Mach-CAS transition altitude, and the impact of wind on ground speed in calculating an accurate deceleration value.

Aircraft Operations↗

NASA NTRS2018

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts: Fourth Revision

Abbott, Terence S.↗

NASA NTRS2010

A Revised Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts

Aircraft operations↗

NASA NTRS2007

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts

This document describes an algorithm for the generation of a four dimensional aircraft trajectory. Input data for this algorithm are similar to an augmented Standard Terminal Arrival Route (STAR) with the augmentation in the form of altitude or speed crossing restrictions at waypoints on the route. Wind data at each waypoint are also inputs into this algorithm. The algorithm calculates the altitude, speed, along path distance, and along path time for each waypoint.

Aircraft operations↗

NASA NTRS2012

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts: Third Revision

Abbott, Terence S.↗

NASA NTRS1991

A workstation-based evaluation of a far-field route planner for helicopters

Helicopter flight missions at very low, nap of the Earth, altitudes place a heavy workload on the pilot. To aid in reducing this workload, Ames Research Center has been investigating various types of automated route planners. As part of an automated preflight mission planner, a route planner algorithm aids in selecting the overall (far-field) route to be flown. During the mission, the route planner can be used to replan a new route in case of unexpected threats or change in mission requirements. An evaluation of a candidate route planning algorithm, based on dynamic programming techniques is described. This algorithm meets most of the requirements for route planning, both preflight and during the mission. In general, the requirements are to minimize the distance and/or fuel and the deviation from a flight time schedule, and must be flyable within the constraints of available fuel and time.

Warner, David N., Jr.↗

NASA NTRS2000

User's Guide for Computer Program that Routes Signal Traces

This disk contains both a FORTRAN computer program and the corresponding user's guide that facilitates both its incorporation into your system and its utility. The computer program represents an efficient algorithm that routes signal traces on layers of a printed circuit with both through-pins and surface mounts. The computer program included is an implementation of the ideas presented in the theoretical paper titled "A Formal Algorithm for Routing Signal Traces on a Printed Circuit Board", NASA TP-3639 published in 1996. The computer program in the "connects" file can be read with a FORTRAN compiler and readily integrated into software unique to each particular environment where it might be used.

Hedgley, David R., Jr.↗

NASA NTRS2011

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗

NASA NTRS1987

Route planning in a four-dimensional environment

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Slack, M. G.↗

NASA NTRS2021

A Mathematical Analysis of an Example Delay Tolerant Network using the Theory of Sheaves

NASA’s High-Data Rate Architecture (HiDRA) project is working towards a general yet practical toolkit and knowledge base to help usher in the era of new technologies for space systems communications, such as optical links. The High-Rate Delay Tolerant Networking (HDTN) implementation falls under the umbrellas of both the toolkit and the knowledge base, as its advancements illuminate more general areas of Delay Tolerant Networking (DTN) that need growth. The goal of this paper is to explore the usage of particular mathematical machineries, namely temporal flow networks and sheaves, to identify fundamental, underlying structures in DTN for space systems. Satellites, space assets, ground stations, etc. give rise to a disconnected network, and it is the goal of DTN to glue disparate links together into a cohesive system, that is, a network. Depending on a given link, the latencies might be beyond that which the Transmission Control Protocol (TCP) can handle, and contact times might have one-way light times in excess of minute (sometimes significantly longer). Some links might be periodic (say, due to orbital mechanics) or they might not be. This diversity has made it difficult to probe the underlying structure. An immediate consequence is that DTNs in practice today are controlled by globally distributed contact plans (schedules), which are the input to the contact graph routing (CGR) algorithm. While this is effective for smaller networks, it will be very difficult to scale for future networks. Deeper and more rigorous theory is needed to bring DTN to the next evolutionary step. To this end, this paper introduces and suggests a mathematical framework for DTN, and applies it to a space network that is simulated using an orbital analysis toolkit. The tag-line for the structure known as sheaves is that they are the mathematically precise way of gluing local data together into unique, global data. If we consider routing, we see that networking is a “sheafy” science. We then discuss a simplified sheaf model, known as the cellular sheaf. The sheaf-theoretic analysis is presented and discussed, as it is hoped that this and related papers will help form the primordial ooze of DTN theory. Finally there is a section of future work suggesting follow-on research.

Delay Tolerant Networking↗

NASA NTRS2004

Computationally-Efficient Minimum-Time Aircraft Routes in the Presence of Winds

A computationally efficient algorithm for minimizing the flight time of an aircraft in a variable wind field has been invented. The algorithm, referred to as Neighboring Optimal Wind Routing (NOWR), is based upon neighboring-optimal-control (NOC) concepts and achieves minimum-time paths by adjusting aircraft heading according to wind conditions at an arbitrary number of wind measurement points along the flight route. The NOWR algorithm may either be used in a fast-time mode to compute minimum- time routes prior to flight, or may be used in a feedback mode to adjust aircraft heading in real-time. By traveling minimum-time routes instead of direct great-circle (direct) routes, flights across the United States can save an average of about 7 minutes, and as much as one hour of flight time during periods of strong jet-stream winds. The neighboring optimal routes computed via the NOWR technique have been shown to be within 1.5 percent of the absolute minimum-time routes for flights across the continental United States. On a typical 450-MHz Sun Ultra workstation, the NOWR algorithm produces complete minimum-time routes in less than 40 milliseconds. This corresponds to a rate of 25 optimal routes per second. The closest comparable optimization technique runs approximately 10 times slower. Airlines currently use various trial-and-error search techniques to determine which of a set of commonly traveled routes will minimize flight time. These algorithms are too computationally expensive for use in real-time systems, or in systems where many optimal routes need to be computed in a short amount of time. Instead of operating in real-time, airlines will typically plan a trajectory several hours in advance using wind forecasts. If winds change significantly from forecasts, the resulting flights will no longer be minimum-time. The need for a computationally efficient wind-optimal routing algorithm is even greater in the case of new air-traffic-control automation concepts. For air-traffic-control automation, thousands of wind-optimal routes may need to be computed and checked for conflicts in just a few minutes. These factors motivated the need for a more efficient wind-optimal routing algorithm.

Jardin, Matthew R.↗

NASA NTRS2012

Airborne Precision Spacing for Dependent Parallel Operations Interface Study

This paper describes a usability study of proposed cockpit interfaces to support Airborne Precision Spacing (APS) operations for aircraft performing dependent parallel approaches (DPA). NASA has proposed an airborne system called Pair Dependent Speed (PDS) which uses their Airborne Spacing for Terminal Arrival Routes (ASTAR) algorithm to manage spacing intervals. Interface elements were designed to facilitate the input of APS-DPA spacing parameters to ASTAR, and to convey PDS system information to the crew deemed necessary and/or helpful to conduct the operation, including: target speed, guidance mode, target aircraft depiction, and spacing trend indication. In the study, subject pilots observed recorded simulations using the proposed interface elements in which the ownship managed assigned spacing intervals from two other arriving aircraft. Simulations were recorded using the Aircraft Simulation for Traffic Operations Research (ASTOR) platform, a medium-fidelity simulator based on a modern Boeing commercial glass cockpit. Various combinations of the interface elements were presented to subject pilots, and feedback was collected via structured questionnaires. The results of subject pilot evaluations show that the proposed design elements were acceptable, and that preferable combinations exist within this set of elements. The results also point to potential improvements to be considered for implementation in future experiments.

Volk, Paul M.↗

NASA NTRS2015

Air Traffic Management Technology Demostration Phase 1 (ATD) Interval Management for Near-Term Operations Validation of Acceptability (IM-NOVA) Experiment

The Interval Management for Near-term Operations Validation of Acceptability (IM-NOVA) experiment was conducted at the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC) in support of the NASA Airspace Systems Program's Air Traffic Management Technology Demonstration-1 (ATD-1). ATD-1 is intended to showcase an integrated set of technologies that provide an efficient arrival solution for managing aircraft using Next Generation Air Transportation System (NextGen) surveillance, navigation, procedures, and automation for both airborne and ground-based systems. The goal of the IMNOVA experiment was to assess if procedures outlined by the ATD-1 Concept of Operations were acceptable to and feasible for use by flight crews in a voice communications environment when used with a minimum set of Flight Deck-based Interval Management (FIM) equipment and a prototype crew interface. To investigate an integrated arrival solution using ground-based air traffic control tools and aircraft Automatic Dependent Surveillance-Broadcast (ADS-B) tools, the LaRC FIM system and the Traffic Management Advisor with Terminal Metering and Controller Managed Spacing tools developed at the NASA Ames Research Center (ARC) were integrated into LaRC's Air Traffic Operations Laboratory (ATOL). Data were collected from 10 crews of current 757/767 pilots asked to fly a high-fidelity, fixed-based simulator during scenarios conducted within an airspace environment modeled on the Dallas-Fort Worth (DFW) Terminal Radar Approach Control area. The aircraft simulator was equipped with the Airborne Spacing for Terminal Area Routes (ASTAR) algorithm and a FIM crew interface consisting of electronic flight bags and ADS-B guidance displays. Researchers used "pseudo-pilot" stations to control 24 simulated aircraft that provided multiple air traffic flows into the DFW International Airport, and recently retired DFW air traffic controllers served as confederate Center, Feeder, Final, and Tower controllers. Analyses of qualitative data revealed that the procedures used by flight crews to receive and execute interval management (IM) clearances in a voice communications environment were logical, easy to follow, did not contain any missing or extraneous steps, and required the use of an acceptable workload level. The majority of the pilot participants found the IM concept, in addition to the proposed FIM crew procedures, to be acceptable and indicated that the ATD-1 procedures could be successfully executed in a nearterm NextGen environment. Analyses of quantitative data revealed that the proposed procedures were feasible for use by flight crews in a voice communications environment. The delivery accuracy at the achieve-by point was within +/-5 sec, and the delivery precision was less than 5 sec. Furthermore, FIM speed commands occurred at a rate of less than one per minute, and pilots found the frequency of the speed commands to be acceptable at all times throughout the experiment scenarios.

Kibler, Jennifer L.↗