SEARCH · Search NASA

Results for “Route optimization”

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 199 records · Page 11

All sources NASA NTRS DOE OSTI

NASA NTRS1996

Balancing Contention and Synchronization on the Intel Paragon

The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This algorithm assumes that a communication link can carry one message at a time and that a node can only transmit one message at a time. It requires global synchronization to enforce a schedule of transmissions. Unfortunately global synchronization has substantial overhead on the Paragon. At the same time the powerful interconnection mechanism of this machine permits 2 or 3 messages to share a communication link with minor overhead. It can also overlap multiple message transmission from the same node to some extent. We develop a generalization of Scott's algorithm that executes complete exchange with a prescribed contention. Schedules that incur greater contention require fewer synchronization steps. This permits us to tradeoff contention against synchronization overhead. We describe the performance of this algorithm and compare it with Scott's original algorithm as well as with a naive algorithm that does not take interconnection structure into account. The Bounded contention algorithm is always better than Scott's algorithm and outperforms the naive algorithm for all but the smallest message sizes. The naive algorithm fails to work on meshes larger than 12 x 12. These results show that due consideration of processor interconnect and machine performance parameters is necessary to obtain peak performance from the Paragon and its successor mesh machines.

Bokhari, Shahid H.↗

NASA NTRS1986

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗

DOE OSTI2026

Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming

Shared autonomous vehicles (SAVs) bring competition to traditional transit services but redesigning multimodal transit network can utilize SAVs as feeders to enhance service efficiency and coverage. This paper presents an optimization framework for the joint multimodal transit frequency and SAV fleet size problem, a variant of the transit network frequency setting problem. The objective is to maximize total transit ridership (including SAV-fed trips and subtracting boarding rejections) across multiple time periods under budget constraints, considering endogenous mode choice (transit, point-to-point SAVs, driving) and route selection, while allowing for strategic route removal by setting frequencies to zero. Due to the problem’s non-linear, non-convex nature and the computational challenges of large-scale networks, we develop a hybrid solution approach that combines a metaheuristic approach (particle swarm optimization) with nonlinear programming for local solution refinement. To ensure computational tractability, the framework integrates analytical approximation models for SAV waiting times based on fleet utilization, multimodal network assignment for route choice, and multinomial logit mode choice behavior, bypassing the need for computationally intensive simulations within the main optimization loop. Applied to the Chicago metropolitan area’s multimodal network, our method illustrates a 33.3% increase in transit ridership through optimized transit route frequencies and SAV integration, particularly enhancing off-peak service accessibility and strategically reallocating resources.

Ng, Max↗

DOE OSTI2025

reVRt (reV Routing) [SWR-25-112]

The reV Routing (reVRt) tool is a computational framework for modeling and optimizing transmission infrastructure requirements for electrical grid connections. By employing a spatially-aware least-cost-path methodology, it allows users to incorporate a wide range of factors including siting constraints, regional component costs, land composition costs, point-of-interconnection costs, and network upgrade costs. Additionally, the tool enables advanced follow-on analyses, such as land characterization for potential transmission line routes, to support informed decision-making. Although it's designed to integrate seamlessly with the reV model, the reV Routing tool is versatile and can also be utilized independently for standalone analyses in transmission planning and resource assessment scenarios.

Pinchuk, Pavlo (Paul) [National Renewable Energy L↗

NASA NTRSDate not supplied

Robotic Software Architecture for in-Space Outfitting Operations

Space exploration is expanding into longer missions, larger payloads, and more complex operations. To make these larger scale missions a reality, it is necessary to perform assembly, construction, and maintenance tasks via a robotic workforce in addition to crewed operations. While there has been significant research into in-space assembly and manufacturing, it is primarily focused on rigid structural elements, such as ISRU printing or truss construction. Outfitting tasks, such as cable routing, are a critical step to a fully operational in-space facility. This paper seeks to provide a reduced order state model and an optimized combination of state-of-the-art robotics algorithms applied to a cable routing scenario. Simulation results are expected to advance approaches to online autonomous robotic manipulation of non-rigid elements.

Amy M Quartaro↗

NASA NTRSDate not supplied

Robotic Software Architecture for In-Space Outfitting Operations

Amy Quartaro↗

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 NTRS1985

Performance study of a data flow architecture

Teams of scientists studied data flow concepts, static data flow machine architecture, and the VAL language. Each team mapped its application onto the machine and coded it in VAL. The principal findings of the study were: (1) Five of the seven applications used the full power of the target machine. The galactic simulation and multigrid fluid flow teams found that a significantly smaller version of the machine (16 processing elements) would suffice. (2) A number of machine design parameters including processing element (PE) function unit numbers, array memory size and bandwidth, and routing network capability were found to be crucial for optimal machine performance. (3) The study participants readily acquired VAL programming skills. (4) Participants learned that application-based performance evaluation is a sound method of evaluating new computer architectures, even those that are not fully specified. During the course of the study, participants developed models for using computers to solve numerical problems and for evaluating new architectures. These models form the bases for future evaluation studies.

Adams, George↗

NASA NTRS1996

Advanced Intelligent System Application to Load Forecasting and Control for Hybrid Electric Bus

The primary motivation for this research emanates from providing a decision support system to the electric bus operators in the municipal and urban localities which will guide the operators to maintain an optimal compromise among the noise level, pollution level, fuel usage etc. This study is backed up by our previous studies on study of battery characteristics, permanent magnet DC motor studies and electric traction motor size studies completed in the first year. The operator of the Hybrid Electric Car must determine optimal power management schedule to meet a given load demand for different weather and road conditions. The decision support system for the bus operator comprises three sub-tasks viz. forecast of the electrical load for the route to be traversed divided into specified time periods (few minutes); deriving an optimal 'plan' or 'preschedule' based on the load forecast for the entire time-horizon (i.e., for all time periods) ahead of time; and finally employing corrective control action to monitor and modify the optimal plan in real-time. A fully connected artificial neural network (ANN) model is developed for forecasting the kW requirement for hybrid electric bus based on inputs like climatic conditions, passenger load, road inclination, etc. The ANN model is trained using back-propagation algorithm employing improved optimization techniques like projected Lagrangian technique. The pre-scheduler is based on a Goal-Programming (GP) optimization model with noise, pollution and fuel usage as the three objectives. GP has the capability of analyzing the trade-off among the conflicting objectives and arriving at the optimal activity levels, e.g., throttle settings. The corrective control action or the third sub-task is formulated as an optimal control model with inputs from the real-time data base as well as the GP model to minimize the error (or deviation) from the optimal plan. These three activities linked with the ANN forecaster proving the output to the GP model which in turn produces the pre-schedule of the optimal control model. Some preliminary results based on a hypothetical test case will be presented for the load forecasting module. The computer codes for the three modules will be made available fe adoption by bus operating agencies. Sample results will be provided using these models. The software will be a useful tool for supporting the control systems for the Electric Bus project of NASA.

Momoh, James↗

NASA NTRSDate not supplied

Large-Scale Space Network Simulator for Performance-Optimized DTNs

High-rate Delay Tolerant Networking (HDTN) is a performance-optimized Delay Tolerant Networking (DTN) implementation that can provide multigigabit per second data rates in disruptive and high-latency space networks. Routing, especially in large-scale space networks, remains challenging due to network topologies that evolve over time. This paper presents a simulation tool that enables HDTN implementation testing at accelerated speeds, which is key for routing in large-scale space networks.

High data-rate Delay Tolerant Networking↗

NASA NTRS1988

An optimal structure for a 34-meter millimeter-wave center-fed BWG antenna: The Cross-Box concept

An approach to the design of the planned NASA/JPL 34 m elevation-over-azimuth (Az-El) antenna structure at the Venus site (DSS-13) is presented. The antenna structural configuration accommodates a large (2.44 m) beam waveguide (BWG) tube centrally routed through the reflector-alidade structure, an elevation wheel design, and an optimal structural geometry. The design encompasses a cross-box elevation wheel-reflector base substructure that preserves homology while satisfying many constraints, such as structure weight, surface tolerance, stresses, natural frequency, and various functional constraints. The functional requirements are set to ensure that microwave performance at millimeter wavelengths is adequate. The cross-box configuration was modeled, optimized, and found to satisfy all DSN HEF baseline antenna specifications. In addition, the structure design was conceptualized and analyzed with an emphasis on preserving the structure envelope and keeping modifications relative to the HEF antennas to a minimum, thus enabling the transferability of the BWG technology for future retrofitting. Good performance results were obtained.

Chuang, K. L.↗

DOE OSTI2026

Higher-order interaction effects among operating conditions and feedstocks shape reactor microbiomes and fatty acid production profiles

Arrested anaerobic digestion (AAD) offers a promising route for producing fatty acids (FAs) from organic residues, yet optimal conditions for selectively generating medium-chain fatty acids (MCFAs) remain poorly defined. Here, we systematically evaluated the main and interaction effects of pH (5, 7, 9), feedstock (food waste, manure), temperature (35 and 45 °C), and inoculum source on microbiome composition and FA production. Anaerobic digester sludge and a novel bison rumen inoculum were compared. Significant higher-order interactions among operating parameters governed FA profiles and microbiome structure. Butyric acid production was driven by a three-way interaction among pH, feedstock, and temperature (p < 0.001), with maximum concentrations achieved in food waste reactors at pH 5.0 and 35 °C (1.2 ± 0.1 g L −1 with sludge and 1.1 ± 0.3 g L −1 with rumen). MCFA production exhibited significant four-way interactions (p < 0.1 to p < 0.001). At 45 °C and pH 5.0, inoculum source tuned MCFA selectivity: sludge favored pentanoic acid (0.4 ± 0.1 g L −1 ), whereas rumen favored hexanoic and heptanoic acids (up to 0.4 ± 0.2 g L −1 ). Manure reactors produced < 0.2 g L −1 MCFAs under all conditions. Genera, including Megasphaera, Prevotella, and Lactobacillus, were associated with production of specific MCFAs. PICRUSt2-based pathway predictions were consistent with MCFA production patterns and suggested a potential role for lactic acid–driven chain elongation pathways. This study provides insights into how interacting operating conditions shape AAD microbiomes, their FA profiles, and advances the trajectory of research aimed at engineering robust and controllable microbiomes for waste valorization.

09 BIOMASS FUELS↗

DOE OSTI2026

Molecular Design Principles for Photosystem I-Based Biohybrid Solar Fuel Catalysts

Direct solar-to-chemical conversion offers a compelling route to clean, dispatchable energy. Photosystem I (PSI), an evolutionarily optimized light-driven oxidoreductase, can be repurposed for solar-fuel production by coupling its photochemistry to catalytic interfaces. However, the molecular determinants that govern productive electron transfer to abiotic catalysts remain poorly understood. Here, we present molecular structures of active PSI-Pt nanoparticle (PtNP) biohybrids that reveal how protein architecture controls catalyst access, binding geometry, and photocatalytic efficiency. Removal of stromal subunits exposes the electron transfer chain and enables PtNP binding proximal to the F X cluster, demonstrating that steric occlusion limits access to native acceptor regions in PSI. In contrast, in trimeric PSI, PtNPs bind at multiple sites per monomer, but only a subset are positioned within electron transfer distance of terminal cofactors, resulting in a heterogeneous population of productive and nonproductive configurations. Structural analyses and molecular dynamics simulations define the interface topology, electrostatics, and cofactor-to-nanoparticle distances that govern catalyst binding and electron transfer. These results establish that catalytic inefficiency arises not only from intrinsic electron transfer constraints but also from the distribution of binding geometries imposed by the protein scaffold. Together, these findings provide a molecular framework linking protein structure to biohybrid function and define design principles for engineering PSI-based solar fuel systems and protein-nanomaterial interfaces for light-driven catalysis.

biohybrid↗

DOE OSTI2025

Recent advances in enzyme engineering for improved deconstruction of poly(ethylene terephthalate) (PET) plastics

In the last ~20 years, a multitude of natural enzymes have been discovered that can catalyze the breakdown of the common plastic poly(ethylene terephthalate) (PET). While enzymatic PET recycling is an attractive alternative end-of-life route for this waste plastic, the enzymes are not yet optimized for efficient and economical industrial use. Here, we discuss recent advances in engineering these PET-degrading enzymes, which include PET, bis(2-hydroxyethyl) terephthalate (BHET), and 2-hydroxyethyl terephthalic acid (MHET) hydrolases, toward industrially-relevant engineering goals. We place emphasis on trends from past efforts in rational and semi-rational design and emerging areas in directed evolution/high throughput screening and computational design for engineering these enzymes.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1994

A knowledge-based system for controlling automobile traffic

Transportation network capacity variations arising from accidents, roadway maintenance activity, and special events as well as fluctuations in commuters' travel demands complicate traffic management. Artificial intelligence concepts and expert systems can be useful in framing policies for incident detection, congestion anticipation, and optimal traffic management. This paper examines the applicability of intelligent route guidance and control as decision aids for traffic management. Basic requirements for managing traffic are reviewed, concepts for studying traffic flow are introduced, and mathematical models for modeling traffic flow are examined. Measures for quantifying transportation network performance levels are chosen, and surveillance and control strategies are evaluated. It can be concluded that automated decision support holds great promise for aiding the efficient flow of automobile traffic over limited-access roadways, bridges, and tunnels.

Maravas, Alexander↗

NASA NTRS2007

Wide Tuning Capability for Spacecraft Transponders

A document presents additional information on the means of implementing a capability for wide tuning of microwave receiver and transmitter frequencies in the development reported in the immediately preceding article, VCO PLL Frequency Synthesizers for Spacecraft Transponders (NPO- 42909). The reference frequency for a PLL-based frequency synthesizer is derived from a numerically controlled oscillator (NCO) implemented in digital logic, such that almost any reference frequency can be derived from a fixed crystal reference oscillator with microhertz precision. The frequency of the NCO is adjusted to track the received signal, then used to create another NCO frequency used to synthesize the transmitted signal coherent with, and at a specified frequency ratio to, the received signal. The frequencies can be changed, even during operation, through suitable digital programming. The NCOs and the related tracking loops and coherent turnaround logic are implemented in a field-programmable gate array (FPGA). The interface between the analog microwave receiver and transmitter circuits and the FPGA includes analog-to-digital and digital-toanalog converters, the sampling rates of which are chosen to minimize spurious signals and otherwise optimize performance. Several mixers and filters are used to properly route various signals.

Lux, James↗

NASA NTRS2019

Rising Above the Cloud - Toward High-Rate Delay-Tolerant Networking in Low-Earth Orbit

The High Data Rate Architecture (HiDRA) project is implementing a High-rate Delay Tolerant Networking (HDTN) capability that can support Low Earth Orbit (LEO) applications and environments. The present state of the effort, future work, and other elements of the work to date are described in this paper. This implementation is intended to support applications that run at 1+ Gbps, per the requirements of modern optical and high-frequency RF links. Uniquely, this implementation is also tuned to support relay and data trunking applications, which might require support for large numbers of small bundles per second. The design for this platform is based entirely on commercial-off-the-shelf (COTS) components, and possesses buffering capabilities in the 5 TB range. This document takes results from previous individual tests and integrates them to demonstrate results in the presence of a coherent use-case: consider a network aboard the ISS which intends to utilize an upcoming optical communications capability. For this use-case, orbital analysis software is used to analyze orbital dynamics, from which a list of access times are generated that might take in to account weather, schedule competition, etc. A variant of Contact Graph Routing (CGR) is applied to these windows to determine an optimal schedule. This schedule is then loaded into the HDTN prototype and, in conjunction with various measurement tools, a complete end-to-end analysis of HDTN's performance is conducted. Various bottlenecks (including storage) are identified: these bottlenecks are expected to help us focus our future work on the elements of the system that are most likely to present issues moving forward. Finally, we discuss possible paths for evolution beyond the present rates supported by the system, including (but not limited to) hardware acceleration.

Hylton, Alan↗

NASA NTRS2018

Performance Evaluation of Conflict-Free Trajectory Taxiing in Airport Ramp Area Using Fast-Time Simulations

The German Aerospace Center (DLR) and the National Aeronautics and Space Administration (NASA) have been collaborating to conduct joint research addressing future surface traffic management challenges. The surface management tool from DLR, called Taxi Routing for Aircraft: Creation and Controlling (TRACC), was adapted to be integrated in NASA's fast-time simulation environment called Surface Operations Simulator and Scheduler (SOSS). The research described in this paper 1) applied TRACC to trajectory-based ramp traffic management, where TRACC generates conflict-free aircraft trajectories in a congested ramp area, 2) investigated the feasibility of the concept through the integrated TRACC-SOSS fast-time simulation, and 3) evaluated the performance of the integrated system. For this activity, TRACC was adapted for ramp operations at Charlotte Douglas International Airport, called TRACC_PB (TRACC for pushback optimization). TRACC_PB provides four-dimensional taxi trajectories with a command speed profile for each aircraft following standard taxi routes within the ramp area. In this study, departures are given the Target Movement Area entry Times (TMATs) provided by the baseline surface metering scheduler based on NASA's Spot and Runway Departure Advisor (SARDA). TRACC_PB also calculates optimal pushback times for departures, as well as the times when arrivals shall enter the ramp, the Target Movement area Exit Times (TMETs). The initial results showed that the TRACC_PB successfully generated conflict-free trajectories for the ramp area taxi operations and improved taxiing efficiency compared to the baseline results. TRACC_PB aimed to provide conflict-free taxi routes avoiding any stops while taxiing. This resulted in longer gate hold times for departures and postponed throughput values compared to the baseline simulation without trajectory optimization. Having conflict-free routes without stoppage also created shorter taxi times but required renegotiation of the given TMATs. TRACC_PB also achieved reductions in both fuel consumption and engine emissions (17% for departures and 10% for arrivals), which correlate with the ramp taxi time reduction.

trajectory-based taxi operations↗