SEARCH · Search NASA

Results for “ROUTING”

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

SourceResearch connectionFrom yearThrough year

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

At least 397 records · Page 22

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Smart CO2 Transport-Route Planning Tool: Providing Data and Insights for Accelerating Carbon Transport & Storage Deployment

Overview presentation given at the 2024 FECM / NETL Carbon Management Research Project Review Meeting on NETL's Bipartisan Infrastructure Law-funded Smart CO2 Transport-Route Planning Tool and associated geodatabase. This machine learning informed, data-driven public resource was designed to inform regulators, industry, and researchers plan and develop safe and efficient transport routes across the country.

Romeo, Lucy↗

DOE OSTI2017

Maximization of Platoon Formation Through Centralized Routing and Departure Time Coordination

Platooning allows vehicles to travel with a small intervehicle distance in a coordinated fashion because of vehicle-to-vehicle connectivity. When applied at a larger scale, platooning creates significant opportunities for energy savings because of reduced aerodynamic drag, as well as increased road capacity and a reduction in congestion resulting from shorter vehicle headways. These potential savings are maximized, however, if platooning-capable vehicles spend most of their travel time within platoons. Ad hoc platoon formation may not ensure a high rate of platoon driving. This paper considers here the problem of central coordination of platooning-capable vehicles. Coordination of their routes and departure times can maximize the fuel savings afforded by platooning vehicles. The resulting problem is a combinatorial optimization problem that considers the platoon coordination and vehicle routing problems simultaneously. The methodology is demonstrated through evaluation of the benefits of a coordinated solution and comparison with the uncoordinated case when platoons form only in an ad hoc manner. The coordinated and uncoordinated scenarios are compared on a grid network with various assumptions about demand and the time vehicles are willing to wait.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2018

A Review of Classical Swine Fever Virus and Routes of Introduction into the United States and the Potential for Virus Establishment

Classical swine fever (CSF) is caused by CSF virus (CSFV) which can be the source of substantial morbidity and mortality events in affected swine. The disease can take one of several forms (acute, chronic, or prenatal) and depending on the virulence of the inoculating strain may result in a lethal infection irrespective of the form acquired. Because of the disease-free status of the United States and the high cost of a viral incursion, a summary of US vulnerabilities for viral introduction and persistence is provided. The legal importation of live animals as well as animal products, byproducts, and animal feed serve as a potential route of viral introduction. Current import regulations are described as are mitigation strategies that are commonly utilized to prevent pathogens, including CSFV, from entering the US. The illegal movement of suids and their products as well as an event of bioterrorism are both feasible routes of viral introduction but are difficult to restrict or regulate. Ultimately, recommendations are made for data that would be useful in the event of a viral incursion. Population and density mapping for feral swine across the United States would be valuable in the event of a viral introduction or spillover; density data could further contribute to understanding the risk of infection in domestic swine. Additionally, ecological and behavioral studies, including those that evaluate the effects of anthropogenic food sources that support feral swine densities far above the carrying capacity would provide invaluable insight to our understanding of how human interventions affect feral swine populations. Further analyses to determine the sampling strategies necessary to detect low levels of antibody prevalence in feral swine would also be valuable.

Veterinary Sciences↗

DOE OSTI2022

Dimethyl Carbonate: Review of Synthesis Routes and Catalysts Used

This review summarizes the performance of potential catalysts for the synthesis of dimethyl carbonate (DMC) using CO2 as a feedstock by two major processes—the direct route of carbonylation of alcohols and the indirect route of alcoholysis of urea. The reaction mechanisms and corresponding catalysts that were previously investigated are discussed. The major challenges associated with the conversion of CO2 to DMC are the low yields, low DMC selectivity, and thermodynamic limitations (alcohol carbonylation) of reversible reactions with low equilibrium constants. This occurs mainly due to the highly stable carbon dioxide molecules. The development of novel catalysts with high yields and high selectivity needs to be studied to overcome these technical challenges. In addition, to enhance the DMC yield, the use of dehydrating agents for water removal from the reaction mixture is recommended and discussed in detail in this article. This review critically examines the different catalysts used by investigators, along with their respective operating conditions and suitability in applications for the commercial synthesis of CO2-based DMC.

10 SYNTHETIC FUELS↗

NASA NTRS1972

Route Award Considerations

The organization, responsibilities, and functions of the Civil Aeronautics Board are discussed. Several examples of decisions made by the Civil Aeronautics Board on the award of specific air routes to competing air lines are presented. The manner in which route proceedings are initiated and examined is explained. Recommendations are made concerning actions which can be taken to improve the services provided to the flying public.

Rogers, W. D., Jr.↗

NASA NTRS1977

Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.

Huynh, D.↗

NASA NTRS1977

Terrain evaluation and route designation based on noisy rangefinder data

This paper discusses an approach to terrain evaluation and route designation for an autonomous Mars rover. The evaluation procedure simulates movement of the rover over a terrain model estimated from noisy range readings. During the simulated movement a potential path is analyzed for adverse gradients and minimum vehicle body clearance which could inhibit the rover's progress. The route designation scheme employs dynamic programming to select the optimal path based on the evaluation results.

Netch, A.↗

NASA NTRS1983

A frequency-routed satellite system concept using multiple orthogonally-polarized beams for frequency reuse

The design concepts of a multibeam frequency-division multiplexed satellite system accessed by many moderately sized earth stations are outlined. In the system proposed here, traffic is routed from beam to beam through appropriate apportionment and filtering. Within a beam, the routing to particular users is achieved by conventional FDM. The optimum beam size, beam isolation, orthogonal polarization assignment to beams, the concept of beam groups yielding a simple transponder design, and the establishment of a frequency plan providing interference-free band assignments are discussed.

Rotholz, E.↗

NASA NTRS1986

Hybrid routing technique for a fault-tolerant, integrated information network

The evolutionary growth of the space station and the diverse activities onboard are expected to require a hierarchy of integrated, local area networks capable of supporting data, voice, and video communications. In addition, fault-tolerant network operation is necessary to protect communications between critical systems attached to the net and to relieve the valuable human resources onboard the space station of time-critical data system repair tasks. A key issue for the design of the fault-tolerant, integrated network is the development of a robust routing algorithm which dynamically selects the optimum communication paths through the net. A routing technique is described that adapts to topological changes in the network to support fault-tolerant operation and system evolvability.

Meredith, B. D.↗

NASA NTRS1987

Bendable Routing Tool

Tool extends routing bit into internal cavities or passages so burrs and similar defects removed. Bent so inserted through curving channels. Copper sheath gives stiffness to flexible shaft but can itself be bent. Several types of routing bits attached to shaft.

Mayer, Walter↗

NASA NTRS1987

A parallel algorithm for channel routing on a hypercube

A new parallel simulated annealing algorithm for channel routing on a P processor hypercube is presented. The basic idea used is to partition a set of tracks equally among processors in the hypercube. In parallel, P/2 pairs of processors perform displacements and exchanges of nets between tracks, compute the changes in cost functions, and accept moves using a parallel annealing criteria. Through the use of a unique distributed data structure, it is possible to minimize message traffic and add versatility and efficiency in a parallel routing tool. The algorithm has been implemented and is being tested on some of the popular channel problems from the literature.

Brouwer, Randall↗

NASA NTRS1988

The prediction of en route noise levels for a DC-9 aircraft

En route noise for advanced propfan powered aircraft has become an issue of concern for the Federal Aviation Administration. The NASA Aircraft Noise Prediction Program (ANOPP) is used to demonstrate the source noise and propagation effects for an aircraft in level flight up to 35,000 feet altitude. One-third octave band spectra of the source noise, atmospheric absorption loss, and received noise are presented. The predicted maximum A-weighted sound pressure level is compared to measured data from the Aeronautical Research Institute of Sweden. ANOPP is shown to be an effective tool in evaluating the en route noise characteristics of a DC-9 aircraft.

Weir, Donald S.↗

NASA NTRS1988

Message routing in an injured hypercube

A distributed fault-tolerant routing scheme for an injured hypercube multicomputer is described. The scheme is based on the topology of the hypercube, and it requires each node to possess only the information on the failure of its own links. A rigorous analysis of the scheme shows that it is not only capable of routing messages successfully in an injured Q(n) when the number of component failures is less than n, but can also choose a shortest path with a very high probability.

Chen, Ming-Syan↗

NASA NTRS1989

Message routing in HARTS with faulty components

It is important to design a distributed system which is capable of delivering messages even in the presence of faulty components between their source and destination nodes. A routing scheme is developed in two steps for a wrapped hexagonal mesh, called HARTS (Hexagonal Architecture for Real-Time Systems), which assures the delivery of every message as long as there is a path between its source and destination. The proposed scheme can also detect the nonexistence of path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in HARTS to know only the state (faulty or not) of each of its own links. The performance of the simple routing scheme is simulated for 3- and 5-dimensional H-meshes while varying the physical distribution of faulty components. It is shown that a shortest path between the source and destination of each message is taken with a high probability and a path, if it exists, is usually found very quickly.

Olson, Alan↗

NASA NTRS1990

A conflict analysis of 4D descent strategies in a metered, multiple-arrival route environment

A conflict analysis was performed on multiple arrival traffic at a typical metered airport. The Flow Management Evaluation Model (FMEM) was used to simulate arrival operations using Denver Stapleton's arrival route structure. Sensitivities of conflict performance to three different 4-D descent strategies (clear-idle Mach/Constant AirSpeed (CAS), constant descent angle Mach/CAS and energy optimal) were examined for three traffic mixes represented by those found at Denver Stapleton, John F. Kennedy and typical en route metering (ERM) airports. The Monte Carlo technique was used to generate simulation entry point times. Analysis results indicate that the clean-idle descent strategy offers the best compromise in overall performance. Performance measures primarily include susceptibility to conflict and conflict severity. Fuel usage performance is extrapolated from previous descent strategy studies.

Izumi, K. H.↗

NASA NTRS1990

A parallel algorithm for global routing

A Parallel Hierarchical algorithm for Global Routing (PHIGURE) is presented. The router is based on the work of Burstein and Pelavin, but has many extensions for general global routing and parallel execution. Main features of the algorithm include structured hierarchical decomposition into separate independent tasks which are suitable for parallel execution and adaptive simplex solution for adding feedthroughs and adjusting channel heights for row-based layout. Alternative decomposition methods and the various levels of parallelism available in the algorithm are examined closely. The algorithm is described and results are presented for a shared-memory multiprocessor implementation.

Brouwer, Randall J.↗

NASA NTRS1990

Agenda toward the development of a rational noise descriptor system relevant to human annoyance by en route aircraft noise

A rational, internationally consistent, noise descriptor system is needed to express existing and predicted en route aircraft noise levels in terms closely correlated to the annoyance perceived by people and physiologically identifiable in people, to provide guidance for aircraft and powerplant design, flight management, land-use planning, and building codes. Expanding on previous discussions, a new comprehensive statement of the specific questions that must be resolved by needed research, and the nature and quality of proof that must be adduced to justify further steps toward the drafting and adoption of new international en route aircraft-noise standards is sought. The single noise-descriptor system envisioned must be valid for widely varying aircraft-noise frequency spectra, including time-variant components and agreeable and disagreeable discrete tones and combinations of tones. The measures and criteria established by the system must be valid at high and low immission levels, at high and low ambient noise levels, for great and small number of noise events, and outdoors and indoors.

Garbell, Maurice A.↗

NASA NTRS1991

Planning The Route Of A Robotic Land Vehicle

Algorithm enables experimental robotic land vehicle to follow automatically route computed on basis of terrain-height-map data. Computer executing algorithm merges coarser global topographical data with finer local topographical data obtained through stereoscopic video system as vehicle moves along, then smoothes merged elevation map, interpolates map to evenly-horizontally-spaced grid points, and differentiates map to produce data on slopes and roughness for use in calculations of traversability and optimum route(s). Distance traveled minimized to extent possible consistent with avoidance of obstacles.

Gennery, Donald B.↗