Search NASA⌕ Search

SEARCH · Search NASA

Results for “Routing algorithm”

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

A VLSI implementation of DCT using pass transistor technology

A VLSI design for performing the Discrete Cosine Transform (DCT) operation on image blocks of size 16 x 16 in a real time fashion operating at 34 MHz (worst case) is presented. The process used was Hewlett-Packard's CMOS26--A 3 metal CMOS process with a minimum feature size of 0.75 micron. The design is based on Multiply-Accumulate (MAC) cells which make use of a modified Booth recoding algorithm for performing multiplication. The design of these cells is straight forward, and the layouts are regular with no complex routing. Two versions of these MAC cells were designed and their layouts completed. Both versions were simulated using SPICE to estimate their performance. One version is slightly faster at the cost of larger silicon area and higher power consumption. An improvement in speed of almost 20 percent is achieved after several iterations of simulation and re-sizing.

Kamath, S.↗

Alert Timing Assessment for Unmanned Aircraft System Terminal Area Operations

A Detect and Avoid (DAA) system is an essential enabler for integrating Unmanned Aircraft Systems (UAS) into the U.S. National Airspace System. A DAA system uses a suite of sensors, trackers and alerting and guidance algorithms to assist a remote pilot in maintaining separation from airborne traffic. The initial minimum performance standards focused on en route operations; in order to facilitate operations in and around the airport environment, this paper presents the derivation of the early alert threshold for UAS terminal operations.

Unmanned Aircraft Systems↗

Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking

The expanding presence in space will place an increased dependency on networked communications– a scalable communications infrastructure; that is, the Solar System Internet (SSI). Upcoming developments towards a SSI include NASA’s upcoming LunaNet, or lunar Internet, which provides multi-hop multi-path communications using Delay Tolerant Networking (DTN). DTN has been an active area of research and development, particularly in routing, security, and optimization. DTNs are marked by mobility, disconnection, and a wide variance of latencies (propagation and processing delays). In this paper, we outline progress towards a theory of time synchronization across such a network. An underlying assumption of DTN is that the network is time synchronized already, rather than synchronization being provided as a service. While this is necessary for schedule-based routing, which is necessarily prevalent in DTNs, it is so deeply ingrained as to be built into the primary unit of data in DTNs– the bundle. Indeed, a bundle’s creation timestamp and its time to live (called the lifetime) are based on time, and there are special recommendations for systems that lack accurate clocks. The assumption of time synchronization makes sense when limiting considerations to smaller-scale and more traditional space communication. However, just as end-to-end connectivity cannot be guaranteed in DTNs, neither can access to a reference or authoritative clock. In this more general case, it might be necessary to synchronize over time-varying meshes, and perhaps even to consider relativistic effects. Moreover, by imposing synchronization restrictions in order to sustain a network, the effectiveness of the network to achieve scalability will be necessarily muted. To work towards a time synchronization theory for DTNs, we build upon past successes in modeling DTNs using time-varying graphs and sheaves. This includes error and limitation estimation, which allows one to define domains over which schedule-based routing is possible, up to some threshold sensitivity. Despite the theoretical nature of these results, the approaches taken are also algorithmic, and hence lend themselves to practical implementations. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay Tolerant Networking↗

Multiphysics Simulations: Challenges and Opportunities

We consider multiphysics applications from algorithmic and architectural perspectives, where "algorithmic" includes both mathematical analysis and computational complexity, and "architectural" includes both software and hardware environments. Many diverse multiphysics applications can be reduced, en route to their computational simulation, to a common algebraic coupling paradigm. Mathematical analysis of multiphysics coupling in this form is not always practical for realistic applications, but model problems representative of applications discussed herein can provide insight. A variety of software frameworks for multiphysics applications have been constructed and refined within disciplinary communities and executed on leading-edge computer systems. We examine several of these, expose some commonalities among them, and attempt to extrapolate best practices to future systems. From our study, we summarize challenges and forecast opportunities.

99 GENERAL AND MISCELLANEOUS↗

Multiphysics Simulations: Challenges and Opportunities

We consider multiphysics applications from algorithmic and architectural perspectives, where “algorithmic” includes both mathematical analysis and computational complexity and “architectural” includes both software and hardware environments. Many diverse multiphysics applications can be reduced, en route to their computational simulation, to a common algebraic coupling paradigm. Mathematical analysis of multiphysics coupling in this form is not always practical for realistic applications, but model problems representative of applications discussed herein can provide insight. A variety of software frameworks for multiphysics applications have been constructed and refined within disciplinary communities and executed on leading-edge computer systems. We examine several of these, expose some commonalities among them, and attempt to extrapolate best practices to future systems. From our study, we summarize challenges and forecast opportunities.

99 GENERAL AND MISCELLANEOUS↗

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗

Deconflicting Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace

North Atlantic oceanic airspace accommodates more than 1000 flights daily, and is subjected to very strong winds. Flying wind-optimal trajectories yields time and fuel savings for each individual flight. However, when taken together, these trajectories induce a large amount of potential en-route conflicts. This paper analyses the detected conflicts, figuring out conflict distribution in time and space. It further describes an optimization algorithm aimed at reducing the number of conflicts for a daily set of flights on strategic level. Several trajectory modification strategies are discussed, followed with simulation results. Finally, an algorithm improvement is presented aiming at better preserving the trajectory optimality.

wind-optimal trajectories↗

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗

Strategic Time-Based Metering that Assures Separation for Integrated Operations in a Terminal Airspace

This paper reports an algorithm for strategic time-based metering of air traffic arriving and departing from a large ( tens of nautical miles) area (called here, the commitment region) around an airport or metroplex. The algorithm assures separation continuously in time and avoids a dictation of intent to an aircraft crew. This is accomplished by allowing an aircraft (specifically, its Flight Management System) to specify, and commit to, an intended route and ground speed profile along that route within the commitment region, and by supplying the time at which to enter the region to the aircraft crew. The airspace that comprises the commitment region need not be confined to the terminal airspace and can include some of the enroute space: the size and shape of the commitment region are parameters in the algorithm. An exact formula for including speed profile uncertainty in the algorithm is provided. The algorithm is applied to a number of data sets recorded during actual air traffic operations in the Southern California TRACON in July of 2014 and the Atlanta TRACON in November and December of 2013. The results of the numerical simulations indicate that the algorithm succeeds at keeping the aircraft separated, but introduces, in its current implementation, more separation than that observed in actual operations. This excess separation can be reduced by modeling more accurately the Visual Flight Rules separation practices, a direction for future research.

air traffic management↗

Search Problems in Mission Planning and Navigation of Autonomous Aircraft

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Krozel, James A.↗

Piloted simulation of a ground-based time-control concept for air traffic control

A concept for aiding air traffic controllers in efficiently spacing traffic and meeting scheduled arrival times at a metering fix was developed and tested in a real time simulation. The automation aid, referred to as the ground based 4-D descent advisor (DA), is based on accurate models of aircraft performance and weather conditions. The DA generates suggested clearances, including both top-of-descent-point and speed-profile data, for one or more aircraft in order to achieve specific time or distance separation objectives. The DA algorithm is used by the air traffic controller to resolve conflicts and issue advisories to arrival aircraft. A joint simulation was conducted using a piloted simulator and an advanced concept air traffic control simulation to study the acceptability and accuracy of the DA automation aid from both the pilot's and the air traffic controller's perspectives. The results of the piloted simulation are examined. In the piloted simulation, airline crews executed controller issued descent advisories along standard curved path arrival routes, and were able to achieve an arrival time precision of + or - 20 sec at the metering fix. An analysis of errors generated in turns resulted in further enhancements of the algorithm to improve the predictive accuracy. Evaluations by pilots indicate general support for the concept and provide specific recommendations for improvement.

Davis, Thomas J.↗

A Generalized Approach to Aircraft Trajectory Prediction via Supervised Deep Learning

As research advances diverse forms and missions of aircraft, the National Airspace System (NAS) will become increasingly crowded, limiting current communications resources to accommodate aviation operations. Ongoing research proposes a paradigm of airspace communications, such that resources are autonomously and dynamically allocated via intelligent agents; this allocation requires accurate representations of the NAS, including the predicted positions of aircraft. State-of-the-art research emphasizes the importance of a hybrid-recurrent framework for trajectory prediction and compares the impact of commonly considered weather data on prediction accuracy. However, current research has been limited in its scope of efforts, frequently utilizing a unique flight route, architecture, set of weather data, and date range. This article considers the challenges of generalizing hybrid-recurrent predictive models for flight trajectories. Results illustrate an increase in error variance when identical models are trained over a generalized set of flights; this may be mitigated with careful tuning of hyperparameters, both in the network structure and optimization algorithms. Even so, an irreducible vertical error was identified, resulting from the complex takeoff and landing procedures which can not be correlated to functions of weather or additional assumptions of aircraft behavior. Finally, the use of a test route indicates that generalized models still do not possess sufficient knowledge for general aircraft predictions, with mean error increases ranging from 70-500%. These results illustrate the need for continued efforts on improving model versatility, as well as potential limitations for spectrum allocation near airports and other centers.

Nathan Schimpf↗

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↗

Demand Capacity Balancing at Vertiports for Initial Strategic Conflict Management of Urban Air Mobility Operations

Urban Air Mobility (UAM) is a new transportation concept that enables highly automated, cooperative, passenger or cargo-carrying air transportation services in and around urban areas. To achieve the high level of operational density and complexity desired by the UAM community, an airspace system that allows UAM operators to readily access and operate safely and efficiently in the airspace is needed. This airspace system will require air traffic management designed to reduce the risk of conflicts and loss of separation between UAM flights. In general, strategic conflict management is considered as the first layer of conflict management for safe flight operations to condition the traffic to reduce the need for airborne separation provision, the second layer of conflict management. Demand Capacity Balancing (DCB) is one of the concept components to achieve strategic conflict management. DCB strategically evaluates traffic demand and resource capacities to allow UAM operators to determine when, where and how they operate, while mitigating conflicting needs for airspace and vertiport capacity. DCB can be applied whenever UAM demand exceeds the capacity in airspace or at vertiports. As the UAM ecosystem evolves with advanced technologies and matured operational procedures, more complicated conflict management will likely be needed. In the current UAM ‘Concept of Operation (ConOps) 1.0’ operational stage defined by FAA, however, it will be meaningful to explore the demand capacity balancing at vertiports only, as an initial strategic conflict management approach for UAM operations because vertiport capacity seems to be a bottleneck of UAM traffic. For this research, we developed a demand-capacity imbalance detection and resolution service for UAM. This DCB service identifies the demand from operators and compares the demand to a given capacity at the shared resources (i.e., vertiports) over the upcoming time horizon which is divided into time bins having a constant interval. When a new flight plan is submitted, the algorithm embedded in the DCB service checks the available time bins based on the desired departure time and estimated arrival time at origin and destination vertiports, respectively. If the time bins for the originally desired times are already occupied by other flights (i.e., demand is at or above capacity), the algorithm finds the next available time bins for takeoff and landing and shifts the conflicting departure time to the earliest time that satisfies the capacity constraints at both origin and destination vertiports. The details of the algorithm will be described in the final manuscript. Figure 1 shows that the proposed DCB algorithm works well for a sample traffic scenario. In this example, a total of 144 flights, split between two operators, are planned over 2 hours, traveling 10 routes between five vertiports. In the heatmaps, the horizontal axis shows 12 time bins where each bin represents a 12-minute interval, and the vertical axis shows five vertiports. The number in each cell shows the number of operations, counting both departures and arrivals, at a specific vertiport in each time bin. For the given capacity of 2 operations/vertiport/bin, Figure 1 shows that the original demand sometimes exceeds the capacity, but the modified demand is reduced to the given capacity after resolving demand-capacity imbalances. When UAM flights are operated, it is expected that many practical issues would arise in the federated system architecture with multiple operators. UAM operators may experience a time synchronization issue due to communication delay between operator and vehicle. UAM vehicles would fly at different flight speeds, depending on vehicle models. Actual departure and arrival times can have large variations, compared to the schedule. The lead time from flight plan submission to desired departure time can vary by service type (e.g., regular shuttle service vs. on-demand service). Using the proposed DCB algorithm, we also investigated how the actual flight schedule and DCB performance are affected by these uncertainties such as unsynchronized times between operators, flight speed differences, lead time differences, and departure time errors. The final manuscript will include the background of this research work, the description of the DCB algorithm and its use cases with traffic scenarios. It will also provide the analytical results about the impact of various uncertainties that can occur in actual UAM operations on the DCB at vertiports, in terms of demand distribution changes, number of simultaneous operations, and delay propagation.

Urban Air Mobility↗

Bandgap prediction by deep learning in configurationally hybridized graphene and boron nitride

Abstract It is well-known that the atomic-scale and nano-scale configuration of dopants can play a crucial role in determining the electronic properties of materials. However, predicting such effects is challenging due to the large range of atomic configurations that are possible. Here, we present a case study of how deep learning algorithms can enable bandgap prediction in hybridized boron–nitrogen graphene with arbitrary supercell configurations. A material descriptor that enables correlation of structure and bandgap was developed for convolutional neural networks. Bandgaps calculated by ab initio calculations, and corresponding structures, were used as training datasets. The trained networks were then used to predict bandgaps of systems with various configurations. For 4 × 4 and 5 × 5 supercells they accurately predict bandgaps, with a R 2 of >90% and root-mean-square error of ~0.1 eV. The transfer learning was performed by leveraging data generated from small supercells to improve the prediction accuracy for 6 × 6 supercells. This work will pave a route to future investigation of configurationally hybridized graphene and other 2D materials. Moreover, given the ubiquitous existence of configurations in materials, this work may stimulate interest in applying deep learning algorithms for the configurational design of materials across different length scales.

Dong, Yuan↗

A predictive machine learning approach for microstructure optimization and materials design

This paper addresses an important materials engineering question: How can one identify the complete space (or as much of it as possible) of microstructures that are theoretically predicted to yield the desired combination of properties demanded by a selected application? We present a problem involving design of magnetoelastic Fe-Ga alloy microstructure for enhanced elastic, plastic and magnetostrictive properties. While theoretical models for computing properties given the microstructure are known for this alloy, inversion of these relationships to obtain microstructures that lead to desired properties is challenging, primarily due to the high dimensionality of microstructure space, multi-objective design requirement and non-uniqueness of solutions. These challenges render traditional search-based optimization methods incompetent in terms of both searching efficiency and result optimality. In this paper, a route to address these challenges using a machine learning methodology is proposed. A systematic framework consisting of random data generation, feature selection and classification algorithms is developed. In conclusion, experiments with five design problems that involve identification of microstructures that satisfy both linear and nonlinear property constraints show that our framework outperforms traditional optimization methods with the average running time reduced by as much as 80% and with optimality that would not be achieved otherwise.

36 MATERIALS SCIENCE↗

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↗