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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
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 OSTI2018

Routing of traffic in network through automatically generated and physically distinct communication paths

The present disclosure pertains to systems and methods to identify high-priority traffic within a software defined network (“SDN”) and to route such traffic through physically distinct communication paths. Such routing may help to reduce network congestion faced by high-priority traffic and increase the reliability of transmission of such data. Certain embodiments may further be configured to generate a failover communication path that is physically distinct from a primary communication path. Still further, certain embodiments may be configured to suggest enhancements to a network that may improve a reliability criterion.

Smith, Rhett↗
DOE OSTI2019

Routing of traffic in network through automatically generated and physically distinct communication paths

The present disclosure pertains to systems and methods to identify high-priority traffic within a software defined network (“SDN”) and to route such traffic through physically distinct communication paths. Such routing may help to reduce network congestion faced by high-priority traffic and increase the reliability of transmission of such data. Certain embodiments may further be configured to generate a failover communication path that is physically distinct from a primary communication path. Still further, certain embodiments may be configured to suggest enhancements to a network that may improve a reliability criterion.

Smith, Rhett↗
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 OSTI2011

A general solution-chemistry route to the synthesis LiMPO{sub 4} (M=Mn, Fe, and Co) nanocrystals with [010] orientation for lithium ion batteries

A general and efficient solvothermal strategy has been developed for the preparation of lithium transition metal phosphate microstructures (LiMnPO{sub 4}, LiFePO{sub 4}, and LiCoPO{sub 4}), employing ethanol as the solvent, LiI as the Li source, metal salts as the M sources, H{sub 3}PO{sub 4} as the phosphorus source, and poly(vinyl pyrrolidone) (PVP) as the carbon source and template. This route features low cost, environmental benign, and one-step process for the cathode material production of Li-ion batteries without any complicated experimental setups and sophisticated operations. The as-synthesized LiMPO{sub 4} microstructures exhibit unique, well-shaped and favorable structures, which are self-assembled from microplates or microrods. The b axis is the preferred crystal growth orientation of the products, resulting in a shorter lithium ion diffusion path. The LiFePO{sub 4} microstructures show an excellent cycling stability without capacity fading up to 50 cycles when they are used as a cathode material in lithium-ion batteries. - Graphical abstract: A general and efficient solvothermal strategy has been developed for the preparation of lithium transition metal phosphate microstructures under solvothermal conditions in the presence of PVP. Highlights: > A general and efficient solvothermal strategy has been developed for the preparation of LiMPO{sub 4} microstructures. > This route features low cost, environmental benign, and one-step process. > The LiMPO{sub 4} microstructures exhibit unique, well-shaped, and favorable structures. > The LiFePO{sub 4} microstructures show an excellent cycling stability up to 50 cycles as a cathode material of lithium-ion batteries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
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 OSTI2018

Routing of thylakoid lumen proteins by the chloroplast twin arginine transport pathway

Thylakoids are complex sub-organellar membrane systems whose role in photosynthesis makes them critical to life. Thylakoids require the coordinated expression of both nuclear- and plastid-encoded proteins to allow rapid response to changing environmental conditions. Transport of cytoplasmically synthesized proteins to thylakoids or the thylakoid lumen is complex; the process involves transport across up to three membrane systems with routing through three aqueous compartments. Protein transport in thylakoids is accomplished by conserved ancestral prokaryotic plasma membrane translocases containing novel adaptations for the sub-organellar location. This review focuses on the evolutionarily conserved chloroplast twin arginine transport (cpTat) pathway. An overview is provided of known aspects of the cpTat components, energy requirements, and mechanisms with a focus on recent discoveries. Some of the most exciting new studies have been in determining the structural architecture of the membrane complex involved in forming the point of passage for the precursor and binding features of the translocase components. The cpTat system is of particular interest because it transports folded protein domains using only the proton motive force for energy. In summary, the implications for mechanism of translocation by recent studies focusing on interactions between membrane Tat components and with the translocating precursor will be discussed.

59 BASIC BIOLOGICAL SCIENCES↗
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 OSTI2016

Analysis on vertical directional couplers with long range surface plasmons for multilayer optical routing

A structure featuring vertical directional coupling of long-range surface plasmon polaritons between strip waveguides at λ = 1.55 μm is investigated with the aim of producing efficient elements that enable optical multilayer routing for 3D photonics. We have introduced a practical computational method to calculate the interaction on the bent part. This method allows us both to assess the importance of the interaction in the bent part and to control it by a suitable choice of the fabrication parameters that helps also to restrain effects due to fabrication issues. The scheme adopted here allows to reduce the insertion losses compared with other planar and multilayer devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗