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 55 records · Page 3

Future of Fuel Savings

Using automation to free up controllers for more strategic management of air traffic is one approach being studied by NASA as it seeks to boost airspace system capacity and efficiency, thereby saving fuel. Heinz Erzberger, a NASA Ames Research Center senior scientist, says the Advanced Airspace Concept (AAC) has been studied for several years. It could increase efficiency 15% by providing optimal routes that cut airlines direct operating costs. A 25% increase in landings on existing runways could follow an important benefit. AAC is one of the efforts to be reviewed by the Joint Planning and Development Organization, an FAA-led initiative by six federal agencies to redesign the U.S. air transportation system by 2025. The main goal is to triple air traffic capacity within 20 years to avert the sort of gridlock that would make fuel consumption only one of many travel nightmares. The automated system approach would allow aircraft to fly optimal trajectories. A trajectory would be defined in the standard three dimensions and eventually include the fourth, time. The management of air traffic by the data-linked exchange of trajectories would start at high altitude and eventually move down to lower altitudes. The automated concept is an outgrowth of the type of tools developed by NASA for use by FAA controllers in managing traffic flows over the years, including ones that optimize routings for the best fuel burn. But AAC would push automation further to reduce workload so controllers can focus on "solving strategic control problems, managing traffic flow during changing weather and ... other unusal events." One key component, the automated trajectory server (ATS), is a ground systems that would rely on software to manage flight path requests from aircrews and controllers. But, Erzberger acknowledges, "The FAA's current plan for upgrades to air traffic services does not include [allowing] the future ground system to issue separation-critical clearances of trajectory changes autonomously to aircraft via data link without explicit approval of a controller," as the AAC proposes. The AAC enables pilots or controllers to data link requests for a trajectory change to the ATS for approval after they are deconflicted with the paths of other aircraft. To divert around storms, for example, pilots could data link their trajectory preference to the ATS. Since several aircraft might request similar routes, the computer would then have to suggest alternatives. This could be accomplished without pilot-controller radio calls, a big bottleneck now. The ATS would have a built-in conflict monitor to call for a resolution (turn, climb or descend), when loss of separation is likely in 1-20 min. The AAC system would reduce controller errors by 90%, according to NASA Ames estimates. The AAC would have a back-up program to assure separation-Tactical Separation Assurance (TSAFE). It s designed to detect short-term traffic conflicts within 3-4 min. of loss of separation. The last line of defense would still be provided by traffic alert & collision avoidance systems (TCAS).

Hughes, David↗

Optimal assignment for the single-household shared autonomous vehicle problem

Autonomous vehicles have the potential to transform the way people are transported. While driverless technology may mean fewer vehicles are required to transport people to and from their daily activities, such changes may result in increased congestion or total miles traveled. In this study, we solve the single-household shared autonomous vehicle problem to identify cost-optimal routings of vehicles throughout the day. Such a tool will be useful for consumers seeking to minimize cost and for regulators seeking to understand and predict how people may behave in different scenarios. Here, we provide a thorough literature review and construct a mixed-integer linear program to minimize the daily travel cost of a household attending a given set of activities. Since solution time is a determinant for applicability of such a model, we present the model in a component-wise fashion. This approach allows us to understand which features most affect the problem complexity and solution time. We note that modeling carpooling is the feature that most increases time to find an optimal solution, and we therefore propose a novel modeling technique for carpooling two people. We illustrate the performance of our model by comparing it with other models from the literature and note that our model can solve significantly larger problem instances and in a time that is short enough to facilitate real-time scheduling. We also highlight the utility of our model for regulators, who can use it to analyze quickly produced optimal routes under different cost/tax scenarios.

33 ADVANCED PROPULSION SYSTEMS↗

Simulation and Flight Test Environments for the TASAR Traffic Aware Planner

The Traffic Aware Planner (TAP) software is a flight deck decision support tool that enhances the flight crew’s ability to make flight-optimizing route change requests while airborne. The software provides conflict-free, optimized trajectory suggestions during en route flight to produce time- and fuel-savings compared to the current trajectory. The TAP software requires evaluation in an operational environment with real pilot users to validate projected benefits. To this end, a set of developmental test environments have been developed to mature the software and mitigate technical risk prior to entering operational evaluation. The unique attributes of each test environment were leveraged to provide a range of purpose- and case-dependent TAP software tests. This paper describes the elements of a testing environment, discusses several environments of varying fidelity used to test the TAP software, and provides a review of two case studies highlighting the vital role testing played in the TAP software development process.

Barney, Terique L.↗

Aircraft Trajectory Design Based on Reducing the Combined Effects of Carbon-Dioxide, Oxides of Nitrogen and Contrails

Aircraft operations need to meet the combined requirements of safety, efficiency, capacity and reduced environmental impact. Aircraft routes can be made efficient by flying wind optimal routes. However, the desire to reduce the impact of aviation emissions and contrails may result in trajectories, which deviate from wind optimal trajectories leading to extra fuel use. The lifetime associated with different emissions and contrails varies from a few hours to several hundred years. The impact of certain gases depends on the amount and location of the emission, and the decision-making horizon, in years, when the impact is estimated. The Absolute Global Temperature Potential (AGTP) is used as a metric to measure the combined effects of emissions and contrails. This paper extends earlier work by the authors to include the effect of oxides of nitrogen in the development of aircraft trajectories to reduce the combined effects of carbon dioxide, oxides of nitrogen (NOX) and contrails. The methodology is applied to air traffic in the continental US. The paper shows the trade-offs between reducing emissions and the cost of extra fuel using a fuel sensitivity index, defined as the reduction in AGTP per kg of fuel. The paper shows the performance of the optimization strategy for decision intervals of 10, 25 and 100 years. Based on the simplified models, the inclusion of NOX emissions has a slight influence on the minimal climate impact trajectories when the decision horizons are around 25 years.

air trafic optimization↗

Aircraft Trajectory Design Based on Reducing the Combined Effects of Carbon-di-oxide, Nitrogen and Contrails

Aircraft operations need to meet the combined requirements of safety, efficiency, capacity and reduced environmental impact. Aircraft routes can be made efficient by flying wind optimal routes. However, the desire to reduce the impact of aviation emissions and contrails may result in trajectories, which deviate from wind optimal trajectories leading to extra fuel use. The lifetime associated with different emissions and contrails varies from a few hours to several hundred years. The impact of certain gases depends on the amount and location of the emission, and the decision-making horizon, in years, when the impact is estimated. The Absolute Global Temperature Potential (AGTP) is used as a metric to measure the combined effects of emissions and contrails. This paper extends earlier work by the authors to include the effect of oxides of nitrogen in the development of aircraft trajectories to reduce the combined effects of carbon dioxide, oxides of nitrogen (NOX) and contrails. The methodology is applied to air traffic in the continental US. The paper shows the trade-offs between reducing emissions and the cost of extra fuel using a fuel sensitivity index, defined as the reduction in AGTP per kg of fuel. The paper shows the performance of the optimization strategy for decision intervals of 10, 25 and 100 years. Based on the simplified models, the inclusion of NOX emissions has a slight influence on the minimal climate impact trajectories when the decision horizons are around 25 years.

Sridhar, Banavar↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

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 Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗

Applying the Cognitive Space Gateway to Swarm Topologies

NASA's future vision for interplanetary networking includes a lunar network, Cube Satellite (CubeSat) constellations, and deep space robotic missions, comprising what could be viewed as a network of networks. Delay-tolerant networking (DTN) architecture and protocols provide a standard network layer among these varying scenarios and mitigate many challenges of the space environment, such as long delays, unplanned service interruptions, and asymmetric links. The Cognitive Space Gateway (CSG) is a routing method in a DTN architecture that uses spiking neural networks as the learning element to optimize routing decisions in a complex environment. This work aims to further develop cognitive networking technologies in several critical areas, including DTN, the CSG algorithm, CubeSat swarm topologies, and cloud services. To test the algorithm in a realistic scenario, the emulated network topology is based on a CubeSat swarm. The swarm may function as a mesh of nodes or as a hub-and-spoke network. An emulation environment will be built upon a commercial cloud service, such as Amazon Web Services (AWS) Elastic Compute Cloud. The cloud environment may enable a flexible, lower maintenance approach versus a multi-hop network based in a physical laboratory. The cloud platform will provide a secure environment allowing for collaboration among government and academic entities.

Ricardo Lent↗

Network-Control Algorithm

Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

Chan, Hak-Wai↗

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗

Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service

Affordable public transit services are crucial for communities since they enable residents to access employment, education, and other services. Unfortunately, transit services that provide wide coverage tend to suffer from relatively low utilization, which results in high fuel usage per passenger per mile, leading to high operating costs and environmental impact. Electric vehicles (EVs) can reduce energy costs and environmental impact, but most public transit agencies have to employ them in combination with conventional, internal-combustion engine vehicles due to the high upfront costs of EVs. To make the best use of such a mixed fleet of vehicles, transit agencies need to optimize route assignments and charging schedules, which presents a challenging problem for large transit networks. We introduce a novel problem formulation to minimize fuel and electricity use by assigning vehicles to transit trips and scheduling them for charging, while serving an existing fixed-route transit schedule. We present an integer program for optimal assignment and scheduling, and we propose polynomial-time heuristic and meta-heuristic algorithms for larger networks. We evaluate our algorithms on the public transit service of Chattanooga, TN using operational data collected from transit vehicles. Our results show that the proposed algorithms are scalable and can reduce energy use and, hence, environmental impact and operational costs. For Chattanooga, the proposed algorithms can save $145,635 in energy costs and 576.7 metric tons of CO 2 emission annually.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Analysis of a Dynamic Multi-Track Airway Concept for Air Traffic Management

The Dynamic Multi-track Airways (DMA) Concept for Air Traffic Management (ATM) proposes a network of high-altitude airways constructed of multiple, closely spaced, parallel tracks designed to increase en-route capacity in high-demand airspace corridors. Segregated from non-airway operations, these multi-track airways establish high-priority traffic flow corridors along optimal routes between major terminal areas throughout the National Airspace System (NAS). Air traffic controllers transition aircraft equipped for DMA operations to DMA entry points, the aircraft use autonomous control of airspeed to fly the continuous-airspace airway and achieve an economic benefit, and controllers then transition the aircraft from the DMA exit to the terminal area. Aircraft authority within the DMA includes responsibility for spacing and/or separation from other DMA aircraft. The DMA controller is responsible for coordinating the entry and exit of traffic to and from the DMA and for traffic flow management (TFM), including adjusting DMA routing on a daily basis to account for predicted weather and wind patterns and re-routing DMAs in real time to accommodate unpredicted weather changes. However, the DMA controller is not responsible for monitoring the DMA for traffic separation. This report defines the mature state concept, explores its feasibility and performance, and identifies potential benefits. The report also discusses (a) an analysis of a single DMA, which was modeled within the NAS to assess capacity and determine the impact of a single DMA on regional sector loads and conflict potential; (b) a demand analysis, which was conducted to determine likely city-pair candidates for a nationwide DMA network and to determine the expected demand fraction; (c) two track configurations, which were modeled and analyzed for their operational characteristic; (d) software-prototype airborne capabilities developed for DMA operations research; (e) a feasibility analysis of key attributes in the concept design; (f) a near-term, transitional application of the DMA concept as a proving ground for new airborne technologies; and (g) conclusions. The analysis indicates that the operational feasibility of a national DMA network faces significant challenges, especially for interactions between DMAs and between DMA and non-DMA traffic. Provided these issues are resolved, sectors near DMAs could experience significant local capacity benefits.

Wing, David J.↗

Wind-Optimal Trajectories for Multirotor eVTOL Aircraft on UAM Missions

Distributed electric propulsion powered electric vertical takeoff and landing aircraft are expected to enable urban air mobility. Low specific energy of onboard lithium-ion polymer batteries and wind conditions impose constraints on flight endurance. Therefore, from the safety and efficiency perspective, planning and flying minimum energy trajectories are important.The primary motivation for this paper is to determine if there is an operational benefit to flying wind-optimal trajectories for short flights (less than 60 miles) in the urban environment. This study employs wind-optimal trajectories for a NASA-proposed conceptual multirotor aircraft flight in the urban environment. The optimal control model presented includes a wind model for quantifying the effect of wind on the trajectory. The optimal control problem is numerically solved using the direct method. Energy consumption and flight duration flying wind-optimal trajectories between origins and destinations in a metropolitan area are compared with energy consumption and flight duration flying on the great-circle paths between the same origin and destination pairs to determine the operational benefit of wind-optimal routing for short flights.The flight duration results for different scenarios are validated using a simulation tool designed and developed by NASA for exploring advanced air traffic management concepts. In summary,this research study suggests that for short flights in an urban environment, the wind-optimal trajectories have a very slight (insignificant) operational advantage over the great-circle trajectories in terms of energy consumption and flight duration. As expected, headwinds and tailwinds along the route of flight have a significant impact on energy consumption and flight duration.

Urban Air Mobility↗

Wind-Optimal Lateral Trajectories for a Multirotor Aircraft in Urban Air Mobility

The primary motivation for this paper is to quantify the operational benefits (energy consumption and flight duration) of flying wind-optimal lateral trajectories for short flights (less than 60 miles) anticipated in the urban environment. The optimal control model presented includes a wind model for quantifying the effect of wind on the lateral trajectory. The optimal control problem is numerically solved using the direct collocation method. Energy consumption and flight duration flying wind-optimal lateral trajectories are compared with corresponding values obtained flying great-circle paths between the same origin and destination pairs to determine the operational benefits of wind-optimal routing for short flights. The flight duration results for different scenarios are validated using a simulation tool designed and developed at NASA for exploring advanced air traffic management concepts. This research study suggests that for short flights in an urban environment, operational benefits of the wind-optimal lateral trajectories over the corresponding great-circle trajectories in terms of energy consumption and flight duration per flight are dependent on: i) wind field’s spatial variability, ii) wind magnitude, iii) the direction of route relative to the wind field, and iv) cruise segment length. The operational benefits observed in realistic flyable wind scenarios are less than 2.5%; these could be translated to an equivalent of a maximum of 2 min of cruise flight duration savings in the urban air mobility environment. As expected, headwinds and tailwinds along the flight route most significantly impact energy consumption and flight duration.

Wind-Optimal Trajectory, Lateral Path, Urban Air M↗

exnehilo7/fielddata-lite-iOS-app

Field Expedition Routing and Navigation (FERN) is an IOS app funded by the Center for Bioenergy Innovation (CBI). It allows an end user to make trips to collect novel data points. It allows user to return to previously surveyed points to collect more data. It calculates the optimal route to use to sample points needed for return trips. A companion php/database application is required for full functionality. Links to this open source project are in the README. FERN can use the default GPS on an Iphone but it also optimized for Arrow Gold GPS. Other external GPS could be supported by modifying this code and adding the proper routines.

Hopp, Daniel↗