Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Routing algorithm”

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

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

At least 415 records · Page 23

Identifying chemically similar multiphase nanoprecipitates in compositionally complex non-equilibrium oxides via machine learning

Abstract Characterizing oxide nuclear fuels is difficult due to complex fission products, which result from time-evolving system chemistry and extreme operating environments. Here, we report a machine learning-enhanced approach that accelerates the characterization of spent nuclear fuels and improves the accuracy of identifying nanophase fission products and bubbles. We apply this approach to commercial, high-burnup, irradiated light-water reactor fuels, demonstrating relationships between fission product precipitates and gases. We also gain understanding of the fission versus decay pathways of precipitates across the radius of a fuel pellet. An algorithm is provided for quantifying the chemical segregation of the fission products with respect to the high-burnup structure, which enhances our ability to process large amounts of microscopy data, including approaching the atomistic-scale. This may provide a faster route for achieving physics-based fuel performance modeling.

36 MATERIALS SCIENCE↗

ProgLIMI: Programmable LInk Metric Identification in Software-Defined Networks

In this paper, we propose the Programmable LInk Metric Identification (ProgLIMI) infrastructure for software-defined networking (SDN) networks. ProgLIMI identifies round-trip link metrics (RTLMs) from accumulated end-to-end metrics of selected measurement paths by leveraging the flexible routing control capability of SDN networks. ProgLIMI mainly solves three sub-problems: (1) monitor placement; (2) linearly independent measurement path construction; and (3) flow rule design. To reduce measurement cost, ProgLIMI tries to minimize the number of required monitors and flow rules. In this paper, we address the three sub-problems for both full and hybrid SDN networks. For full SDN networks, ProgLIMI can achieve full RTLM identification using only one monitor and two flow rules in each SDN switch. In contrast, the RTLM identification in hybrid SDN networks is more complicated due to the routing constraint of hybrid SDN networks. We first prove that the monitor placement problem in hybrid SDN networks is NP-hard. We then formulate the monitor placement and measurement path selection problem in hybrid SDN networks and propose a greedy heuristic algorithm to solve the problem efficiently. Our evaluations on both physical testbed and simulation platform reveal that ProgLIMI can accurately identify the RTLMs (delay and loss rate). Besides, ProgLIMI is also resource efficient, i.e., it only requires two flow rules in each SDN switch and a small number of monitors, and the extra probing traffic load incurred by ProgLIMI is also low.

97 MATHEMATICS AND COMPUTING↗

Flexible silicon photonic architecture for accelerating distributed deep learning

The increasing size and complexity of deep learning (DL) models have led to the wide adoption of distributed training methods in datacenters (DCs) and high-performance computing (HPC) systems. However, communication among distributed computing units (CUs) has emerged as a major bottleneck in the training process. In this study, we propose Flex-SiPAC, a flexible silicon photonic accelerated compute cluster designed to accelerate multi-tenant distributed DL training workloads. Flex-SiPAC takes a co-design approach that combines a silicon photonic hardware platform with a tailored collective algorithm, optimized to leverage the unique physical properties of the architecture. The hardware platform integrates a novel wavelength-reconfigurable transceiver design and a micro-resonator-based wavelength-reconfigurable switch, enabling the system to achieve flexible bandwidth steering in the wavelength domain. The collective algorithm is designed to support reconfigurable topologies, enabling efficient all-reduce communications that are commonly used in DL training. The feasibility of the Flex-SiPAC architecture is demonstrated through two testbed experiments. First, an optical testbed experiment demonstrates the flexible routing of wavelengths by shuffling an array of input wavelengths using a custom-designed spatial-wavelength selective switch. Second, a four-GPU testbed running two DL workloads shows a 23% improvement in job completion time compared to a similarly sized leaf-spine topology. We further evaluate Flex-SiPAC using large-scale simulations, which show that Flex-SiPAC is able to reduce the communication time by 26% to 29% compared to state-of-the-art compute clusters under representative collective operations.

Wu, Zhenguo (ORCID:0000000322847985)↗

Efficient computation of optimal low thrust gravity perturbed orbit transfers

We have developed a new method for solving low-thrust fuel-optimal orbit transfer problems in the vicinity of a large body (planet or asteroid), considering a high-fidelity spherical harmonic gravity model. The algorithm is formulated via the indirect optimization method, leading to a two-point boundary value problem (TPBVP). We make use of a hyperbolic tangent smoothing law for performing continuation on the thrust magnitude to reduce the sharpness of the control switches in early iterations and thus promote convergence. The TPBVP is solved using the method of particular solutions (MPS) shooting method and Picard-Chebyshev numerical integration. Application of Picard-Chebyshev integration affords an avenue for increased efficiency that is not available with step-by-step integrators. We demonstrate that computing the particular solutions with only a low-fidelity force model greatly increases the efficiency of the algorithm while ultimately achieving near machine precision accuracy. A salient feature of the MPS is that it is parallelizable, and thus further speedups are available. It is also shown that, for near Earth orbits and over a small number of en-route revolutions around the Earth, only the zonal perturbation terms are required in the costate equations to obtain a solution that is accurate to machine precision and optimal to engineering precision. The proposed framework can be used for trajectory design around small asteroids and also for orbit debris rendezvous and removal tasks.

Junkins, John L.↗

Characterizing climate pathways using feature importance on echo state networks

The 2022 National Defense Strategy of the United States listed climate change as a serious threat to national security. Climate intervention methods, such as stratospheric aerosol injection, have been proposed as mitigation strategies, but the downstream effects of such actions on a complex climate system are not well understood. The development of algorithmic techniques for quantifying relationships between source and impact variables related to a climate event (i.e., a climate pathway) would help inform policy decisions. Data-driven deep learning models have become powerful tools for modeling highly nonlinear relationships and may provide a route to characterize climate variable relationships. In this paper, we explore the use of an echo state network (ESN) for characterizing climate pathways. ESNs are a computationally efficient neural network variation designed for temporal data, and recent work proposes ESNs as a useful tool for forecasting spatiotemporal climate data. However, ESNs are noninterpretable black-box models along with other neural networks. The lack of model transparency poses a hurdle for understanding variable relationships. We address this issue by developing feature importance methods for ESNs in the context of spatiotemporal data to quantify variable relationships captured by the model. We conduct a simulation study to assess and compare the feature importance techniques, and we demonstrate the approach on reanalysis climate data. In the climate application, we consider a time period that includes the 1991 volcanic eruption of Mount Pinatubo. This event was a significant stratospheric aerosol injection, which acts as a proxy for an anthropogenic stratospheric aerosol injection. Furthermore, we are able to use the proposed approach to characterize relationships between pathway variables associated with this event that agree with relationships previously identified by climate scientists.

black-box models↗

Pathway design using de novo steps through uncharted biochemical spaces

Existing retrosynthesis tools generally traverse production routes from a source to a sink metabolite using known enzymes or de novo steps. Generally, important considerations such as blending known transformations with putative steps, complexity of pathway topology, mass conservation, cofactor balance, thermodynamic feasibility, microbial chassis selection, and cost are largely dealt with in a posteriori fashion. The computational procedure we present here designs bioconversion routes while simultaneously considering any combination of the aforementioned design criteria. First, we track and codify as rules all reaction centers using a prime factorization-based encoding technique (rePrime). Reaction rules and known biotransformations are then simultaneously used by the pathway design algorithm (novoStoic) to trace both metabolites and molecular moieties through balanced bio-conversion strategies. We show the use of novoStoic in bypassing steps in existing pathways through putative transformations, assembling complex pathways blending both known and putative steps toward pharmaceuticals, and postulating ways to biodegrade xenobiotics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Space-Subdivision Algorithm for Abstract Trajectories

Computational overhead in testing links between nodes reduced. Computationally efficient algorithm facilitates subdivision of n-dimensional spaces during selection, testing, or optimization of trajectories in those spaces. Reduces cost of computation in such diverse problems as scheduling of interrelated events to avoid conflicts, devising efficient production-line layouts and operating schedules, routing telephone calls, and analyzing the motions of gas particles.

Lyon, Douglas K.↗

A Modeling Framework for Connectivity and Automation Co-simulation

This paper presents a unified modeling environment to simulate vehicle driving and powertrain operations within the context of the surrounding environment, including interactions between vehicles and between vehicles and the road. The goal of this framework is to facilitate the analysis of the energy impacts of vehicle connectivity and automation, as well as the development of eco-driving algorithms. Connectivity and automation indeed provide the potential to use information about the environment and future driving to minimize energy consumption. To achieve this goal, the designers of eco-driving control strategies need to simulate a wide range of driving situations, including the interactions with other vehicles and the infrastructure in a closed-loop fashion. The framework, called RoadRunner, extends the capability of Autonomie, a vehicle energy consumption and performance modeling platform, to simulate the longitudinal movements of one or more user-defined vehicles along a user-defined route. In the first part of the paper, we provide an overview of how the framework is organized. The route attributes (position of traffic lights, grade, etc.) can be automatically extracted from a digital map after origin and destination are provided. The user defines which vehicle models to simulate and in which order. The Simulink model is then automatically generated from the scenario description. In the second part of the paper, we present an example case of a scenario with an eco-approach, using traffic signals that provide their signal phase and timing information to the vehicle. A two-stage control algorithm inspired by the literature is implemented to adjust the vehicle’s velocity while traveling through a signalized corridor with the goal of minimizing fuel consumption. Finally, we present simulation results for speed patterns and powertrain operations in typical roads with multiple intersection, comparing the energy savings with traditional driving of unconnected vehicles.

Kim, Namdoo↗

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

HPC4Mobilty w/ UCB

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms. This work will contribute to LBNL’s efforts to develop new processes, analytical tools, program designs, and business models to advance the state of the art in next-generation sustainable transportation solutions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Airborne Precision Spacing (APS) Dependent Parallel Arrivals (DPA)

The Airborne Precision Spacing (APS) team at the NASA Langley Research Center (LaRC) has been developing a concept of operations to extend the current APS concept to support dependent approaches to parallel or converging runways along with the required pilot and controller procedures and pilot interfaces. A staggered operations capability for the Airborne Spacing for Terminal Arrival Routes (ASTAR) tool was developed and designated as ASTAR10. ASTAR10 has reached a sufficient level of maturity to be validated and tested through a fast-time simulation. The purpose of the experiment was to identify and resolve any remaining issues in the ASTAR10 algorithm, as well as put the concept of operations through a practical test.

Smith, Colin L.↗

RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms

The efficient biological production of industrially and economically important compounds is a challenging problem. Brute-force determination of the optimal pathways to efficient production of a target chemical in a chassis organism is computationally intractable. Many current methods provide a single solution to this problem, but fail to provide all optimal pathways, optional sub-optimal solutions or hybrid biological/non-biological solutions. Here we present RetSynth, software with a novel algorithm for determining all optimal biological pathways given a starting biological chassis and target chemical. By dynamically selecting constraints, the number of potential pathways scales by the number of fully independent pathways and not by the number of overall reactions or size of the metabolic network. This feature allows all optimal pathways to be determined for a large number of chemicals and for a large corpus of potential chassis organisms. Additionally, this software contains other features including the ability to collect data from metabolic repositories, perform flux balance analysis, and to view optimal pathways identified by our algorithm using a built-in visualization module. This software also identifies sub-optimal pathways and allows incorporation of non-biological chemical reactions, which may be performed after metabolic production of precursor molecules. The novel algorithm designed for RetSynth streamlines an arduous and complex process in metabolic engineering. Our stand-alone software allows the identification of candidate optimal and additional sub-optimal pathways, and provides the user with necessary ranking criteria such as target yield to decide which route to select for target production. Furthermore, the ability to incorporate non-biological reactions into the final steps allows determination of pathways to production for targets that cannot be solely produced biologically. With this comprehensive suite of features RetSynth exceeds any open-source software or webservice currently available for identifying optimal pathways for target production.

59 BASIC BIOLOGICAL SCIENCES↗

Autonomous Stabilization and Orientation Control of Hoisted Payloads

An orientation control system prototype has been developed for hoisted payloads. This system will allow payloads to be lifted off inclined surfaces while maintaining orientation control, allowing removal of tightly packed payloads without colliding with adjacent objects. For this concept, the payload is hoisted with a crane using a rigging system composed of a cable routed through two capstans and three or four attachment points on the payload. Motors rotate the capstans to adjust the cable lengths to the payload, and thereby control the orientation of the payload. Initial testing of the prototype was completed using manual control, however the algorithms necessary to fully automate the system are presented in this paper.

control↗

Routing performance analysis and optimization within a massively parallel computer

An apparatus, program product and method optimize the operation of a massively parallel computer system by, in part, receiving actual performance data concerning an application executed by the plurality of interconnected nodes, and analyzing the actual performance data to identify an actual performance pattern. A desired performance pattern may be determined for the application, and an algorithm may be selected from among a plurality of algorithms stored within a memory, the algorithm being configured to achieve the desired performance pattern based on the actual performance data.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Microwave Landing System (MLS) effect on the delivery performance of a fixed-path metering and spacing system

Metering and spacing (M & S) system's algorithms described assume an aircraft two dimensional are navigation capability. The three navigation systems compared were: very high frequency omnidirectional range/distance measuring equipment (VOR/DME) and ILS, VOR/DME and + or - 40 MLS, and VOR/DME and + or - 60 MLS. Other factors studied were M & S tentative schedule point location, route geometry effects, and approach gate location effects. Summarized results are: the MLS offers some improvement over VOR/DME and ILS if all approach routes contain computer assisted turns; pilot reaction to moving the gate closer to the runway threshold may adversely affect M & S performance; and coupling en route metering to terminal scheduling transfers most of the terminal holding to more full efficient, higher altitude en route delay.

Credeur, L.↗

Performance and policy dimensions in internet routing

The Internet Routing Project, referred to in this report as the 'Highball Project', has been investigating architectures suitable for networks spanning large geographic areas and capable of very high data rates. The Highball network architecture is based on a high speed crossbar switch and an adaptive, distributed, TDMA scheduling algorithm. The scheduling algorithm controls the instantaneous configuration and swell time of the switch, one of which is attached to each node. In order to send a single burst or a multi-burst packet, a reservation request is sent to all nodes. The scheduling algorithm then configures the switches immediately prior to the arrival of each burst, so it can be relayed immediately without requiring local storage. Reservations and housekeeping information are sent using a special broadcast-spanning-tree schedule. Progress to date in the Highball Project includes the design and testing of a suite of scheduling algorithms, construction of software reservation/scheduling simulators, and construction of a strawman hardware and software implementation. A prototype switch controller and timestamp generator have been completed and are in test. Detailed documentation on the algorithms, protocols and experiments conducted are given in various reports and papers published. Abstracts of this literature are included in the bibliography at the end of this report, which serves as an extended executive summary.

Mills, David L.↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Integrated Software Systems for Crew Management During Extravehicular Activity in Planetary Terrain Exploration

Initial planetary explorations with the Apollo program had a veritable ground support army monitoring the safety and health of the 12 astronauts who performed lunar surface extravehicular activities (EVAs). Given the distances involved, this will not be possible on Mars. A spacesuit for Mars must be smart enough to replace that army. The next generation suits can do so using 2 software systems serving as virtual companions, LEGACI (Life support, Exploration Guidance Algorithm and Consumable Interrogator) and VIOLET (Voice Initiated Operator for Life support and Exploration Tracking). The system presented in this study integrates data inputs from a suite of sensors into the MIII suit s communications, avionics and informatics hardware for distribution to remote managers and data analysis. If successful, the system has application not only for Mars but for nearer term missions to the Moon, and the next generation suits used on ISS as well. Field tests are conducted to assess capabilities for next generation spacesuits at Johnson Space Center (JSC) as well as the Mars and Lunar analog (Devon Island, Canada). LEGACI integrates data inputs from a suite of noninvasive biosensors in the suit and the astronaut (heart rate, suit inlet/outlet lcg temperature and flowrate, suit outlet gas and dewpoint temperature, pCO2, suit O2 pressure, state vector (accelerometry) and others). In the Integrated Walkback Suit Tests held at NASA-JSC and the HMP tests at Devon Island, communication and informatics capabilities were tested (including routing by satellite from the suit at Devon Island to JSC in Houston via secure servers at VCU in Richmond, VA). Results. The input from all the sensors enable LEGACI to compute multiple independent assessments of metabolic rate, from which a "best" met rate is chosen based on statistical methods. This rate can compute detailed information about the suit, crew and EVA performance using test-derived algorithms. VIOLET gives LEGACI voice activation capability, allowing the crew to query the suit, and receive feedback and alerts that will lead to corrective action. LEGACI and VIOLET can also automatically control the astronaut's cooling and consumable use rate without crew input if desired. These findings suggest that non-invasive physiological and environmental sensors supported with data analysis can allow for more effective management of mission task performance during EVA. Integrated remote and local view of data metrics allow crewmember to receive real time feedback in synch with mission control in preventing performance shortcomings for EVA in exploration missions.

Kuznetz, Lawrence↗