SEARCH · Search NASA
Results for “Routing”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Quantum Routing and Entanglement Dynamics Through Bottlenecks
To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂(𝑁 𝐿 𝑡) to 𝑂(√𝑁 𝐿 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ(𝑁).
Secure Route: Roadway Risk Mapping for Transportation Planners
The secure transport of sensitive materials across U.S. road networks pose unique challenges for local, state, and federal agencies. Threats range from random events (e.g., accidents, medical emergencies, mechanical failures) to opportunistic or organized tactical assaults. Although the probability of such attacks is very low, the consequences of material loss to foreign states or terrorists can be catastrophic, qualifying these scenarios as “grey swan” events—low-probability, high-impact occurrences that are predictable but difficult to quantify. Traditional risk assessments struggle in these contexts, necessitating a shift toward subjective risk perception to inform planning. Risk perception in transport planning is shaped by various factors, including knowledge of adversarial capabilities, vehicle defenses, manifest details, and geographic features along the route. Geographic features such as bridges, tunnels, roadside elevation, and gaps in cellular coverage introduce vulnerabilities, while mitigative features include safe havens, police stations, and medical services. Temporal variables such as congestion, accidents, and weather further complicate route planning. Despite their importance, existing routing tools like Google Maps and commercial software do not explicitly account for geographic risk features, requiring planners to rely on personal familiarity with routes—a time-intensive, non-scalable approach. This work addresses these gaps by: (1) developing datasets that catalog geographic risk features along U.S. roadways, (2) eliciting risk perceptions from experienced transportation security experts, and (3) linking these perceptions to roadway conditions and geographic data. We implement these capabilities within Secure Route a novel mapping tool for classifying route segment risks associated with roadway conditions. This system provides transportation planners with an intuitive interface to assess and contextualize risk along potential routes, improving decision-making for secure transport. We present current progress in this effort and identify next steps.
Evaluation of Flow Routing on the Unstructured Voronoi Meshes in Earth System Modeling
Flow routing is a fundamental process of Earth System Models' (ESMs) river component. Traditional flow routing models rely on Cartesian rectangular meshes, which exhibit limitations, particularly when coupled with unstructured mesh-based ocean components. They also lack the support for regionally refined models. While previous studies have highlighted the potential benefits of unstructured meshes for flow routing, their widespread application and comprehensive evaluation within ESMs remain limited. This study extends the river component of the Energy Exascale Earth System Model to unstructured Voronoi meshes. We evaluated the model's performance in simulating river discharge and water depth across three watersheds spanning the Arctic, temperate, and tropical regions. The results show that while providing several benefits, unstructured mesh-based flow routing can achieve comparable performance to structured mesh-based routing, and their difference is often less than 10%. Although the unstructured mesh-based method could address several existing limitations, this research also shows that additional improvements in the numerical method are needed to fully exploit the advantages of unstructured mesh for hydrologic and ESMs.
Discrete global grid system-based flow routing datasets in the Amazon and Yukon basins
Abstract. Discrete global grid systems (DGGS) are emerging spatial data structures widely used to organize geospatial datasets across scales. While DGGS have found applications in various scientific disciplines, including atmospheric science and ecology, their integration into physically based hydrological models and Earth system models (ESMs) has been hindered by the lack of flow routing datasets based on DGGS. In response to this gap, this study pioneers the development of new flow routing datasets using icosahedral Snyder equal-area (ISEA) DGGS and a novel mesh-independent flow direction model. We present flow routing datasets for two large basins, the tropical Amazon River basin and the Arctic Yukon River basin. These datasets (1) facilitate the adoption of DGGS for hydrological models and (2) provide flow routing inputs for evaluation of DGGS-based flow routing in the Amazon and Yukon river basins. The data are available at https://doi.org/10.5281/zenodo.8377765 (Liao, 2023).
Enhancing Acute Migraine Treatment: Exploring Solid Lipid Nanoparticles and Nanostructured Lipid Carriers for the Nose-to-Brain Route
Migraine has a high prevalence worldwide and is one of the main disabling neurological diseases in individuals under the age of 50. In general, treatment includes the use of oral analgesics or non-steroidal anti-inflammatory drugs (NSAIDs) for mild attacks, and, for moderate or severe attacks, triptans or 5-HT1B/1D receptor agonists. However, the administration of antimigraine drugs in conventional oral pharmaceutical dosage forms is a challenge, since many molecules have difficulty crossing the blood-brain barrier (BBB) to reach the brain, which leads to bioavailability problems. Efforts have been made to find alternative delivery systems and/or routes for antimigraine drugs. In vivo studies have shown that it is possible to administer drugs directly into the brain via the intranasal (IN) or the nose-to-brain route, thus avoiding the need for the molecules to cross the BBB. In this field, the use of lipid nanoparticles, in particular solid lipid nanoparticles (SLN) and nanostructured lipid carriers (NLC), has shown promising results, since they have several advantages for drugs administered via the IN route, including increased absorption and reduced enzymatic degradation, improving bioavailability. Furthermore, SLN and NLC are capable of co-encapsulating drugs, promoting their simultaneous delivery to the site of therapeutic action, which can be a promising approach for the acute migraine treatment. This review highlights the potential of using SLN and NLC to improve the treatment of acute migraine via the nose-to-brain route. First sections describe the pathophysiology and the currently available pharmacological treatment for acute migraine, followed by an outline of the mechanisms underlying the nose-to-brain route. Afterwards, the main features of SLN and NLC and the most recent in vivo studies investigating the use of these nanoparticles for the treatment of acute migraine are presented.
Route Energy Prediction (RouteE) Powertrain Validation Report
The National Renewable Energy Laboratory's flagship package in the RouteE suite, RouteE-Powertrain, is a mesoscopic energy model that predicts vehicle energy consumption given discrete attributes that describe each segment or link in a vehicle's path on a road network. High-frequency, physics-based, powertrain simulators, such as NREL's FASTSim, are well-suited to model vehicle energy consumption when real driving data and a detailed understanding of the vehicle powertrain specifications are available. However, there are a variety of situations in the past, present (real-time), and future where high-frequency driving data and/or vehicle information may not be available, but reliable energy consumption is still desired, such as energy-aware vehicle routing. These are the ideal applications for RouteE-Powertrain. The suite of RouteE tools also includes RouteE-Compass, which is an eco-routing software that incorporates energy consumption into network routing algorithms, and RouteE-Mobile, which is a prototype smartphone navigation app to demonstrate the integrated capabilities of the RouteE suite for real-world eco-routing. The focus of this validation report is to share key metrics about the data sets and models behind RouteE-Powertrain. The set of RouteE-Powertrain models discussed in this report are made available through the RouteE web API through the NREL Developer Network.
Energy-Aware Route Planning with RouteE Compass
This poster introduces RouteE Compass, a new tool that advances sustainable transportation by enabling energy-aware route planning across diverse vehicle types and large-scale road networks. By addressing practical trade-offs between energy consumption, travel time, and economic cost, RouteE Compass fills critical gaps in traditional routing methods, which often lack the flexibility to prioritize energy directly. The tool's scalability and high-performance computing capabilities allow for national-scale analyses, offering actionable insights for fleet operators, transit agencies, and researchers. As an open-source, extensible platform, RouteE Compass empowers ongoing research and innovation in energy-aware routing, supporting the broader goals of reducing emissions and enhancing transportation sustainability.
A real-time energy and cost efficient vehicle route assignment neural recommender system
Here, this paper presents a neural network recommender system algorithm for assigning vehicles to routes based on energy and cost criteria. In this work, we applied this new approach to efficiently identify the most cost-effective medium and heavy duty truck (MDHDT) powertrain technology, from a total cost of ownership (TCO) perspective, for given trips. We employ a machine learning based approach to efficiently estimate the energy consumption of various candidate vehicles over given routes, defined as sequences of links (road segments), with little information known about internal dynamics, i.e. using high level macroscopic route information. A complete recommendation logic is then developed to allow for real-time optimum assignment for each route, subject to the operational constraints of the fleet. We show how this framework can be used to (1) efficiently provide a single trip recommendation with a top-k vehicles star ranking system, and (2) engage in more general assignment problems where n vehicles need to be deployed over m (m ≤ n) trips. This new assignment system has been deployed and integrated into the POLARIS. Transportation System Simulation Tool for use in research conducted by the Department of Energy's Systems and Modeling for Accelerated Research in Transportation (SMART) Mobility Consortium (SMART, 2024).
Quantum routing with teleportation
We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024
Integrated Routing and Traffic Signal Control for CAVs via Reinforcement Learning Approach
Incorporating Connected and Automated Vehicles (CAVs) into urban traffic networks presents opportunities and challenges for traffic management systems. This paper aims to develop an integrated routing and traffic signal control system designed explicitly for CAVs, utilizing a Reinforcement Learning (RL) approach. The objective is to enhance traffic flow and improve overall transportation efficiency in the controlled areas. We propose an innovative framework that employs the Deep Reinforcement Learning (DRL) algorithm, especially the Deep Q-network (DQN), to dynamically adjust the number of vehicles in the routes and the duration of traffic signals. Our simulation results demonstrate that a DQN agent successfully optimizes the number of vehicles in the routes and traffic signal timings of traffic signal controllers, eventually reducing total travel time. The study illustrates the potential usage of RL-based systems in managing routing and traffic signals for CAVs, offering a promising opportunity for future urban traffic management strategies.
PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks
The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.
Reducing AI RAG Hallucination by Optimizing Routing Techniques
Large Language Models (LLMs), such as ChatGPT, tend to “hallucinate”, meaning they confidently generate false information. Retrieval Augmented Generation (RAG) attempts to diminish hallucination by providing context to the LLM from data stores (indexes) containing relevant information. The LLM uses this context to formulate its response. RAG systems can still suffer from hallucination because of bad embeddings or ineffective routing. For example, a router will often return context from an irrelevant index, resulting in a hallucinated answer. In this study, we aim to minimize the frequency of routing hallucinations by optimizing Index Summary Routing.
Bypassing sulfides: comparing the morphology and performance of solution processed Cu(In,Ga)Se 2 films prepared via two selenide molecular precursor routes
Solution-processing of thin-film photovoltaics offers an alternative to vacuum-deposition based approaches. The amine–thiol reactive solvent system has become a focal point for the solution-processing of chalcogenide species, owing to the convenience of precursor preparation and comparatively high performance of prepared devices. Selenide species prepared via the amine–thiol route typically progress through a sulfide intermediate phase, and as such are commonly afflicted with sulfur and carbon impurities along- side the presence of a carbonaceous fine-grained layer. Here, two routes of preparing films directly to a selenide phase are examined; first by the co-dissolution of selenium in an amine–thiol solution and second via the novel use of reactive alkylammonium polyselenides. Lamella are cut from these selenide precursor films and final devices, and STEM-EDX and TEM are used to characterize film morphology and secondary phases. A champion device efficiency of 11.2% is reported for the novel polyselenide route, and clear paths of improvement are identified.
2011-2012 Maryland Route 200 Travel Survey
The 2011-2012 Maryland Route 200 Travel Survey collected in-vehicle global positioning system (GPS) data to investigate the use of Maryland Route 200, also known as the Intercounty Connector. The University of Maryland conducted the survey between October 2011 and February 2012 in Washington, D.C., and Baltimore, Maryland. Its goal was to increase understanding of the potential use of Maryland Route 200, a tolled freeway connecting Maryland's Montgomery County and Prince George's County. Dedicated in-vehicle GPS devices were installed in 260 vehicles to record location information every 60 seconds if movement was detected. Survey subjects partook in an initial participation form as well as a recall survey, providing social demographic information and a one-day travel diary.
Smart CO2 Transport-Route Planning Tool
NETL has developed the Smart CO2 Transport-Route Planning Tool to help inform energy transport planning and development. The stand-alone, open-source tool applies data-driven, geospatial and machine-learning informed logic to identify potential routes or evaluate existing corridors based on current legislation, best construction practices, and more. Underpinning the interactive tool, is NETL’s CO2 Transport Planning Database (https://edx.netl.doe.gov/dataset/ccs-pipeline-route-planning-database-v1). This geospatial resource contains more than 70 gigabytes of data representing more than 60 critical factors for the spatial routing of CO2 transport, including land use requirements, existing infrastructure, high consequence areas, and natural hazards.
Comparison of Routes of Administration, Frequency, and Duration of Favipiravir Treatment in Mouse and Guinea Pig Models of Ebola Virus Disease
Favipiravir is a ribonucleoside analogue that has been explored as a therapeutic for the treatment of Ebola Virus Disease (EVD). Promising data from rodent models has informed nonhuman primate trials, as well as evaluation in patients during the 2013–2016 West African EVD outbreak of favipiravir treatment. However, mixed results from these studies hindered regulatory approval of favipiravir for the indication of EVD. This study examined the influence of route of administration, duration of treatment, and treatment schedule of favipiravir in immune competent mouse and guinea pig models using rodent-adapted Zaire ebolavirus (EBOV). A dose of 300 mg/kg/day of favipiravir with an 8-day treatment was found to be fully effective at preventing lethal EVD-like disease in BALB/c mice regardless of route of administration (oral, intraperitoneal, or subcutaneous) or whether it was provided as a once-daily dose or a twice-daily split dose. Preclinical data generated in guinea pigs demonstrates that an 8-day treatment of 300 mg/kg/day of favipiravir reduces mortality following EBOV challenge regardless of route of treatment or duration of treatments for 8, 11, or 15 days. This work supports the future translational development of favipiravir as an EVD therapeutic.
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.