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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS2017

A Machine Learning Concept for DTN Routing

This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

Delay Tolerant Networks↗

NASA NTRS2018

Air Traffic Management Technology Demonstration - 3 (ATD-3) Multi-Flight Common Route (MFCR) Concept of Operations Version 1.0

NASA's Multi Flight Common Route (MFCR) automation represents one element of those technologies focusing primarily on delay recovery in the en route phase of flight. Delay recovery is an attenuation of flight-time delay, accomplished by periodically revising weather-avoidance routing as the convective weather system evolves. MFCR is intended for use by Traffic Management Coordinators (TMCs) in Air Route Traffic Control Centers (ARTCCs, or Centers) and traffic management specialists (TMSs) in the Air Traffic Control System Command Center (ATCSCC). MFCR leverages existing weather, airspace, and traffic data, as well as improvements in navigation, surveillance, communication, and digital information technologies, to build on existing ATM automation and address some of the shortcomings associated with strategic traffic flow management initiatives and weather forecasting uncertainties. These capabilities provide significant potential benefits in the form of time, fuel, and cost savings. The concept of operations described in this document describes MFCR functionality as delivered by NASA to the FAA in December 2017, including a list of potential enhancements that may be realized when the system is fielded.

conops↗

NASA NTRS2014

Development of a Route Crossing Tool for Shared Airspace Environments

In current-day Terminal Radar Approach Control (TRACON) operations, departure and arrival controllers maintain separate and dedicated airspace for their respective traffic flows. Although this practice has obvious safety features, it also leads to inefficiencies; for example, departure aircraft may be routinely capped beneath arrival airspace. With the right decision-support and coordination tools, departures could continue to climb through arrival airspace when sufficient gaps exist. Previous studies of ‘shared airspace’ have examined pre-arranged coordination procedures, as well as tools that gave feedback to the controllers on where gaps between arrivals were located and whether the departure aircraft could be scheduled to fly through those gaps [1, 2, 3, 4]. Since then, the Route Crossing Tool (RCT) has been developed to allow controllers to assess multiple pre-defined route options at points where the arrivals and departures cross, thereby increasing the possibility of climbing a departure through an arrival gap.The RCT aids in ensuring lateral separation between departure and arrival aircraft that pass through the same altitude. Since the RCT can be applied tactically, it can enable aircraft to fly through arrival flows even if these aircraft depart outside scheduled times. The RCT makes use of a set of predefined parallel departure routes crossing the arrival flow at equidistant intersecting points on the arrival route. The RCT uses the Estimated Time of Arrival (ETA) of the departure aircraft at each intersecting point to calculate the lateral separation with the neighboring arrivals when it crosses that point; this information is graphically displayed to the controller. Additionally, the RCT incorporates forecast winds in its ETA predictions.Multiple prototypes of the RCT have been iteratively developed with feedback from Subject Matter Experts (SMEs). This paper presents the final design, the design process, and lessons learned. Initial results from a simulation suggest that the tool was successful in helping controllers to safely climb more aircraft. Controller feedback on the tool was also positive.

shared airspace↗

NASA NTRS2019

Application of Machine Learning Techniques to Delay Tolerant Network Routing

This dissertation discusses several machine learning techniques to improve routing in delay tolerant networks (DTNs). These are networks in which there may be long one-way trip times, asymmetric links, high error rates, and deterministic as well as non-deterministic loss of contact between network nodes, such as interplanetary satellite networks, mobile ad hoc networks and wireless sensor networks. This work uses historical network statistics to train a multi-label classifier to predict reliable paths through the network. In addition, a clustering technique is used to predict future mobile node locations. Both of these techniques are used to reduce the consumption of resources such as network bandwidth, memory and data storage that is required by replication routing methods often used in opportunistic DTN environments. Thesis contributions include: an emulation tool chain developed to create a DTN test bed for machine learning, the network and software architecture for a machine learning based routing method, the development and implementation of classification and clustering techniques and performance evaluation in terms of machine learning and routing metrics.

Dudukovich, Rachel M.↗

NASA NTRS2015

Simple Tool for Aircraft Noise-Reduction Route Design

The design of arrival and departure routes from an airport has to balance the conflicting requirements of fuel efficiency, airport capacity utilization and community emission and noise considerations. The commonly used tools for aircraft noise assessment are the FAA’s Integrated Noise Model (INM) and Aviation Environmental Design Tool (AEDT). These tools are suitable to generate precise noise contours. However, they are harder to use with other tools for route design optimization involving evaluation of a large number of aircraft trajectories. A simplified aircraft noise computation tool, named AIRNOISE, is developed for preliminary aircraft noise-reduction route design in this paper. AIRNOISE computes aircraft noise based on the same SAE-AIR-1845 procedures used by INM and AEDT. AIRNOISE does not consider components related to terrain and atmosphere adjustments. As a result, it is not only computationally efficient but also flexible to use for customized aircraft profiles. The aircraft noise results are compared with the FAA’s AEDT2b and show that the level of accuracy achieved by AIRNOISE can be used to reduce the number of route design options to a small number from a large pool for subsequent accurate analysis by INM.

Li, Jinhua↗

NASA NTRS2015

Dynamic Arrival Routes: A Trajectory-Based Weather Avoidance System for Merging Arrivals and Metering

Convective weather can cause arrival traffic to fly less efficient weather avoidance routes and is the primary cause for time-based metering to be discontinued. Dynamic Arrival Routes (DAR) is a trajectory-based weather avoidance system that is designed to help improve arrival traffic flow when weather is present. The DAR system continuously analyzes airborne arrival flights for opportunities to reroute them to more efficient arrival routes or around weather that is predicted to be on their current flight plan early enough to allow the arrival time-based metering system to adjust its times of arrival for the presence of weather. Analysis of 93 hours of actual traffic over 12 different days from Fort Worth Center showed DAR proposed more efficient arrival reroutes for 352 arrival flights for an average time savings of 12.3 minutes per flight at a look-ahead time of 60 minutes from the meter fix. DAR also identified 642 arrival flights with a need to deviate around weather and proposed weather avoidance routes that were analytically shown to remain weather-free 83 percent of the time for a look-ahead time of 30 minutes from the meter fix.

Arrivals↗

DOE OSTI2020

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

I/O routing in a multidimensional torus network

Chen, Dong↗

DOE OSTI2022

Verification and Validation of START: A Spent Nuclear Fuel Routing and Decision Support Tool

The Stakeholder Tool for Assessing Radioactive Transportation (START) is a web-based geospatial decision-support tool being developed by the US Department of Energy’s Office of Integrated Waste Management (IWM) to support federal interim storage for spent nuclear fuel (SNF) and associated transportation. START provides many functions for the IWM program including: serving as a communications tool for conveying geospatial data and information, an options analysis tool for exploring potential transport modes and routes for transporting SNF from nuclear power plants to future federal interim storage facilities, an emergency response planning tool for Tribes and States to identify training needs along potential SNF transport corridors, an environmental analysis tool for estimating potential radiation dose exposure from incident-free and incident-case SNF transport conditions, and a systems analysis support tool providing route-related inputs for system throughput analysis. As part of the START development process, a verification and validation (V&V) effort is being undertaken. In the initial V&V phase, several outputs of the START tool were checked such as the total distance, population and population densities within the buffer zone, and incident free dose. The V&V process is fluid as it will be utilized after each version change to ensure that the core functionalities of the tool are maintained and the results are consistent with the previous versions. Efforts have also been put into developing scripts to aid in the process of automating certain sections of the V&V work. As some of the V&V efforts use Environmental Systems Research Institute’s (ESRI) tools upon which the START framework is built, the START data were compared against outputs from tools like Quantum Geographic Information System (QGIS) for buffer zone populations and route lengths to ensure independence of the V&V process. Good agreement was observed between the START results and the independent V&V studies with the majority of the differences falling between 1% and 5% for populations within the buffer zone and route distance. This presentation describes the development and design of the START tool, V&V methods employed for various metrics of interest and their respective results, and future plans.

START, transportation, GIS, V&V↗

DOE OSTI2023

Fort Erie Case Study - Transition from Fixed-Route to On-Demand Transit

Rural and smaller-sized communities in North America face unique mobility challenges due to their low population density, lower public transit spending per capita compared to major cities, and a high reliance on private vehicles. In recent years, communities such as Fort Erie, Ontario, have restructured or advanced their public transit systems using on-demand services. Fort Erie is a relatively sparsely populated region of 32,901 residents, spread across a land area of 166 square kilometers (64 square miles), for an average population density of 193 residents per square kilometer (500 per square mile). In October 2021, the town implemented a mobility-on-demand system integrated with smartphone software to replace its fixed-route community bus system, which consisted of four buses with three routes, each with a roughly 1-hour, one-way loop. The new service utilizes a fleet of six minivans, two of which are retrofitted with wheelchair-accessible ramps. The system may require that a passenger requesting a standard van walk up to 400 meters (a quarter mile) to their pickup location to optimize vehicle routing while providing origin-to-destination service. The on-demand system proved effective in providing service, eclipsing pre-pandemic ridership by 40%, decreasing greenhouse gas emissions per ride by 63%, and decreasing the cost to the town per ride by 29%. This report documents both the previous system and the new system in terms of routes, ridership, costs, fuel, and other notable system parameters. This work is part of an ongoing series of case studies on providing small communities with on-demand, right-sized vehicle service coupled with a smartphone application.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

DOE OSTI2023

Secure eco-routing with databases under homomorphic encryption

A method for generating energy-optimized travel routes for a motor vehicle includes one or more of the following: receiving an origin destination (OD) of the motor vehicle and an encrypted energy consumption database of the motor vehicle; generating N candidate routes for the OD; evaluating encrypted energy consumption over a route using an encrypted energy consumption database; applying at least one of homomorphic addition function or homomorphic multiplication function to the encrypted energy consumption data; and returning N candidate routes and their encrypted energy consumption to a client.

Hegde, Bharatkumar↗

DOE OSTI2023

Intelligent network slicing and policy-based routing engine

One or more aspects of the present disclosure are directed to network optimization solutions provided as software agents (applications) executed on network nodes in a heterogenous multi-vendor environment to provide cross-layer network optimization and ensure availability of network resources to meet associated Quality of Experience (QoE) and Quality of Service (QoS). In one aspect, a network slicing engine is configured to receive at least one request from at least one network endpoint for access to the heterogeneous multi-vendor network for data transmission; receive information on state of operation of a plurality of communication links between the plurality of nodes; determine a set of data transmission routes for the request; assign a network slice for serving the request; determine, from the set of data transmission routes, an end-to-end route for the network slice; and send network traffic associated with the request using the network slice and over the end-to-end route.

Mody, Apurva N.↗

DOE OSTI2020

In-route inductive versus stationary conductive charging for shared automated electric vehicles: A university shuttle service

In-route inductive charging technology, as applied to automated electric vehicles, can help realize a fully automated system of both vehicles and chargers. This study presents a planning optimization analysis for fixed-route automated shuttles supported by in-route inductive charging technology. A techno-economic feasibility of inductive charging was assessed in comparison with stationary charging, including Level 2 AC chargers, and DC fast chargers (DCFCs). This analysis considered both present-day and future vehicle operations and overall system costs. A real project with two circulator Navya Arma shared automated electric vehicles (SAEVs) at the University of Michigan was investigated using real-world collected energy and travel data. The outcomes show that the proper design of quasi-dynamic inductive chargers at designated stops allows SAEVs to realize unlimited driving range and be cost-competitive to DCFC technology. Considering present-day costs and vehicles, low-speed SAEVs can realize charge-sustaining operation at a minimum cost either by implementing a 50-kW inductive charger at two stops with one segment per position and a 29-kWh onboard battery, or by installing a 100-kW inductive charger at one stop with one segment per position and a 28-kWh onboard battery. Overall, considering future costs and vehicles, either a 40-kW charger at one stop with a 29-kWh battery or a 50-kW charger at the north stop with a 14-kWh battery would enable charge-sustaining operation. In addition, quasi-dynamic inductive solution can reduce the onboard battery by about 15% while providing unlimited driving range, but stationary scenarios require about 112% additional battery capacity to support a 12-h driving range.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Joint routing of conventional and range-extended electric vehicles in a large metropolitan network

Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly advantageous for time-constrained delivery routing in dense urban areas, where battery recharging along routes can be too time-consuming to economically justify the use of all-electric vehicles. However, switching from electric to conventional fossil fuel modes also results in higher costs and emissions and lower efficiency. This paper analyzes this heterogeneous vehicle routing problem and describes two solution methods: an exact branch-price-and-cut algorithm and an iterated tabu search metaheuristic. From a methodological perspective, we find that the exact algorithm consistently obtains tight lower bounds that also serve to certify the metaheuristic solutions as near-optimal. From a policy standpoint, we examine a large-scale real-world case study concerning parcel deliveries in the Chicago metropolitan area and quantify various operational metrics including energy costs and vehicle miles traveled. We find that by deploying roughly 20% of range -extended vehicles with a modest all-electric range of 33 miles, parcel distributors can save energy costs by up to 17% while incurring less than 0.5% increase in vehicle miles traveled. Increasing the range to 60 miles further reduces costs by only 4%, which can alternatively be achieved by decreasing the average service time by 1 minute or increasing driver working time by 1 hour. In conclusion, our study reveals several key areas of improvement on which vehicle manufacturers, distributors, and policy makers can focus their attention.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance

Identifying energy-efficient routes in real-time has significant implications for the energy-optimal operations of electric vehicles (EVs). Here, this study proposes a novel model for EV online eco-routing problem, which obtains the minimal expected energy consumption paths (MECPs) for multiple origin-destination (OD) pairs simultaneously. Specifically, we formulate the routing problem as a bandit problem and solve it with online algorithms. We extend the algorithms by implementing a path elimination mechanism to reduce the candidate path set and introducing the variance and covariance of the energy consumption to reduce the uncertainties. The numerical results show that the proposed algorithms can efficiently obtain near-optimal MECPs, and the solution is significantly better than the widely used shortest trip time path algorithm (STTP) and shortest trip distance path algorithm (SDP). The variation considering link energy covariance and path elimination generates paths that save 4.1% of energy compared to the SDP and 5.4% to the STTP.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2020

Multi-Commodity Traffic Signal Control and Routing With Connected Vehicles

We report a real-time traffic management policy that integrates traffic signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed policy is based on a multi-commodity formulation of the store-and-forward model and assumes all vehicles are able to exchange information with the infrastructure. Vehicles share information about their current location and final destination. Based on this information, the strategy determines both optimized signal timings at every intersection and vehicle-specific routing information at every link of the network. The control actions, i.e., signal times and routing information, are updated at every cycle and delivered by a finite horizon optimal control problem cast into a rolling horizon framework. The underlying optimization problem is convex, and thus the method is suitable for real-time operation in large networks. The method is validated via a micro-simulation study in networks with up to twenty intersections and, in all simulations, outperforms a real-time traffic-responsive signal control strategy that is based on a single-commodity store-and-forward model. The scalable computation effort for increasing network sizes and prediction horizon confirms the computational efficiency of the method.

42 ENGINEERING↗

NASA NTRS2008

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

CGR↗

NASA NTRS2016

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

uncertainty↗