SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

A parallel row-based algorithm with error control for standard-cell replacement on a hypercube multiprocessor

A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.

Sargent, Jeff Scott↗

DOE OSTI2026

FAD-Toolset (Floating Array Design Toolset) [SWR-26-056]

The Floating Array Design (FAD) Toolset is a collection of tools for modeling and designing arrays of floating offshore structures. It was originally designed for floating wind systems but has applicability for many offshore applications. A core part of the FAD Toolset is the floating array model, which serves as a high-level library for efficiently modeling a floating array, such as a floating wind array. It combines site condition information and a description of the floating array design, and contains functions for evaluating the array's behavior considering the site conditions. For example, it combines information about site soil conditions, mooring line loads, and an array's anchor characteristics to estimate the holding capacity of each anchor. The library works in conjunction with the tools RAFT, MoorPy, and FLORIS to model floating platforms, wind turbines, mooring systems, power cables, and array wakes respectively. Layered on top of the floating array model is a set of design tools that can be used for algorithmically adjusting or optimizing parts of the a floating array. Specific tools existing for mooring lines, shared mooring systems, dynamic power cables, static power cable routing, and overall array layout. These capabilities work with the design representation and evaluation functions in the floating array model, and they can be applied by users in various combinations to suit different purposes. In addition to standalone uses of the FAD Toolset, a coupling has been made with Ard, (https://github.com/NLRWindSystems/Ard) a sophisticated and flexible wind farm optimization tool. This coupling allows Ard to use certain mooring system capabilities from FAD to perform layout optimization of floating wind farms with Ard's more advanced layout optimization capabilities. The FAD Toolset works with the IEA Wind Task 49 Ontology (https://github.com/IEAWindTask49/Ontology), which provides a standardized format for describing floating wind farm sites and designs. See example use cases in our examples folder (https://github.com/NLRWindSystems/FAD-Toolset/blob/main/examples/README.md) For working with the library, it is important to understand the floating array model structure, which is described more here: https://github.com/NLRWindSystems/FAD-Toolset/blob/main/fad/README.md.

Sirkis, Leah [National Laboratory of the Rockies (↗

NASA NTRS2017

Flight Test Evaluation of the ATD-1 Interval Management Application

Interval Management (IM) is a concept designed to be used by air traffic controllers and flight crews to more efficiently and precisely manage inter-aircraft spacing. Both government and industry have been working together to develop the IM concept and standards for both ground automation and supporting avionics. NASA contracted with Boeing, Honeywell, and United Airlines to build and flight test an avionics prototype based on NASA's spacing algorithm and conduct a flight test. The flight test investigated four different types of IM operations over the course of nineteen days, and included en route, arrival, and final approach phases of flight. This paper examines the spacing accuracy achieved during the flight test and the rate of speed commands provided to the flight crew. Many of the time-based IM operations met or exceeded the operational design goals set out in the standards for the maintain operations and a subset of the achieve operations. Those operations which did not meet the goals were due to issues that are identified and will be further analyzed.

Swieringa, Kurt A.↗

NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗

NASA NTRS1998

An Operational Concept for Flying FMS Trajectories in Center and TRACON Airspace

Current Flight Management Systems (FMS) do a good job of constructing and flying an optimal trajectory for a single aircraft. Unfortunately, flight crews are often unable to fly these FMS routes during arrivals at busy airports. The Center TRACON Automation System (CTAS) has been designed to aid Center and TRACON (Terminal Radar Approach Control) controllers in assigning runways, sequencing and vectoring all classes of aircraft. CTAS bases its advisories on trajectory predictions for arriving aircraft using algorithms very similar to those in airborne FMS systems. This paper presents near and far term operational concepts for how a ground ATM (air traffic management) automation system like CTAS could work more effectively with the airborne automation in FMS equipped aircraft. The concepts for a more compatible air-ground system include: 1) a common route databases for both CTAS and FMS; 2) datalink to downlink information on aircraft weight, final approach speed and trajectory intent and to uplink wind information; 3) new FMS functions to allow flight crews to easily update their FMS trajectory to match the trajectory suggested by the ground automation with voice clearances, and 4) in the far term, datalink to downlink user preferred trajectories and to uplink trajectory clearances in the terminal area. The paper analyses some of the human factors issues that may result in allowing aircraft to fly FMS routes during enroute descent and in the terminal area. A series of linked human in the loop flight deck and air traffic control simulations and a field test with the NASA 757 are being conducted at NASA's Ames and Langley Research Centers to address these issues and to evaluate the operational feasibility of these approaches to more efficient flight and increased airport throughput.

Palmer, Everett↗

NASA NTRS2019

Airborne Spacing for Terminal Arrival Routes (ASTAR) Proof-of-Concept Flight Test

The Airborne Spacing for Terminal Arrival Routes (ASTAR) Flight Test was conducted by the NASA Air Traffic Management Technology Demonstration – 1 (ATD- 1) project to demonstrate the use of NASA’s ASTAR algorithm beyond a simulated environment and assess the operational risks of performing a multi-aircraft flight test of Flight-deck Interval Management (FIM). Utilizing contemporary tools of the Federal Aviation Administration’s Next Generation Air Transportation System (NextGen) such as ADS-B, the ASTAR algorithm calculated speeds that the flight crew flew to achieve a precise spacing interval behind another aircraft at the final approach fix. Airspeed commands issued by the algorithm were flown by the flight crew of the FIM-equipped aircraft to achieve or maintain an assigned spacing goal from a target vehicle. The ASTAR algorithm was integrated with the Boeing supplied B-787 ecoDemonstrator aircraft, and five flight trials were conducted as a joint effort between NASA and Boeing on December 12, 2014. Initial results indicated arrival times within several seconds of accuracy of the planned termination point between two aircraft performing FIM in a real world environment. This flight test opened the way for the much more expansive ATD-1 Avionics Phase II flight test which occurred in early 2017. The flight trials under Phase II preceded further testing by the community in preparation for inclusion of the Interval Management concept as a part of the NextGen environment.

Roper, Roy D.↗

DOE OSTI2015

SU-E-I-11: A New Cone-Beam CT System for Bedside Head Imaging

Purpose: To design and develop a new mobile cone-beam CT (CBCT) system for head imaging with good soft-tissue visibility, to be used bedside in ICU and neurosurgery department to monitor treatment and operation outcome in brain patients. Methods: The imaging chain consists of a 30cmx25cm amorphous silicon flat panel detector and a pulsed, stationary anode monoblock x-ray source of 100kVp at a maximal tube current of 10mA. The detector and source are supported on motorized mechanisms to provide detector lateral shift and source angular tilt, enabling a centered digital radiographic imaging mode and half-fan CBCT, while maximizing the use of the x-ray field and keep the source to detector distance short. A focused linear anti-scatter grid is mounted on the detector, and commercial software with scatter and other corrective algorithms is used for data processing and image reconstruction. The gantry rotates around a horizontal axis, and is able to adjust its height for different patient table positions. Cables are routed through a custom protective sleeve over a large bore with an in-plane twister band, facilitating single 360-degree rotation without a slip-ring at a speed up to 5 seconds per rotation. A UPS provides about 10 minutes of operation off the battery when unplugged. The gantry is on locked casters, whose brake is control by two push handles on both sides for easy reposition. The entire system is designed to have a light weight and a compact size for excellent maneuverability. Results: System design is complete and main imaging components are tested. Initial results will be presented and discussed later in the presentation. Conclusion: A new mobile CBCT system for head imaging is being developed. With its compact size, a large bore, and quality design, it is expected to be a useful imaging tool for bedside uses. The work is supported by a grant from Chinese Academy of Sciences.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2011

Preliminary physiologically based pharmacokinetic models for benzo[a]pyrene and dibenzo[def,p]chrysene in rodents

Polycyclic aromatic hydrocarbons (PAHs) are ubiquitous environmental contaminants generated as byproducts of natural and anthropogenic combustion processes. Despite significant public health concern, physiologically based pharmacokinetic (PBPK) modeling efforts for PAHs have so far been limited to naphthalene, plus simpler PK models for pyrene, nitropyrene, and benzo[a]pyrene (B[a]P). The dearth of published models is due in part to the high lipophilicity, low volatility, and myriad metabolic pathways for PAHs, all of which present analytical and experimental challenges. Our research efforts have focused upon experimental approaches and initial development of PBPK models for the prototypic PAH, B[a]P, and the more potent, albeit less studied transplacental carcinogen, dibenzo[def,p]chrysene (DBC). For both compounds, model compartments included arterial and venous blood, flow limited lung, liver, richly perfused and poorly perfused tissues, diffusion limited fat, and a two compartment theoretical gut (for oral exposures). Hepatic and pulmonary metabolism was described for both compounds, as were fractional binding in blood and fecal clearance. Partition coefficients for parent PAH along with their diol and tetraol metabolites were estimated using published algorithms and verified experimentally for the hydroxylated metabolites. The preliminary PBPK models were able to describe many, but not all, of the available data sets, comprising multiple routes of exposure (oral, intravenous) and nominal doses spanning several orders of magnitude. Supported by Award Number P42 ES016465 from the National Institute of Environmental Health Sciences. -- Highlights: Black-Right-Pointing-Pointer We present PBPK models for benzo[a]pyrene (B[a]P) and dibenzo[def,p]chrysene (DBC). Black-Right-Pointing-Pointer B[a]P model accurately predicts data from multiple sources over a wide dose range. Black-Right-Pointing-Pointer DBC model was based on the B[a]P model as less chemical specific data is available. Black-Right-Pointing-Pointer DBC model accurately predicted preliminary pharmacokinetic data. Black-Right-Pointing-Pointer DBC model underscored data gaps on metabolism, binding and pharmacokinetics.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2017

Route Sanitizer: Connected Vehicle Trajectory De-Identification Tool

Route Sanitizer is ORNL's connected vehicle moving object database de-identification tool and a graphical user interface to ORNL's connected vehicle de-identification algorithm. It uses the Google Chrome (soon to be Electron) platform so it will run on different computing platforms. The basic de-identification strategy is record redaction: portions of a vehicle trajectory (e.g. sequences of precise temporal spatial records) are removed. It does not alter retained records. The algorithm uses custom techniques to find areas within trajectories that may be considered private, then it suppresses those in addition to enough of the trajectory surrounding those locations to protect against "inference attacks" in a mathematically sound way. Map data is integrated into the process to make this possible.

Carter, JasonM↗

NASA NTRS2001

Satellite Ocean Color Validation Using Merchant Ships

A collaborative measurement program for evaluating satellite-derived ocean color has been developed based on ships of opportunity (merchant, oceanographic) and specific instrumentation, the SIMBAD radiometer. The purpose of the measurement program is to complement, in a cost-effective way, dedicated evaluation experiments at sea, which are expensive, cannot be carried out over the full range of expected oceanic and atmospheric conditions, and generally provide a few match-ups. Ships participate in the program on a volunteer basis or at a very small cost, and measurement procedures do not interfere with other ship activities. The SIMBAD radiometer is a portable, easy-to-operate instrument that measures the basic ocean color variables, namely aerosol optical thickness and water-leaving radiance, in typical spectral bands of ocean-color sensors, i.e., 443, 490, 560, 670, and 870 nm. Measuring these variables at the time of satellite overpass is usually sufficient to verify satellite-derived ocean color and to evaluate atmospheric correction algorithms. Any ordinary crew can learn quickly how to make measurements. Importantly, the ship is not required to stop, making it possible to collect data along regular routes traveled by merchant ships in the world's oceans.

Frouin, Robert↗

DOE OSTI2017

Route Sanitizer: Connected Vehicle Trajectory De-Identification Tool

Carter, Jason M↗

DOE OSTI2023

Benchmarking quantum logic operations relative to thresholds for fault tolerance

Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1981

An innovative air data system for the Space Shuttle Orbiter - Data analysis techniques

The Shuttle Entry Air Data System (SEADS) is an experimental system designed to supply research quality air data and to meet Orbiter operational air data requirements throughout entry. SEADS incorporates no mechanical devices but is based on the concept that the fuselage proper, whether symmetrical or not, can be instrumented so as to function both as a pitot-static probe and as a differential pressure flow direction sensor. Specifically SEADS consists of 20 flush orifices, each routed to a pair of absolute pressure transducers. A computational technique has been developed capable of extracting air data parameters solely from surface pressure measurements. The digital filtering algorithm implemented in SEADS is the natural adaptation to air data sensing of a technology widely used in navigation, guidance, and control systems.

Pruett, C. D.↗

DOE OSTI2018

Highway Eco-Driving of an Electric Vehicle Based on Minimum Principle

The digital map in the on-board navigation system on passenger vehicles nowadays gives controllers access to detailed information of a planned route. Connected automated vehicles equipped with high computing power, are able to process data and leverage high control freedom available through automation. This paper proposes a fast optimization algorithm for eco-driving of electric vehicles in highway cruising scenarios. The algorithm is based on optimal control theory and takes into account road grades as well as state constraints imposed by speed limits and safe headway to the preceding car. Using Autonomie, the proposed algorithm is evaluated by simulating two example scenarios. The first result demonstrates an energy saving potential of 4.4%.

connected automated vehicle↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

GNSS↗

DOE OSTI2022

Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong

We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.

42 ENGINEERING↗