Search NASA⌕ Search

SEARCH · Search NASA

Results for “routing problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 73 records · Page 4

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

Ng, Hok K.↗

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

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

Tomboulian, Sherryl↗

Is there a role for a test controller in the development of new ATC equipment?

Earl Wiener points out that human factors problems fixed during the R & D stage are paid for once. When they are not fixed during R & D, they are then paid for every day. How users are involved in the R & D process to assist in developing equipment is a critical issue. Effective involvement can produce real improvements. Ineffective involvement can produce inefficient kludges or systems that are actually dangerous. The underlying problem is the management of information and ideas. To develop a really generative system a great deal would have to change in the way that the FAA innovates. Use of test controllers would solve only some of the problems. For instance, we have cockpit resource management now for pilots; we may have it soon for controllers. But the management of ideas in the innovation process also needs intellectual resource management. Simply involving users is not enough. Brought in at the wrong point in the development process, users can block or compromise innovation. User involvement must be carefully considered. A test controller may be one solution to this problem. It might be necessary to have several kinds of test controllers (en route versus TRACON, for instance). No doubt further problems would surface in getting test controllers into operation. I would recommend that the FAA engage in a series of case studies of controller involvement in the innovation process. A systematic comparison of effective and ineffective cases would do much to clarify what we ought to do in the future. Unfortunately, I have been unable to find any cases where test controllers have been used. Perhaps we need to create some, to see how they work.

Westrum, Ron↗

Communications network design and costing model programmers manual

Otpimization algorithms and techniques used in the communications network design and costing model for least cost route and least cost network problems are examined from the programmer's point of view. All system program modules, the data structures within the model, and the files which make up the data base are described.

Logan, K. P.↗

Numerical solution of flame sheet problems with and without multigrid methods

Flame sheet problems are on the natural route to the numerical solution of multidimensional flames, which, in turn, are important in many engineering applications. In order to model the structure of flames more accurately, we use the vorticity-velocity formulation of the fluid flow equations, as opposed to the streamfunction-vorticity approach. The numerical solution of the resulting nonlinear coupled elliptic partial differential equations involves a pseudo transient process and a steady state Newton iteration. Rather than working with dimensionless variables, we introduce scale factors that can yield significant savings in the execution time. In this context, we also investigate the applicability and performance of several multigrid methods, focusing on nonlinear damped Newton multigrid, using either one way or correction schemes.

Douglas, Craig C.↗

An Elementary Algorithm for Autonomous Air Terminal Merging and Interval Management

A central element of air traffic management is the safe merging and spacing of aircraft during the terminal area flight phase. This paper derives and examines an algorithm for the merging and interval managing problem for Standard Terminal Arrival Routes. It describes a factor analysis for performance based on the distribution of arrivals, the operating period of the terminal, and the topology of the arrival routes; then presents results from a performance analysis and from a safety analysis for a realistic topology based on typical routes for a runway at Phoenix International Airport. The heart of the safety analysis is a statistical derivation on how to conduct a safety analysis for a local simulation when the safety requirement is given for the entire airspace.

White, Allan L.↗

Analysis of Impacts of Terminal Restrictions on Departures in D10 TRACON

The D10 – Dallas-Fort Worth Terminal Radar Approach CONtrol (TRACON) is an air traffic facility that controls and manages aircraft and airspace that consists of multiple airports located in the North Texas area. From an air traffic management standpoint, one of the main challenges in the D10 TRACON is the departure fix capacity as multiple airports compete for resources. This problem is magnified when en route demand/capacity imbalance and inclement weather around the TRACON reduce the capacity at the terminal fixes. This leads to multiple, dynamic Traffic Management Initiative (TMI) restrictions being issued by the Air Traffic Control (ATC) on departing flights. This, in turn, propagates delay to the surface of each airport within the metroplex. The NASA Airspace Technology Demonstration 2 (ATD-2) Phase 3 is deployed in D10 to demonstrate new technologies developed to manage the Integrated Arrival, Departure, and Surface (IADS) traffic in a metroplex environment where multiple airports are interacting and sharing resources at the terminal boundary. This paper uses the ATD-2 terminal restriction data collected in the D10 TRACON to quantify the impact of restrictions on the demand, analyze the relation between terminal restrictions and departure taxi time on airport surface, and establish relationships between restrictions and surface delay. We found that the restrictions on departure flights have a direct adverse effect on departure excess taxi time on the airport surface.

ATD-2↗

Analysis of Impacts of Terminal Restrictions on Departures in D10 TRACON

The D10 – Dallas-Fort Worth Terminal Radar Approach CONtrol (TRACON) is an air traffic facility that controls and manages aircraft and airspace that consists of multiple airports located in the North Texas area. From an air traffic management standpoint, one of the main challenges in the D10 TRACON is the departure fix capacity as multiple airports compete for resources. This problem is magnified when en route demand/capacity imbalance and inclement weather around the TRACON reduce the capacity at the terminal fixes. This leads to multiple, dynamic Traffic Management Initiative (TMI) restrictions being issued by the Air Traffic Control (ATC) on departing flights. This, in turn, propagates delay to the surface of each airport within the metroplex. The NASA Airspace Technology Demonstration 2 (ATD-2) Phase 3 is deployed in D10 to demonstrate new technologies developed to manage the Integrated Arrival, Departure, and Surface (IADS) traffic in a metroplex environment where multiple airports are interacting and sharing resources at the terminal boundary. This paper uses the ATD-2 terminal restriction data collected in the D10 TRACON to quantify the impact of restrictions on the demand, analyze the relation between terminal restrictions and departure taxi time on airport surface, and establish relationships between restrictions and surface delay. We found that the restrictions on departure flights have a direct adverse effect on departure excess taxi time on the airport surface.

ATD-2↗

En route Spacing Tool: Efficient Conflict-free Spacing to Flow-Restricted Airspace

This paper describes the Air Traffic Management (ATM) problem within the U.S. of flow-restricted en route airspace, an assessment of its impact on airspace users, and a set of near-term tools and procedures to resolve the problem. The FAA is committed, over the next few years, to deploy the first generation of modem ATM decision support tool (DST) technology under the Free-Flight Phase-1 (FFp1) program. The associated en route tools include the User Request Evaluation Tool (URET) and the Traffic Management Advisor (TMA). URET is an initial conflict probe (ICP) capability that assists controllers with the detection and resolution of conflicts in en route airspace. TMA orchestrates arrivals transitioning into high-density terminal airspace by providing controllers with scheduled times of arrival (STA) and delay feedback advisories to assist with STA conformance. However, these FFPl capabilities do not mitigate the en route Miles-In-Trail (MIT) restrictions that are dynamically applied to mitigate airspace congestion. National statistics indicate that en route facilities (Centers) apply Miles-In-Trail (MIT) restrictions for approximately 5000 hours per month. Based on results from this study, an estimated 45,000 flights are impacted by these restrictions each month. Current-day practices for implementing these restrictions result in additional controller workload and an economic impact of which the fuel penalty alone may approach several hundred dollars per flight. To mitigate much of the impact of these restrictions on users and controller workload, a DST and procedures are presented. The DST is based on a simple derivative of FFP1 technology that is designed to introduce a set of simple tools for flow-rate (spacing) conformance and integrate them with conflict-probe capabilities. The tool and associated algorithms are described based on a concept prototype implemented within the CTAS baseline in 1995. A traffic scenario is used to illustrate the controller's use of the tool, and potential display options are presented for future controller evaluation.

Green, S.↗

Graphical interfaces for cooperative planning systems

Based on a cognitive task analysis of 5 airline flight crews in a simulator study, researchers have designed a testbed for studying computer aids for en route flight path planning. This testbed runs on a Mac II controlling three color monitors, and is being used to study the design of aids for both dispatchers and flight crews. Specifically, the research focuses on design concepts for developing cooperative problem-solving systems. We use en route flight planning (selecting alternate routes or destinations due to unanticipated weather, traffic, malfunctions, etc.) as the context for studying the design of such systems. Researchers are currently exploring three questions in this test environment: (1) When interacting with a flight planning aid, how does the role of the pilot influence overall system performance; (2) Can the architecture for a cooperative planning system be built around Sacerdoti's (1983) concept of an abstraction hierarchy, where the pilot can interact with the system at many different levels of detail (but where the computer aid by default handles lower level details that the pilot has chosen not to deat with); and (3) Can graphical displays and direct manipulation of these displays provide perceptual enhancements (Larkin and Simon, 1987) of the pilot's problem-solving activities. Information is given in viewgraph form.

Smith, Philip J.↗

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗

ATC simulation of helicopter IFR approaches into major terminal areas using RNAV, MLS, and CDTI

The introduction of independent helicopter IFR routes at hub airports was investigated in a real time air traffic control system simulation involving a piloted helicopter simulator, computer generated air traffic, and air traffic controllers. The helicopter simulator was equipped to fly area navigation (RNAV) routes and microwave landing system approaches. Problems studied included: (1) pilot acceptance of the approach procedure and tracking accuracy; (2) ATC procedures for handling a mix of helicopter and fixed wing traffic; and (3) utility of the cockpit display of traffic information (CDTI) for the helicopter in the hub airport environment. Results indicate that the helicopter routes were acceptable to the subject pilots and were noninterfering with fixed wing traffic. Merging and spacing maneuvers using CDTI were successfully carried out by the pilots, but controllers had some reservations concerning the acceptability of the CDTI procedures.

Tobias, L.↗

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗

Fully automated urban traffic system

The replacement of the driver with an automatic system which could perform the functions of guiding and routing a vehicle with a human's capability of responding to changing traffic demands was discussed. The problem was divided into four technological areas; guidance, routing, computing, and communications. It was determined that the latter three areas being developed independent of any need for fully automated urban traffic. A guidance system that would meet system requirements was not being developed but was technically feasible.

Dobrotin, B. M.↗

NextGen Operational Improvements: Will they Improve Human Performance

Modernization of the National Airspace System depends critically on the development of advanced technology, including cutting-edge automation, controller decision-support tools and integrated on-demand information. The Next Generation Air Transportation System national plan envisions air traffic control tower automation that proposes solutions for seven problems: 1) departure metering, 2) taxi routing, 3) taxi and runway scheduling, 4) departure runway assignments, 5) departure flow management, 6) integrated arrival and departure scheduling and 7) runway configuration management. Government, academia and industry are simultaneously pursuing the development of these tools. For each tool, the development process typically begins by assessing its potential benefits, and then progresses to designing preliminary versions of the tool, followed by testing the tool's strengths and weaknesses using computational modeling, human-in-the-loop simulation and/or field tests. We compiled the literature, evaluated the methodological rigor of the studies and served as referee for partisan conclusions that were sometimes overly optimistic. Here we provide the results of this review.

Beard, Bettina L.↗

Space Station Freedom secondary power wiring requirements

Secondary power is produced by DDCU's (direct current to direct current converter units) and routed to and through secondary power distribution assemblies (SPDA's) to loads or tertiary distribution assemblies. This presentation outlines requirements of Space Station Freedom (SSF) EEE (electrical, electronic, and electromechanical) parts wire and the approved electrical wire and cable. The SSF PDRD (Program Definition and Requirements Document) language problems and resolution are reviewed. The cable routing to and from the SPDA's is presented as diagrams and the wire recommendations and characteristics are given.

Sawyer, C. R.↗

Spillover, nonlinearity, and flexible structures

Many systems whose evolution in time is governed by Partial Differential Equations (PDEs) are linearized around a known equilibrium before Computer Aided Control Engineering (CACE) is considered. In this case, there are infinitely many independent vibrational modes, and it is intuitively evident on physical grounds that infinitely many actuators would be needed in order to control all modes. A more precise, general formulation of this grave difficulty (spillover problem) is due to A.V. Balakrishnan. A possible route to circumvention of this difficulty lies in leaving the PDE in its original nonlinear form, and adding the essentially finite dimensional control action prior to linearization. One possibly applicable technique is the Liapunov Schmidt rigorous reduction of singular infinite dimensional implicit function problems to finite dimensional implicit function problems. Omitting details of Banach space rigor, the formalities of this approach are given.

Bass, Robert W.↗

Information Switching Processor (ISP) contention analysis and control

In designing a satellite system with on-board processing, the selection of a switching architecture is often critical. The on-board switching function can be implemented by circuit switching or packet switching. Destination-directed packet switching has several attractive features, such as self-routing without on-board switch reconfiguration, no switch control memory requirement, efficient bandwidth utilization for packet switched traffic, and accommodation of circuit switched traffic. Destination-directed packet switching, however, has two potential concerns: (1) contention and (2) congestion. And this report specifically deals with the first problem. It includes a description and analysis of various self-routing switch structures, the nature of contention problems, and contention and resolution techniques.

Inukai, Thomas↗