Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “route optimization”

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 217 records · Page 12

Performance Evaluation of the Approaches and Algorithms Using Hamburg Airport Operations

The German Aerospace Center (DLR) and the National Aeronautics and Space Administration (NASA) have been independently developing and testing their own concepts and tools for airport surface traffic management. Although these concepts and tools have been tested individually for European and US airports, they have never been compared or analyzed side-by-side. This paper presents the collaborative research devoted to the evaluation and analysis of two different surface management concepts. Hamburg Airport was used as a common test bed airport for the study. First, two independent simulations using the same traffic scenario were conducted; one by the DLR team using the Controller Assistance for Departure Optimization (CADEO) and the Taxi Routing for Aircraft: Creation and Controlling (TRACC) in a real-time simulation environment, and one by the NASA team based on the Spot and Runway Departure Advisor (SARDA) in a fast-time simulation environment. A set of common performance metrics was defined. The simulation results showed that both approaches produced operational benefits in efficiency, such as reducing taxi times, while maintaining runway throughput. Both approaches generated the gate pushback schedule to meet the runway schedule, such that the runway utilization was maximized. The conflict-free taxi guidance by TRACC helped avoid taxi conflicts and reduced taxiing stops, but the taxi benefit needed be assessed together with runway throughput to analyze the overall performance objective.

nasa-dlr research collaboration↗

Cognitive Communications for NASA Space Systems

The growing complexity of spacecraft constellations, communication relay offerings, and mission architectures drives the need for the development of autonomous communication systems. NASA has traditionally launched single spacecraft missions that are served by the Space Communication and Navigation (SCaN) program. Operations on SCaN networks are typically scheduled weeks in advance, and often each asset serves a single user spacecraft at a time. Recent movement towards swarm missions could make the current approach unsustainable. Additionally, the integration of commercial communication service providers will substantially increase the data transfer options available to new missions. NASA science missions have found benefit in launching swarms of spacecraft, allowing coordinated simultaneous observations from different perspectives. Inter-spacecraft communication (mesh networking) is an enabler for this architecture, as are CubeSats that allow cost-effective provisioning of distributed mission assets. As more complex swarm missions launch, one challenge is coordinating communication within the swarm and choosing the appropriate mechanism for telemetry, tracking, control, and data services to and from Earth. Cognitive communications research conducted by SCaN aims to mitigate the increasing communication complexity for mission users by increasing the autonomy of links, networks, and service scheduling. By considering automation techniques including recent advances in artificial intelligence and machine learning, cognitive algorithms and related approaches enable increased mission science return, improved resource utilization for service provider networks, and resiliency in unpredictable or unplanned environments. The Cognitive Communications Project at the NASA Glenn Research Center develops applications of data-driven, non-deterministic methods to improve the autonomy of space communication. The project emphasizes development of decentralized space networks with artificial intelligence agents optimizing communication link throughput, data routing, and system-wide asset management. This paper discusses the objectives, approaches, and opportunities of the research to address growing needs of the space communications community.

Chelmins, David↗

Cognitive Communications for NASA Space Systems

The Cognitive Communications Project at the NASA Glenn Research Center develops applications of data-driven, non-deterministic methods to improve the autonomy of space communication. The project emphasizes development of decentralized space networks with artificial intelligence agents optimizing communication link throughput, data routing, and system-wide asset scheduling. This paper discusses the objectives, approaches, and opportunities of the research to address growing needs of the space communications community.

Chelmins, David↗

Effect of Airspace Characteristics on Urban Air Mobility Airspace Capacity

As interest in urban air mobility grows, increasingly high density traffic poses a challenge for the transition to safe, efficient, and timely operations. Hundreds of simultaneously demanded flights will need to share the same fleet, infrastructure, and constrained airspace. This paper investigates the feasibility of effectively managing high density traffic in congested urban environments by optimizing the design of airspace route structures. Demand estimations for the Dallas-Fort Worth and Los Angeles areas are used to evaluate potential improvements to airspace route design with the goal to accommodate the projected level of demand.

Urban Air Mobility↗

Effect of Airspace Characteristics on Urban Air Mobility Airspace Capacity

As interest in urban air mobility grows, increasingly high density traffic poses a challenge for the transition to safe, efficient, and timely operations. Hundreds of simultaneously demanded flights will need to share the same fleet, infrastructure, and constrained airspace. This paper investigates the feasibility of effectively managing high density traffic in congested urban environments by optimizing the design of airspace route structures. Demand estimations for the Dallas-Fort Worth and Los Angeles areas are used to evaluate potential improvements to airspace route design with the goal to accommodate the projected level of demand.

Urban Air Mobility↗

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗

Quantum Technologies for UAS (QTech)

Harness the power of quantum technologies to assure the availability of UAS communications against disruptions. Make use of quantum computing (e.g. quantum optimization) and quantum communication (e.g. quantum key distribution) to address the availability cybersecurity challenge. Our approach is three-fold: (1) Utilize quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) Utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents, (3) Utilize quantum key distribution (QKD) to execute secure key sharing in high data rate optical communication and/or anti-jamming protocols for secure RF communication.

Quantum Computing↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗

Performance Evaluation of Adaptive Routing on Dragonfly-based Production Systems

Performance of applications in production environments can he sensitive to network congestion. Cray Aries supports adaptively routing each network packet independently based on the load or congestion encountered as a packet traverses the network. Software can dictate different routing policies, adjusting between minimal and non-minimal bias, for each posted message. We have extensively evaluated the sensitivity of the routing bias selection on application performance as well as whole system performance in both production and controlled conditions. We show that the default routing bias used in Aries-based systems is often sub-optimal and that using a higher bias towards minimal routes will not only reduce the congestion effects on the application but also will decrease the overall congestion on the network. This routing scheme results in not only improved mean performance (by up to 12%) of most production applications hut also reduced run-to-run variability. Our study prompted the two supercomputing facilities (ALCF and NERSC) to change the default routing mode on their Aries-based systems. We present the substantial improvement measured in the overall congestion management and interconnect performance in production after making this change.

Chunduri, Sudheer↗

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗

Identification of Robust Terminal-Area Routes in Convective Weather

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

Pfeil, Diana Michalek↗

System-of-systems optimization of hydrogen infrastructure for heavy-duty freight corridors: The interstate 10 case study

Medium and heavy-duty freight transportation requires hydrogen energy infrastructure that is cost-effective, operationally reliable, spatially coherent, and resilient to demand variability along major corridors. This paper presents an integrated hydrogen corridor planning framework using Oak Ridge National Laboratory's OR-AGENT that couples freight-driven, route-resolved hydrogen demand modeling with optimized station siting, sizing, and station-level techno-economic analysis. The framework is demonstrated for the Interstate 10 freight corridor and the Houston-to-Los-Angeles region. Hydrogen demand is derived from high-resolution origin–destination freight data, duty-cycle characterization, and physics-based energy consumption modeling. Candidate refueling sites are selected from existing heavy-duty diesel fueling locations and optimized subject to onboard storage and station capacity constraints. Resulting station throughputs are evaluated using established techno-economic models for electrolytic hydrogen production and dispensing infrastructure. Results show that a regional, portfolio-level aggregation, average dispensed electrolytic hydrogen cost of $6.87–$7.26/kg is currently feasible, and is strongly influenced by demand density and utilization.

Sujan, Vivek [ORNL] (ORCID:0000000269882342)↗

Mechanical Properties of Aged A709

A709 plate is in the process of being developed and qualified through a collaboration by Argonne National Laboratory (ANL), Idaho National Laboratory (INL), and Oak Ridge National Laboratory (ORNL). The goal is to qualify A709 plate in Section III, Division 5 of the American Society of Mechanical Engineers (ASME) Boiler and Pressure Vessel Code (BPVC). This would permit the construction of A709 plate for fast-reactor structural applications. A tradeoff between creep and creep-fatigue properties was established in prior work. A processing route was identified as providing the optimal balance between creep-rupture and elevated-temperature cyclic properties for the solution annealed condition. This condition, however, resulted in a shorter than desired creep-rupture life. Aging is probed to evaluate its potential at further improving mechanical properties. Aging statically precipitates the solutes in solution prior to service. The processing routes identified as providing the best creep-rupture properties and best balance in mechanical properties are investigated. This report discloses the results from tensile, creep, and elevated-temperature cyclic testing performed at INL on the aged material. The aged properties are compared to solution annealed properties. A709 offers improvement in performance compared to 316H particularly at high temperatures; 316H is a material qualified in Section III, Division 5 of the ASME BPVC. For certain high-temperature fast-reactor design conditions, 316H cannot be used while A709 can.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Abstract for CRADA between National Energy Technology Laboratory and Blacksand Technology, LLC

The National Energy Technology Laboratory (NETL) and Black Sand Technology, LLC (Participant) will collaborate in the optimization of low-cost manufacturing routes to produce ultralow-oxygen reactive metal powders of M=Ti, Zr, and Nb using Mg or Ca as reduction agents. Reactive metals have a strong chemical affinity to oxygen, making it very challenging to produce high-purity metal powders of these elements with extremely low oxygen content. This project integrates multiscale modeling and experimental validation to provide fundamental understanding of the thermodynamic limits on the deoxygenation process through HDH and optimize the key deoxygenation parameters to achieve ultralow oxygen content ≤0.1 wt.% in the reactive metal powders. The collaboration will significantly expedite the optimization of deoxygenation processes, reducing the timeline for refining deoxygenation techniques for Ti, Zr and Nb and other reactive refractory metals by about 0.5 and 2 years, respectively. This accelerated timeline translates to substantial cost savings estimated at $\$$3 million in research and development expenditures.

36 MATERIALS SCIENCE↗

Reference floating wind array designs for three representative regions

This work presents the systematic development of three open-source reference floating wind array designs. The designs are tailored to representative site conditions for three regions of the United States: Humboldt Bay off the coast of California, the Gulf of Maine, and the Gulf of America. We adopted existing reference designs for the individual 15 MW turbines, semisubmersible floating platforms, substations, mooring systems, and power cables – integrating and adapting them as needed for each location. We adapted existing dynamic cable designs to use larger conductor sizes to meet the arrays' power transmission requirements, and we set up redundant mooring systems for each substation. The layout of each array is a uniform-grid design optimized to approximately minimize the levelized cost of energy (LCOE) within a square lease area while satisfying spatial constraints. These constraints ensure adequate clearances between adjacent turbines and between underwater components during the layout optimization to prevent clashing and ensure that all components reside within the lease boundaries. Substations are included to allow accounting for intra-array cable costs. They are placed within the uniform grid to maintain the navigability of the arrays. For each feasible layout considered, annual energy production and cable routing costs are calculated and updated in the LCOE objective function. After the optimization, we refined the cable routing with a mix of algorithmic and manual methods to ensure that the cables avoid mooring system components and approach the substation with adequate clearances. We confirmed the suitability of each reference array's layout by comparing the wake losses at each wind heading angle to the wind rose, observing that the optimized layouts largely avoid wake losses in the predominant wind directions. These reference arrays provide open-source baseline designs to enable future research and innovation of floating wind technology at the array scale.

17 WIND ENERGY↗

Efficiency-optimized relativistic plasma harmonics for extreme fields

Bright harmonic radiation from relativistically oscillating laser plasmas offers a direct route for generating extreme electromagnetic fields. Theory predicts that under optimized conditions, the plasma medium can support strong spatiotemporal compression of laser energy in a coherent harmonic focus (CHF), delivering intensity boosts many orders of magnitude greater than the incident driving laser pulse. Although diffraction-limited performance (spatial compression) and attosecond phase locking (temporal compression) have been demonstrated experimentally, efficient coupling of relativistically intense laser pulse energy into the emitted harmonic cone has not been realized so far. Here we demonstrate that this highly nonlinear interaction can be tailored to deliver the maximum conversion efficiencies predicted from simulations. By fine-tuning the temporal profile of the driving laser on sub-picosecond (<10 −12 s) timescales, energies >9 mJ between the 12th and 47th harmonics are observed. These results are in agreement with the theoretically expected efficiency dependence on harmonic order, verifying that optimal conditions have been achieved in the generation process. This is the important final element required to achieve the expected intensity boosts from a CHF in experiments. Although obtaining spatiotemporal compression and optimal efficiency simultaneously remains challenging, the path to realizing extreme optical field strengths approaching the critical field of quantum electrodynamics (the Schwinger limit at >10 16 V cm −1 or >10 29 W cm −2 ) is now open, permitting all-optical studies of the quantum vacuum and new frontiers for intense attosecond science.

High-harmonic generation↗

Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) for Transportation Hubs (Final Report)

This report summarizes the work performed under the award number EE0008524. The project develops the Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) platform as the next-generation transportation solution based on autonomous electric vehicles (AEV) serving passenger trips from and to urban transportation hubs, to substantially reduce transportation energy consumption. Extensive data collection and analyses were first conducted to understand the demand patterns and energy consumption of hub-based on-road trips. Then, a data-driven framework that consists of an analytical module and a simulation module was proposed. For the analytical module, five planning + operation tools were developed to support the planning and energy-efficient operations of urban AEV services: the charging station planning that robotically allocates charging supplies based on the stationary charging demand distribution; the transit planning and demand adaptive scheduling model that efficiently generates\ candidate transit routes from hubs to other places and dynamically adjusts the transit time table to fit the current demand; the online energy-efficient routing that learns the energy-optimal paths from observations of link-level energy consumption in real-time; the hub-based ridesharing that matches trip requests together with account for the uncertainty of future trip demand and vehicle supply; and finally, the integrated demand prediction and anomaly detection pipeline that leverages the flight/train time table and support other planning/operation tools. To demonstrate the performance of these tools, a scalable high-performance agent-based simulator was built. We divided the urban space into multiple service zones where each zone was considered as an agent for passenger generation and vehicle charging. Two types of AEV agents were coded to model two types of mobility services: AEV taxi and AEV transit. For the AEV taxi, the team implemented the functions of pickup/drop-off passengers, energy-efficient routing, ridesharing, fleet rebalancing, and recharging. For the AEV bus, the team implemented the functions of demand-adaptive route scheduling, passenger boarding, and recharging. A high-performance computing framework was introduced to receive various profiling information (such as link energy updates, vehicle speed) from the simulator instances and communicate the operational commands back to the instances. The numerical experiments show that each of the proposed operational algorithms can reduce energy consumption and improve system efficiency. Furthermore, there exists the need to collectively consider multiple planning + operational strategies as multiple strategies can influence each other in terms of performance impacts. Recommendations for future work related to AEV planning and simulation are discussed.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗