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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

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↗

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↗

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↗

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↗

DOE OSTI2017

Energy-Efficient Cruise Control Using Optimal Control for a Hybrid Electric Vehicle

Increasing connectivity in passenger vehicles provides for a large amount of look-ahead information about driving conditions. An intelligent control algorithm is presented that takes advantage of this information to obtain the operation strategy for the powertrain of a parallel hybrid electric vehicle, in an uncongested highway cruising situation. In order to guarantee sufficient computational efficiency to meet future online requirements, the algorithm is based on Pontryagin’s Minimum Principle. The whole driving/operation strategy is composed of a series of solutions to the optimal control sub-problem for each separate route segment. The control sequence computed offline is then evaluated in Autonomie. The simulation result shows 6% fuel savings compared to a baseline rule-based controller with no speed optimization.

Shen, Daliang↗

DOE OSTI2023

Postdisaster Routing of Movable Energy Resources for Enhanced Distribution System Resilience: A Deep Reinforcement Learning-Based Approach

The deployment of movable energy resources (MERs) can be an effective strategy to restore critical loads to enhance power system resilience when no other energy sources are available after the occurrence of an extreme event. Since the optimal locations of MERs following an extreme event are dependent on system operating states (e.g., the loads at each node, on/off status of system branches, and so on), existing analytical and population-based approaches must repeat the entire analysis and calculation when the system operating states change. On the contrary, if deep reinforcement learning (DRL)-based algorithms are sufficiently trained with a wide range of scenarios, they can quickly find optimal or near-optimal locations irrespective of changes in system states. A deep Q-learning-based approach is proposed for optimal MER deployment to enhance power system resilience. MERs can be also utilized to complement other types of resources, if available. The proposed approach operates in two stages after the occurrence of extreme events. In the first stage, the distribution network is represented as a graph, and the network is then reconfigured using tie switches by using Kruskal’s spanning forest search algorithm (KSFSA). To maximize critical load recovery, the optimal or near-optimal locations of MERs are chosen in the second stage. Further, case studies on a 33-node distribution system and a modified IEEE 123-node system demonstrate the effectiveness of the proposed approach for postdisaster routing of MERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Ab Initio Structure Determination and Photoluminescent Properties of an Efficient, Thermally Stable Blue Phosphor, Ba 2 Y 5 B 5 O 17 :Ce 3+

Here, the crystal structure of a novel barium yttrium borate, Ba 2 Y 5 B 5 O 17 , was determined using a combination of ab initio global optimization algorithms and density functional theory calculations along with Rietveld refinement of high-resolution synchrotron X-ray powder diffraction data. Synthesized using a high-temperature solid-state route, the structure consists of edge- and corner-sharing Y- and Ba-centered polyhedra along with BO 3 trigonal planes. Ba and Y occupy four crystallographically independent sites with two fully occupied by Y and two having a statistical mixture of Y and Ba. Substituting Ce 3+ into the structure for Y 3+ yields blue photoluminescence ($λ_{\text{em}}$ = 443 nm) upon excitation with UV ($λ_{\text{em}}$ = 365 nm) light. The emission of this new compound is efficient with an external quantum yield of 70% and is stable as a function of temperature with a quenching temperature of ≈400 K.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Ride Pingo to Transit

In this project, we developed an on-demand microtransit first- and last-mile service. To integrate the service with fixed-route transit, we developed a feature called Transit Connect that prioritized riders’ on-time arrival at the transit station over other service requirements. We first prototyped service and related algorithms in a simulated environment, and then piloted the service in the city of Kent, Washington. Our algorithm incorporates request-specific hard drop-off deadlines to ensure timely arrivals for transit transfers. In the pilot, these constraints were obtained from GTFS Realtime data to accurately determine the schedule of the transit and the location of the stations. This approach introduced the ability to accept or decline new requests based on the timing of transit connections for these new requests and connection status of onboarding customers. The pilot (called “Ride Pingo to Transit”) deployed a fleet of three 14-person vans, ran from September 2021 to March 2023, and served a total of 21,329 trips. Transit Connect was offered for drop-offs at both Kent Station and the Kent Valley hub. In total, 2,844 such trips were completed. This dataset was collected from our pilot, which includes the following: - Requests: List of all trip requests, including those that were actually served and those not materialized. - Fleet: Daily vehicle service logs. - Service details: Daily vehicle stop logs (boarding and alighting). - Trip types: First mile, last mile, or point-to-point. ![pingo to transit](pingo-to-transit.jpg)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2023

Automated remote sensing tools to counter illicit maritime activity: vessel detection, bathymetry and topography from WorldView imagery

Illicit maritime activity, such as piracy and smuggling, is a global issue that often occurs in areas where interdiction authorities are sparse, ground-based monitoring technologies like radar lack range and coverage, and dark vessels abound. Our objective was to assess vessel congregation patterns, identify likely beaching areas based on terrain maps, and use them to narrow the search for potential smuggling transfer and overland routes in a specific region along the Puntland coast of Somalia. To accomplish this goal, we developed automated protocols applied to WorldView satellite imagery for (1) vessel detection and size classification, (2) shallow-water bathymetric characterization, and (3) coastal topography mapping. Utilizing a single sensor for vessel detection and topographic and bathymetric extraction at high spatial resolution and at a high re-visit rate provides a simplification to near-shore characterization for monitoring purposes. The extracted topography and bathymetry are then presented as a single, comprehensive perspective of a coastal region. The vessel-detection algorithm identified all vessels larger than approximately 15 metres in length (35 of 35), but misidentified six artefacts (i.e. false positives), resulting in an overall accuracy of 85%. The combined vessel and terrain maps facilitated the identification of a potential beaching and overland transportation route location.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2011

U31: Vehicle Stability and Dynamics: Electronic Stability Control

A team led by NTRCI is working to improve the roll and yaw stability of heavy duty combination trucks through developing stability algorithms, assembling demonstration hardware, and investigating robust wireless communication. Modern electronic stability control (ESC) products automatically slow a vehicle rounding a corner too quickly or apply individual brakes when necessary to improve the steering characteristics of a vehicle. Air brake systems in North America provide no electronic communication between a tractor and semitrailer, limiting the degree to which control systems can be optimized. Prior research has demonstrated stability improvements where dynamic measurements and control commands are communicated between units of a vehicle. Three related activities were undertaken: (1) Develop an algorithm for the optimum yaw and roll control of a combination vehicle. Vehicle state parameters needed to control the vehicle and the proper brake response were determined. An integrated stability control for the tractor and semitrailer requires communication between the two units. Dynamic models were used to assess the algorithm. (2) Implement the ESC algorithm in the laboratory. Hardware components suitable for the harsh environment for measurement, sensor-to-controller communication, and semitrailer-to-tractor communication and brake actuation were specified and assembled as a working system. The goal was to collect the needed vehicle state information, transmit the information to the ESC system, and then actuate the brakes in response to controller commands. (3) Develop a wireless network with the data rate and reliability necessary to communicate dynamic signals for a vehicle stability control system. Adaptive connectivity-aware, multi-hop routing was selected because it can perform in the harsh environment where packet collisions and fading often will exist. The protocol is to give high priority to urgent messages.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2011

Experimental demonstration of a quantum annealing algorithm for the traveling salesman problem in a nuclear-magnetic-resonance quantum simulator

The method of quantum annealing (QA) is a promising way for solving many optimization problems in both classical and quantum information theory. The main advantage of this approach, compared with the gate model, is the robustness of the operations against errors originated from both external controls and the environment. In this work, we succeed in demonstrating experimentally an application of the method of QA to a simplified version of the traveling salesman problem by simulating the corresponding Schroedinger evolution with a NMR quantum simulator. The experimental results unambiguously yielded the optimal traveling route, in good agreement with the theoretical prediction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Prime factorization using magnonic holographic devices

Determining the prime factors of a given number $N$ is a problem that requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by Shor for quantum computers. In this paper, we present experimental data that demonstrate prime factorization using spin-wave interference but without quantum entanglement. Prime factorization includes three major steps. First, a general-type computer calculates the sequence of numbers m k mod($N$), where $N$ is the number to be factorized, m is a randomly chosen positive integer, and k = 1, 2, 3, 4, 5, 6…. Next, the period of the calculated sequence $r$ is determined by exploiting spin-wave interference. Finally, the general-type computer determines the primes based on the obtained $r$. The experiment for period finding was conducted on a six-terminal Y 3 Fe 2 (FeO 4 ) 3 device. We chose number 15 for testing and determined its primes using a sequence of measurements. The obtained experimental data for a micrometer-sized prototype aimed to demonstrate the benefits of using spin-wave devices to solve complex computational problems. Scalability is one of the major strengths inherent in this type of wave-based device, which may provide a route to nanometer-sized logic circuits. We discuss the physical and technological limitations of this approach, which define the maximum size of N and the computational speed. Although this classical approach cannot compete with the quantum algorithm in terms of efficiency, magnonic holographic devices can potentially be used as complementary logic units aimed at speeding up prime factorization for classical computers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

On the Feasibility of Dynamic Power Steering

While high performance has always been the primary constraint behind large-scale system design, future systems will be built with increasing energy efficiency in mind. Mechanisms such as fine-grained power scaling and gating will provide tools to system-software and application developers to ensure the most efficient use of tightly constrained power budgets. Such approaches to-date have been focused on node level optimizations to impact overall system energy efficiency. In this work we introduce Dynamic Power Steering, in which power can be dynamically routed across a system to resources where it will be of most benefit and away from other resources to maintain a near-constant overall power budget. This, a higher level algorithmic approach to improving energy efficiency, considers the whole extent of a system being used by an application. It can be used for applications in which there is load imbalance that varies over its execution. Using two classes of applications, namely those that contain a wave front type processing, and a particle-in-cell, we quantify the benefit of Dynamic Power Steering for a variety of workload characteristics and derive some insight into the ways in which workload behavior affect Power Steering applicability.

Barker, Kevin J.↗

DOE OSTI2014

TH-C-18A-06: Combined CT Image Quality and Radiation Dose Monitoring Program Based On Patient Data to Assess Consistency of Clinical Imaging Across Scanner Models

Purpose: One of the principal challenges of clinical imaging is to achieve an ideal balance between image quality and radiation dose across multiple CT models. The number of scanners and protocols at large medical centers necessitates an automated quality assurance program to facilitate this objective. Therefore, the goal of this work was to implement an automated CT image quality and radiation dose monitoring program based on actual patient data and to use this program to assess consistency of protocols across CT scanner models. Methods: Patient CT scans are routed to a HIPPA compliant quality assurance server. CTDI, extracted using optical character recognition, and patient size, measured from the localizers, are used to calculate SSDE. A previously validated noise measurement algorithm determines the noise in uniform areas of the image across the scanned anatomy to generate a global noise level (GNL). Using this program, 2358 abdominopelvic scans acquired on three commercial CT scanners were analyzed. Median SSDE and GNL were compared across scanner models and trends in SSDE and GNL with patient size were used to determine the impact of differing automatic exposure control (AEC) algorithms. Results: There was a significant difference in both SSDE and GNL across scanner models (9–33% and 15–35% for SSDE and GNL, respectively). Adjusting all protocols to achieve the same image noise would reduce patient dose by 27–45% depending on scanner model. Additionally, differences in AEC methodologies across vendors resulted in disparate relationships of SSDE and GNL with patient size. Conclusion: The difference in noise across scanner models indicates that protocols are not optimally matched to achieve consistent image quality. Our results indicated substantial possibility for dose reduction while achieving more consistent image appearance. Finally, the difference in AEC methodologies suggests the need for size-specific CT protocols to minimize variability in image quality across CT vendors.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

High-Order/Low-Order methods for ocean modeling

We examine a High Order/Low Order (HOLO) approach for a z-level ocean model and show that the traditional semi-implicit and split-explicit methods, as well as a recent preconditioning strategy, can easily be cast in the framework of HOLO methods. The HOLO formulation admits an implicit-explicit method that is algorithmically scalable and second-order accurate, allowing timesteps much larger than the barotropic time scale. We demonstrate how HOLO approaches, in particular the implicit-explicit method, can provide a solid route for ocean simulation to heterogeneous computing and exascale environments.

16 TIDAL AND WAVE POWER↗

DOE OSTI2011

Optimizing entangling quantum gates for physical systems

Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations to derive an optimization algorithm that determines the best entangling two-qubit gate for a given physical setting. We demonstrate the power of this approach for trapped polar molecules and neutral atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗