Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Reconfigurable Robust Routing for Mobile Outreach Network

The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

Lin, Ching-Fang↗
NASA NTRS2004

Routing Algorithm Exploits Spatial Relations

A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

Okino, Clayton↗
NASA NTRS2014

Real-Time Global Flood Estimation Using Satellite-Based Precipitation and a Coupled Land Surface and Routing Model

A widely used land surface model, the Variable Infiltration Capacity (VIC) model, is coupled with a newly developed hierarchical dominant river tracing-based runoff-routing model to form the Dominant river tracing-Routing Integrated with VIC Environment (DRIVE) model, which serves as the new core of the real-time Global Flood Monitoring System (GFMS). The GFMS uses real-time satellite-based precipitation to derive flood monitoring parameters for the latitude band 50 deg. N - 50 deg. S at relatively high spatial (approximately 12 km) and temporal (3 hourly) resolution. Examples of model results for recent flood events are computed using the real-time GFMS (http://flood.umd.edu). To evaluate the accuracy of the new GFMS, the DRIVE model is run retrospectively for 15 years using both research-quality and real-time satellite precipitation products. Evaluation results are slightly better for the research-quality input and significantly better for longer duration events (3 day events versus 1 day events). Basins with fewer dams tend to provide lower false alarm ratios. For events longer than three days in areas with few dams, the probability of detection is approximately 0.9 and the false alarm ratio is approximately 0.6. In general, these statistical results are better than those of the previous system. Streamflow was evaluated at 1121 river gauges across the quasi-global domain. Validation using real-time precipitation across the tropics (30 deg. S - 30 deg. N) gives positive daily Nash-Sutcliffe Coefficients for 107 out of 375 (28%) stations with a mean of 0.19 and 51% of the same gauges at monthly scale with a mean of 0.33. There were poorer results in higher latitudes, probably due to larger errors in the satellite precipitation input.

global flood estimation↗
NASA NTRS2013

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

transportation network↗
NASA NTRS2018

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts: Fourth 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. This version of the algorithm now accommodates routes that are totally in the cruise regime. The algorithm calculates the altitude, speed, along path distance, and along path time for each waypoint. Wind data at each of these waypoints are also used for the calculation of ground speed and turn radius.

Abbott, Terence S.↗
NASA NTRS2018

Prolonging Wireless Sensor Network Lifetime Using Routing Protocol

Prolonging network lifetime is one of the challenging issues of Wireless Sensor Networks (WSN). Many techniques have been proposed to achieve a longer battery life for the sensor nodes. In this paper, we focus on the routing technique to improve the battery life and extend the network lifetime. Our protocol is based upon the two existing protocols, namely, LEACH (Low-Energy Adaptive Clustering Hierarchy) and PEGASIS (Power Efficient GAthering in Sensor Information Systems). By combining these two basic routing techniques, we propose a new protocol which provides an increase in network lifetime compared to the existing basic protocols.

Salam, Mohammad Abdus↗
NASA NTRS2019

Evaluation of Classifier Complexity for Delay Tolerant Network Routing

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.

Dudukovich, Rachel↗
NASA NTRSDate not supplied

Effects of Unmanned Aircraft Voice Communication Delay on En Route Air Traffic Management Operations

The present study investigated the effects of remotely piloted unmanned aircraft (UA) voice communication delay on air traffic management operations with different background sector traffic-volume levels. Three one-way UA voice delay lengths of 400, 900, and 2,000 milliseconds (ms) were tested, representing the currently estimated transmission delays for terrestrial, satellite communication (SATCOM), and long SATCOM Command and Control Link System, respectively. All delay values exceeded 390 ms, the FAA’s current requirement for the maximum communication latency in the National Airspace System. Eight retired en route air traffic controllers (ATCs) and eight remote pilots (RPs) participated in a human-inthe-loop simulation study, where a simulated UA flight transitioned through an Oakland en route low-altitude sector to a local non-towered airport. The results showed that, when the 2,000-ms voice delay was present, radio transmission step-ons and detect-and-avoid (DAA) alert level elevations increased. In addition, ATC workload, ATC acceptability for the UA, and RP acceptability for the DAA were negatively affected only when the UA had a 2,000-ms voice delay under the high traffic-volume condition, but not in the other conditions.

remotely piloted unmanned aircraft, voice delay, s↗
NASA NTRS2022

Effects of Unmanned Aircraft Voice Communication Delay on En Route Air Traffic Management Operations

The present study investigated the effects of remotely piloted unmanned aircraft (UA) voice communication delay on air traffic management operations with different background sector traffic-volume levels. Three one-way UA voice delay lengths of 400, 900, and 2,000 milliseconds (ms) were tested, representing the currently estimated transmission delays for terrestrial, satellite communication (SATCOM), and long SATCOM Command and Control Link System, respectively. All delay values exceeded 390 ms, the FAA’s current requirement for the maximum communication latency in the National Airspace System. Eight retired en route air traffic controllers (ATCs) and eight remote pilots (RPs) participated in a human-in-the-loop simulation study, where a simulated UA flight transitioned through an Oakland en route low-altitude sector to a local non-towered airport. The results showed that, when the 2,000-ms voice delay was present, radio transmission step-ons and detect-and-avoid (DAA) alert level elevations increased. In addition, ATC workload, ATC acceptability for the UA, and RP acceptability for the DAA were negatively affected only when the UA had a 2,000-ms voice delay under the high traffic-volume condition, but not in the other conditions.

remotely piloted unmanned aircraft, voice delay, s↗
DOE OSTI2020

Method and system for routing based on a predicted connectivity quality

A system and method for routing based on a predicted connectivity quality is disclosed. The method includes receiving, by a controller, map information corresponding to a geographical area. The method also includes receiving, by the controller, wireless connectivity information corresponding to the geographical area. The method also includes generating output data of at least one route between a starting location and a destination location within the geographical area. The generating is based on the wireless connectivity information.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Nb 3 Sn Superconducting Cavities by Bronze Routes for Accelerator Stewardship

This project explored the challenges of making Nb 3 Sn superconducting radio-frequency (SRF) cavities by bronze routes. The SRF research community has prioritized Nb 3 Sn for many reasons, including the possibility to operate linacs for stewardship applications in continuous-wave mode with compact cryogenic systems. Existing Nb 3 Sn approaches use a cavity body made of niobium and apply tin to the polished cavity interior, a starting point that contains the main costs of present niobium cavity technology. Further complexity is then added because a high vacuum and temperature >1100 °C must be used to prevent formation of undesirable Nb-Sn phases, de-gas interstitial contaminants, and maintain the high purity of the Nb body. The project sought a more cost-effective solution for the same performance opportunities by exploiting the Cu-Sn-Nb diffusion reactions used to make Nb 3 Sn superconducting wires for magnets, which can be carried out at ~700 °C and are compatible with much cheaper copper cavity bodies. The project also sought understanding of the materials science and factors that affect superconducting properties. The project has impacted SRF cavity technology by demonstrating feasibility of alternative routes that enable compact, high-power electron accelerators for energy, security, environment, medical, and commercial applications.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

MoRE-Brain: Routed Mixture of Experts for Interpretable and Generalizable Cross-Subject fMRI Visual Decoding

Decoding visual experiences from fMRI offers a powerful avenue to understand human perception and develop advanced brain-computer interfaces. However, current progress often prioritizes maximizing reconstruction fidelity while overlooking interpretability, an essential aspect for deriving neuroscientific insight. To address this gap, we propose MoRE-Brain, a neuro-inspired framework designed for high-fidelity, adaptable, and interpretable visual reconstruction. MoRE-Brain uniquely employs a hierarchical Mixture-of-Experts architecture where distinct experts process fMRI signals from functionally related voxel groups, mimicking specialized brain networks. The experts are first trained to encode fMRI into the frozen CLIP space. A finetuned diffusion model then synthesizes images, guided by expert outputs through a novel dual-stage routing mechanism that dynamically weighs expert contributions across the diffusion process. MoRE-Brain offers three main advancements: First, it introduces a novel Mixture-of-Experts architecture grounded in brain network principles for neuro-decoding. Second, it achieves efficient cross-subject generalization by sharing core expert networks while adapting only subject-specific routers. Third, it provides enhanced mechanistic insight, as the explicit routing reveals precisely how different modeled brain regions shape the semantic and spatial attributes of the reconstructed image. Extensive experiments validate MoRE-Brain’s high reconstruction fidelity, with bottleneck analyses further demonstrating its effective utilization of fMRI signals, distinguishing genuine neural decoding from over-reliance on generative priors. Consequently, MoRE-Brain marks a substantial advance towards more generalizable and interpretable fMRI-based visual decoding.

Wei, Yuxiang [Georgia Institute of Technology]↗
DOE OSTI2022

Routing Problem for Unmanned Aerial Vehicle Patrolling Missions - A Progressive Hedging Algorithm

This paper presents a two-stage stochastic program to model a routing problem involving an Unmanned Aerial Vehicle (UAV) in the context of patrolling missions. In particular, given a set of targets and a set of supplemental targets corresponding to each target, the first stage decisions involve finding the sequence in which the vehicle has to visit the set of targets. Upon reaching each target, the UAV collects information and if the operator of the UAV deems that the information collected is not of sufficient fidelity, then the UAV has to visit all the supplemental targets corresponding to that target to collect additional information before proceeding to visit the next target. The problem is solved using a progressive hedging algorithm and extensive computational results corroborating the effectiveness of the proposed model and the solution methodology is presented.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Postdisaster Routing of Movable Energy Resources for Enhanced Distribution System Resilience: A Deep Reinforcement Learning-Based Approach

The deployment of movable energy resources (MERs) can be an effective strategy to restore critical loads to enhance power system resilience when no other energy sources are available after the occurrence of an extreme event. Since the optimal locations of MERs following an extreme event are dependent on system operating states (e.g., the loads at each node, on/off status of system branches, and so on), existing analytical and population-based approaches must repeat the entire analysis and calculation when the system operating states change. On the contrary, if deep reinforcement learning (DRL)-based algorithms are sufficiently trained with a wide range of scenarios, they can quickly find optimal or near-optimal locations irrespective of changes in system states. A deep Q-learning-based approach is proposed for optimal MER deployment to enhance power system resilience. MERs can be also utilized to complement other types of resources, if available. The proposed approach operates in two stages after the occurrence of extreme events. In the first stage, the distribution network is represented as a graph, and the network is then reconfigured using tie switches by using Kruskal’s spanning forest search algorithm (KSFSA). To maximize critical load recovery, the optimal or near-optimal locations of MERs are chosen in the second stage. Further, case studies on a 33-node distribution system and a modified IEEE 123-node system demonstrate the effectiveness of the proposed approach for postdisaster routing of MERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Investigations Towards Ultra-Low Cost Nb 3 Sn SRF Fabrication via Melt Casted Bronze Route Processing

Here, a novel approach to fabricating Nb 3 Sn SRF cavities and other RF components using an ultra-low-cost melt casting fabrication process has been investigated. This simple, low cost melt casting technique has the potential to be used to fabricate nearly any superconducting Nb3Sn structure using either the Bronze Route (BR), Internal Tin (IT), External Tin (ET) processes as well as normal conducting pure copper (Cu) cavities. Most of the heat treated samples that were examined using SEM/EDX seemed to show a reasonable correlation of T c onset and transition width (ΔT c ) of the ingots initial/starting Sn content to the desired stoichiometric Nb 3 Sn phase, where the lower starting Sn content coupons resulted in lower T c 's with broader transition widths and the higher starting Sn coupons resulted in higher T c 's with narrower ΔT c ’s. The best samples had T c onsets ~17-18 K and ΔT c 's < 2 K. Two samples were further tested for RF surface resistance (R s ) and Quality Factor (Q) at JLAB. Here, these RF measurements were performed at 7.4 GHz using a calorimetric technique and showed two transitions, one at ~ 8 K and another at ~ 14 K; values of R s were at least two orders of magnitude higher than similar high quality Nb 3 Sn films directly deposited substrates by JLAB and with another superconducting transition close to the superconducting transition temperature of niobium. Substantial improvements in the processing variables ranging from higher quality of the initial ingots with higher Sn content, to better electropolishing and reaction heat treatment regimens will be necessary to realize improved RF performance metrics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗
DOE OSTI2020

Multiperiod Distribution System Restoration With Routing Repair Crews, Mobile Electric Vehicles, and Soft-Open-Point Networked Microgrids

This paper proposes a distribution system restoration model which is in response to multiple outages caused by natural disasters. The proposed restoration model includes the coordination of routing repair crews (RRCs), mobile batterycarried vehicles (MBCVs), and networked microgrids (NMGs) formed by soft open points (SOPs). The travel and repair time constraints are modeled for each RRC; travel path and charging strategy are modeled for each MBCV; and the network reconfiguration is developed considering the optimal operation of SOP-based NMGs. Furthermore, the proposed model is presented as a mixedinteger linear program which is solved by an auxiliary induce function based algorithm to reduce the computational complexity. The modified IEEE 33-bus and 69-bus distribution systems are tested with multiple outages. The presented results demonstrate the effectiveness of the proposed model

24 POWER TRANSMISSION AND DISTRIBUTION↗