Search NASA⌕ Search

SEARCH · Search NASA

Results for “routing problems”

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 325 records · Page 18

Scheduling For Urban Air Mobility Using Safe Learning

This work considers the scheduling problem for Urban Air Mobility (UAM) vehicles travelling between origin-destination pairs with both hard and soft trip deadlines. Each route is described by a discrete probability distribution over trip completion times (or delay) and over interarrival times of requests (or demand) for the route along with a fixed hard or soft deadline. Soft deadlines carry a cost that is incurred when the deadline is missed. An online, safe scheduler is developed that ensures that hard deadlines are never missed and that average cost of missing soft deadlines is minimized. The system is modelled as a Markov Decision Process (MDP) and safe model based learning is used to find the probabilistic distributions over route delays and demand. Monte Carlo Tree Search (MCTS) Earliest Deadline First (EDF) is used to safely explore the learned models in an online fashion and develop a near-optimal non-preemptive scheduling policy. These results are compared with Value Iteration (VI) and MCTS (Random) scheduling solutions.

Urban Air Mobility↗

Scheduling for Urban Air Mobility using Safe Learning

This work considers the scheduling problem for Urban Air Mobility (UAM) vehicles travelling between origin-destination pairs with both hard and soft trip deadlines. Each route is described by a discrete probability distribution over trip completion times (or delay) and over interarrival times of requests (or demand) for the route along with a fixed hard or soft deadline. Soft deadlines carry a cost that is incurred when the deadline is missed. An online, safe scheduler is developed that ensures that hard deadlines are never missed and that average cost of missing soft deadlines is minimized. The system is modelled as a Markov Decision Process (MDP) and safe model based learning is used to find the probabilistic distributions over route delays and demand. Monte Carlo Tree Search (MCTS) Earliest Deadline First (EDF) is used to safely explore the learned models in an online fashion and develop a near-optimal non-preemptive scheduling policy. These results are compared with Value Iteration (VI) and MCTS (Random) scheduling solutions.

Urban Air Mobility↗

Eco-Design of River Fishways for Upstream Passage: Application for Hanfeng Dam, Pengxi River, China

This paper provides a scientific approach to eco-design of river fishways to allow upstream movement of fish past new and existing dams in China. This eco-design approach integrates principles of fish ecology/behavior and engineering, a scientific field also known as bio-engineering or eco-hydraulics. We define a fishway as a structure or mechanism to convey fish upstream past a dam. Man-made or natural stream beds can be part of the fishway mechanism. Fish include bony and non-bony fishes, and upstream passage is the concern here, not downstream passage. The problem is dams block access to upstream habitat used for spawning, rearing, and refuge, i.e., dams decrease habitat connectivity. A solution to alleviate this problem is to design fishways, preferably while the dam is being designed, but if necessary, as retrofits afterward to provide a route that fish can and will use to pass safely upstream without undue delay. Our eco-design approach for fishways involves eight steps: 1) identify the primary species of importance; 2) understand basic ecology and behavior of these fish; 3) characterize the environmental conditions where passage is or will be blocked; 4 identify fishway alternatives and select a preferred alternative; 5) establish eco-design criteria for the fishway, either from management agencies or, if necessary, developed specifically for the given site; 6) where needed, identify and perform research required to resolve critical uncertainties and finalize the eco-design criteria; 7) apply the eco-design criteria and site-specific considerations to design the fishway, involving peer-review by local stakeholders in the process; 8) build the fishway, monitor its effectiveness, and apply the lessons learned. Example fishways are described showing a range of eco-designs depending on the dam site and fish species of concern. We apply the eco-design principles to recommend an approach and next steps for a fishway to pass fish upstream at Hanfeng Dam, an existing regulating dam forming Hanfeng Lake on the Pengxi River near Kaixian, China.

China↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗

Multilevel semantic analysis and problem-solving in the flight-domain

The use of knowledge-base architecture and planning control; mechanisms to perform an intelligent monitoring task in the flight domain is addressed. The route level, the trajectory level, and parts of the aerodynamics level are demonstrated. Hierarchical planning and monitoring conceptual levels, functional-directed mechanism rationalization, and using deep-level mechanism models for diagnoses of dependent failures are discussed.

Chien, R. T.↗

Long-range energy-state maneuvers for minimum time to specified terminal conditions

The calculus of variations and energy-state approximation are used to determine the optimum maneuvers in three-dimensional minimum-time aircraft flight paths to a specified final point or line. Constraints on thrust, Mach number, angle of attack, dynamic pressure, and load factor are included. It is shown that when the initial range is sufficiently large that the maximum velocity constraint is encountered en route, the calculation of minimum-time maneuvers can be greatly simplified by a separation of arcs into two two-parameter problems. Suboptimal paths along which the bank angle is restricted to three discrete values (negative maximum angle, 0, positive maximum angle) compare favorably with the optimum, continuous bank angle solutions for transonic speeds and below.

Parsons, M. G.↗

The basics of least cost analysis for archaeological applications

Here we report that Least Cost Analysis (LCA) is a geospatially focused quantitative approach that can help archaeologists better understand how people may have moved across a landscape. At its core is the assumption that humans make decisions about movement as fully rational actors with complete knowledge of the landscape, attempting to minimize the cost of that movement as they travel from one location to another. LCA is most often used to construct a small number of hypothetical routes between locations of interest and, when used effectively, can even lead to the creation of entire transportation networks. Desktop GIS software packages, both commercial and open source, make running LCA relatively straightforward, but that does not necessarily mean that the output is informative or accurate. The following tutorial is designed to expose the reader to the foundational steps required to complete an LCA workflow, along with the scientific rationale behind each step and how to avoid potential pitfalls that one might run into along the way. Finally, relevant literature is cited throughout the tutorial in order to provide context for the technical methods that underpin available tools, to suggest various ways that LCA can be used to solve archaeological problems, and to show the art of the possible.

58 GEOSCIENCES↗

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↗

Nitrogen and sulfur co-doped porous carbon sheets for energy storage and pH-universal oxygen reduction reaction

Developing efficient electrocatalysts for energy storage and oxygen reduction reaction (ORR) is of great sig-nificance for the utilization of renewable energy. In particular, designing catalysts with both promising activityand long stability for ORR in pH-universal electrolytes still remain as a tremendous challenge. To tackle such aproblem, metal-free nitrogen and sulfur co-doped porous carbon sheet (NSPCS) was rationally designed in thiswork in order to integrate the two reported routes of enhancing the electrocatalytic activity of graphene. The as-prepared NSPCS has an onset potential of 0.89 V vs. RHE, and half-wave potential E1/2 ≈ 0.75 V during ORR inacidic solution, making it as the most active ORR catalyst. Moreover, the resulting NSPCS also shows a 0.03 Vpositive shift of half-wave potential than commercial Pt/C for ORR and excellent charge capacitive performancein alkaline media. Electron microscopy revealed high degree of defects on NSPCS surface. This, coupled withsynergistic doping effects of nitrogen and sulfur, optimized the active sites and charge transfer, rationalized theoutstanding performance in both oxygen reduction reactions and supercapacitors.Developing efficient electrocatalysts for energy storage and oxygen reduction reaction (ORR) is of great significance for the utilization of renewable energy. In particular, designing catalysts with both promising activity and long stability for ORR in pH-universal electrolytes still remain as a tremendous challenge. To tackle such a problem, metal-free nitrogen and sulfur co-doped porous carbon sheet (NSPCS) was rationally designed in this work in order to integrate the two reported routes of enhancing the electrocatalytic activity of graphene. The as-prepared NSPCS has an onset potential of 0.89 V vs. RHE, and half-wave potential E-1/2 approximate to 0.75 V during ORR in acidic solution, making it as the most active ORR catalyst. Moreover, the resulting NSPCS also shows a 0.03 V positive shift of half-wave potential than commercial Pt/C for ORR and excellent charge capacitive performance in alkaline media. Electron microscopy revealed high degree of defects on NSPCS surface. This, coupled with synergistic doping effects of nitrogen and sulfur, optimized the active sites and charge transfer, rationalized the outstanding performance in both oxygen reduction reactions and supercapacitors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Biased deposition of Nb-ON-Cu for SRF accelerators, Final Report

The Phase I project objectives were: Task 1: Design, assemble, and commission a new coating facility that uses the RF cavity as the vacuum chamber Task 3: Coat and RF test biased Cu cavity Task 4: Evaluate test results and prepare Ph-II bid. As for project accomplishments, AASC has completed all of the tasks of Ph-I. However, for Task 2, we found a limit to the bias voltage on a substrate placed at the radius of the beam pipe. A bias voltage higher than -50 V can induce arcing from the substrate to the grounded anode. Arc spots form on the substrate and damage the film. The main problem addressed by this SBIR project is that the price of niobium dominates the cost of superconducting RF cavity production. The most effective route to significant cost reduction is to use cavities that have a thin layer of niobium deposited on a less expensive substrate. However, all attempts to use thin films of niobium in superconducting RF cavities have to date resulted in cavity performance that does not meet the requirements of modern linear accelerators. Alameda Applied Sciences Corporation (AASC) has developed a novel deposition method that can produce high-purity films of niobium. For superconducting radio-frequency (SRF) accelerator cavities, films of niobium on another base material could provide good performance at lower cost than for bulk niobium. The primary goal of all thin film coated approaches must be to demonstrate RF performance that matches that of bulk Nb cavities. This Ph-I was not expected to accomplish this major milestone for thin film coated SRF cavities in just 9 months with limited resources. We set less ambitious goals of demonstrating that using our CED process to coat a biased substrate could result in an increase of RF performance over previous tests with no applied bias voltage. In this Ph-1, we obtained preliminary RF data from Nb coated biased cavity structures so as to move ahead in Ph-II to demonstration of performance that approaches that of bulk Nb. Our task has been made more daunting recently as several labs (Fermilab, Cornell, and JLab) have demonstrated significantly improved performance of bulk Nb cavities using nitrogen doping and rapid cool-down techniques. The bar has just been raised for thin films. At the 2013 SRF thin film workshop held at INFN in Padua Italy, leading scientists from the LHC tossed a gauntlet to the thin film community. The LHC plans a high luminosity upgrade starting in about 4 years. Upper management at CERN has stated that they would prefer not to use bulk Nb for the upgrade, which will require hundreds of new SRF cavities. But the thin film community has a short window in which to demonstrate that a Cu (or Al) cavity that is coated with Nb delivers the kind of performance that we have come to expect from bulk Nb: Q o >10 10 that stays flat up to 20 MV/m or higher, good statistics from multiple cavities and reliable operation over thousands of hours. Breakthroughs are needed to meet these daunting goals. AASC has persisted with this challenge for more than five years now, with the benefit of DOE SBIR funding. We aim to preserve our momentum and build upon our base to try to reach the lofty goals within four more years.

36 MATERIALS SCIENCE↗

Cell Libraries

A NASA contract led to the development of faster and more energy efficient semiconductor materials for digital integrated circuits. Gallium arsenide (GaAs) conducts electrons 4-6 times faster than silicon and uses less power at frequencies above 100-150 megahertz. However, the material is expensive, brittle, fragile and has lacked computer automated engineering tools to solve this problem. Systems & Processes Engineering Corporation (SPEC) developed a series of GaAs cell libraries for cell layout, design rule checking, logic synthesis, placement and routing, simulation and chip assembly. The system is marketed by Compare Design Automation.

Source record↗

Locomotion in a rotating space station: a synthesis of new data with established concepts

Despite technical problems associated with designing a rotating space station it is still thought that such a device may provide a more tolerable work environment and prevent some of the physiological changes that currently pose a threat to long-duration space missions. In the present analysis four case studies are presented and the results show that centrifugal and Coriolis effects could hinder one's ability to walk or run in a natural way in such an environment. In a rotating station that has a nominal 'G-level' equal to that on earth it can be shown that a person running at 3.8 m s -1 could experience foot 'heaviness' effects that range from 1 to 3 g and fore-aft foot 'forces' that range fom -0.5 to +0.5 g. In contrast the hip region could sense a relatively constant 'force' equal to 2 g. With regard to the body as a whole there would be 'weight changes' that depended on the direction of gait. While these conditions imply that locomotion in a rotating space station would be different from normal gait, it is likely that given sufficient training, astronauts could learn optimal strategies to account for centrifugal and Coriolis effects on individual body segments. The learning process would also entail developing strategies on which route to take when moving from one location to another, since in many cases the shortest route would not be the least energy consuming. Such training would be justified if it were shown that artificial gravity was an effective countermeasure to the problems of muscle atrophy and bone loss.

NASA Discipline Musculoskeletal↗

Fleet Assignment Using Collective Intelligence

Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).

Antoine, Nicolas E.↗

A Near-Term Concept for Trajectory Based Operations with Air/Ground Data Link Communication

An operating concept and required system components for trajectory-based operations with air/ground data link for today's en route and transition airspace is proposed. Controllers are fully responsible for separation as they are today, and no new aircraft equipage is required. Trajectory automation computes integrated solutions to problems like metering, weather avoidance, traffic conflicts and the desire to find and fly more time/fuel efficient flight trajectories. A common ground-based system supports all levels of aircraft equipage and performance including those equipped and not equipped for data link. User interface functions for the radar controller's display make trajectory-based clearance advisories easy to visualize, modify if necessary, and implement. Laboratory simulations (without human operators) were conducted to test integrated operation of selected system components with uncertainty modeling. Results are based on 102 hours of Fort Worth Center traffic recordings involving over 37,000 individual flights. The presence of uncertainty had a marginal effect (5%) on minimum-delay conflict resolution performance, and windfavorable routes had no effect on detection and resolution metrics. Flight plan amendments and clearances were substantially reduced compared to today s operations. Top-of-descent prediction errors are the largest cause of failure indicating that better descent predictions are needed to reliably achieve fuel-efficient descent profiles in medium to heavy traffic. Improved conflict detections for climbing flights could enable substantially more continuous climbs to cruise altitude. Unlike today s Conflict Alert, tactical automation must alert when an altitude amendment is entered, but before the aircraft starts the maneuver. In every other failure case tactical automation prevented losses of separation. A real-time prototype trajectory trajectory-automation system is running now and could be made ready for operational testing at an en route Center in 1-2 years.

McNally, David↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

Fuel Efficient Speed Optimization for Real-World Highway Cruising

This paper introduces an eco-driving highway cruising algorithm based on optimal control theory that is applied to a conventionally-powered connected and automated vehicle. Thanks to connectivity to the cloud and/or to infrastructure, speed limit and slope along the future route can be known with accuracy. This can in turn be used to compute the control variable trajectory that will minimize energy consumption without significantly impacting travel time. Automated driving is necessary to the implementation of this concept, because the chosen control variables (e.g., torque and gear) impact vehicle speed. An optimal control problem is built up where quadratic models are used for the powertrain. The optimization is solved by applying Pontryagin’s minimum principle, which reduces the problem to the minimization of a cost function with parameters called co-states. The proposed algorithm assumes piecewise constant slopes and speed limits, and it solves the transition vehicle speeds for each junction of such segments. In addition, a method to extract route information from digital maps is presented, which complies with the proposed optimization algorithm. The algorithms are evaluated in simulation, using Autonomie, a simulation tool for vehicle energy consumption modeling. The optimal control trajectory (e.g., torque, gear) is first computed offline. It is then applied in an open-loop fashion in online simulation, using a forward-looking model of the vehicle in Autonomie. Simulation results show over 8% fuel saving for two selected real-world routes.

Simulation and modeling, Optimization, Vehicle net↗

Scalable One‐Step Gel Conversion Route to High‐Performance CHA Zeolite Hollow Fiber Membranes and Modules for CO 2 Separation

Efficient separation of CO 2 from other molecules such as CH 4 , N 2 , and hydrocarbons is a key problem in many energy production and greenhouse gas reduction schemes. Zeolite materials demonstrate attractive gas separation properties, but their industrial application as membranes in gas separation are elusive because of high cost and low reproducibility of conventional fabrication techniques. A facile method is demonstrated for the fabrication of high‐silica CHA zeolite membranes on low‐cost alumina hollow fiber substrates by a one‐step direct gel conversion method, along with a detailed characterization of the CHA hollow fiber membranes. To demonstrate the scalability of the method, 20 hollow fiber (710 μm OD and 390 μm ID) membranes are synthesized in the same batch and assembled into a module. Under dry conditions, the membranes show an excellent CO 2 permeance up to 3500 GPU (1 Gas Permeation Unit = 3.348 × 10 −10 mol m −2 s −1 Pa −1 ) and an excellent CO 2 separation performance (e.g., CO 2 /CH 4 separation factors up to 210 in the 1–7 bar feed pressure range). In addition, the membranes exhibit a considerable increase in CO 2 selectivity under humid (saturated water vapor) conditions with moderate permeance drops. This study opens a promising new path for accelerated development of low‐cost zeolitic membranes for gas separation technology.

Yang, Shaowei↗