Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT 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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Operator Interface and Control Software for the Reconfigurable Surface System Tri-ATHLETE

Graphical operator interface methods have been developed for modular, reconfigurable articulated surface systems in general, and a specific instantiation thereof for JPL's Tri-ATHLETE. The All- Terrain Hex-Limbed Extra-Terrestrial Explorer Robot (ATHLETE) has six limbs with six kinematic degrees of freedom each. The core advancement of this work was the development of a novel set of algorithms for dynamically maintaining a reduced coordinate model of any connected assembly of robot modules.

Norris, Jeffrey S.↗
NASA NTRS2018

Probabilistic Guidance of a Swarm Deployed from the Back Shell of the Mars Spacecraft

This paper presents a probabilistic guidance algorithm for a swarm of assets deployed from the back shell of the Mars spacecraft. Such a swarm could provide valuable science data, with large spatiotemporal variation, from the Martian surface. Our probabilistic swarm guidance algorithm maximizes the coverage area of the swarm while uniformly distributing the assets on the Martian surface and guaranteeing strong connectivity of the swarm’s communication network topology. Numerical simulations demonstrate the effectiveness and versatility of our probabilistic swarm guidance algorithm.

Hadaegh, Fred↗
NASA NTRS1988

A new algorithm for modeling friction in dynamic mechanical systems

A method of modeling friction forces that impede the motion of parts of dynamic mechanical systems is described. Conventional methods in which the friction effect is assumed a constant force, or torque, in a direction opposite to the relative motion, are applicable only to those cases where applied forces are large in comparison to the friction, and where there is little interest in system behavior close to the times of transitions through zero velocity. An algorithm is described that provides accurate determination of friction forces over a wide range of applied force and velocity conditions. The method avoids the simulation errors resulting from a finite integration interval used in connection with a conventional friction model, as is the case in many digital computer-based simulations. The algorithm incorporates a predictive calculation based on initial conditions of motion, externally applied forces, inertia, and integration step size. The predictive calculation in connection with an external integration process provides an accurate determination of both static and Coulomb friction forces and resulting motions in dynamic simulations. Accuracy of the results is improved over that obtained with conventional methods and a relatively large integration step size is permitted. A function block for incorporation in a specific simulation program is described. The general form of the algorithm facilitates implementation with various programming languages such as FORTRAN or C, as well as with other simulation programs.

Hill, R. E.↗
NASA NTRS1990

Hardware-assisted software clock synchronization for homogeneous distributed systems

A clock synchronization scheme that strikes a balance between hardware and software solutions is proposed. The proposed is a software algorithm that uses minimal additional hardware to achieve reasonably tight synchronization. Unlike other software solutions, the guaranteed worst-case skews can be made insensitive to the maximum variation of message transit delay in the system. The scheme is particularly suitable for large partially connected distributed systems with topologies that support simple point-to-point broadcast algorithms. Examples of such topologies include the hypercube and the mesh interconnection structures.

Ramanathan, P.↗
DOE OSTI2023

A Mobile Edge Computing Framework for Traffic Optimization At Urban Intersections Through Cyber-Physical Integration

The stop-and-go traffic pattern on urban roads often results in excessive energy consumption because of unnecessary vehicle braking, idling, and accelerations. With the widespread and increased use of automobiles, this traffic pattern creates many negative impacts (e.g., delayed travel time, air pollution, and additional carbon emission) on the sustainability of our cities. Taking advantage of the recent emerging Internet of Things (IoT) and edge computing paradigms, we propose a mobile edge computing framework that integrates the capability of real-time vehicle-to-infrastructure communication and intelligent speed optimization algorithms into a mobile app to optimize individual vehicles' driving speed at signalized intersections. The optimization aims to mitigate the stop-and-go traffic pattern and its undesirable consequences in urban transportation systems. The framework consists of (1) a cyberinfrastructure-enabled dynamic messaging system for retrieving and delivering real-time traffic and signal phase and timing information from IoT-connected signal controllers and sensors, (2) a real-time speed optimization algorithm for generating intelligent speed advisory using vehicle's information (e.g., GPS and driving directions from mobile sensing) and corresponding signal and traffic information, and (3) an ad-hoc mobile computing environment that converts drivers' smartphones into edge devices to host the speed optimization algorithms for enabling intelligent advisory on the vehicle's driving speed within signalized corridors. The paper presents the design and implementation of the proposed framework. Finally, we demonstrate the feasibility, usefulness, and energy-saving benefits of our proposed framework and its prototyping mobile app on urban transportation systems through traffic simulation, real-vehicle laboratory experiments, an evaluative survey, and field communication tests. The simulation-based energy evaluation results show that the 100% usage of the mobile app can achieve 24% energy savings in the transportation system.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2019

Low-Thrust Trajectory Design for a Cislunar CubeSat Leveraging Structures from the Bicircular Restricted Four-Body Problem

The upcoming Lunar IceCube (LIC) mission will deliver a 6U CubeSat to a low lunar orbit via a ride-share opportunity during NASAs Artemis 1 mission. This presents a challenging trajectory design scenario, as the vast change in energy required to transfer from the initial deployment state to the destination orbit is compounded by the limitations of the LICs low-thrust engine. This investigation addresses these challenges by developing a trajectory design framework that utilizes dynamical structures available in the Bicircular Restricted Four-Body Problem (BCR4BP) along with a robust direct collocation algorithm. Maps are created that expedite the selection of invariant manifold paths from a periodic staging orbit in the BCR4BP that offer favorable connections between the LIC transfer phases. Initial guesses assembled from these maps are passed to a direct collocation algorithm that corrects them in the BCR4BP while including the variable low-thrust acceleration of the spacecraft engine. Results indicate that the ordered motion provided by the BCR4BP and the robustness of direct collocation combine to offer an efficient and adaptable framework for designing a baseline trajectory for the LIC mission.

Pritchett, Robert↗
NASA NTRS2019

Low-Thrust Trajectory Design for A Cislunar CubeSat Leveraging Structures from the Bicircular Restricted Four-Body Problem

The upcoming Lunar IceCube (LIC) mission will deliver a 6U CubeSat to a low lunar orbit via a ride-share opportunity during NASAs Artemis 1 mission. This presents a challenging trajectory design scenario, as the vast change in energy required to transfer from the initial deployment state to the destination orbit is compounded by the limitations of the LICs low-thrust engine. This investigation addresses these challenges by developing a trajectory design framework that utilizes dynamical structures available in the Bicircular Restricted Four-Body Problem (BCR4BP) along with a robust direct collocation algorithm. Maps are created that expedite the selection of invariant manifold paths from a periodic staging orbit in the BCR4BP that offer favorable connections between the LIC transfer phases. Initial guesses assembled from these maps are passed to a direct collocation algorithm that corrects them in the BCR4BP while including the variable low-thrust acceleration of the spacecraft engine. Results indicate that the ordered motion provided by the BCR4BP and the robustness of direct collocation combine to offer an efficient and adaptable framework for designing a baseline trajectory for the LIC mission.

Pritchett, Robert↗
DOE OSTI2023

Evaluating Connected and Automated Vehicles in Co-Simulation Environment of Traffic Microsimulation and Vehicle Dynamics

Connected and automated vehicles (CAVs) have the potential to improve many aspects of the current transportation systems such as safety, mobility, and energy efficiency. In order to evaluate the benefits and impacts of a CAV, the CAV control algorithm is typically implemented on vehicles simulated in a traffic microsimulation environment. However, traffic microsimulation usually lacks detailed vehicle and powertrain dynamics, making it challenging to fully understand how a CAV control algorithm will perform and respond on an actual vehicle. Whether the same benefits measured in the simulation will also be observed in real-world remains an open question. One potential approach to fill in this gap is to conduct a co-simulation of traffic microsimulation with detailed vehicle and powertrain dynamics models, often developed in MATLAB Simulink. However, current microsimulation tools such as VISSIM and SUMO do not have a ready-to-use interface for co-simulation with vehicle dynamics and Simulink. Also, even if such an interface exists, it will be tool-specific, making it challenging to shift from one tool to another or test CAV controls in different tools. There are needs for tool-agnostic co-simulation as different microsimulation tools have their pros and cons, and researchers often need to use different tools based on the purposes of the simulation, project needs, and applications. In this work, Flexible Interface for X-in-the-loop Simulation (FIXS) is developed that can support the co-simulation of microsimulation, CAV control algorithm, and vehicle dynamics model in Simulink. Enabled by the FIXS, the benefit and performance of a CAV control algorithm can be better understood with the consideration of vehicle responses and dynamics. The connection to VISSIM and SUMO is handled internally by the interface, and users can easily switch tools by changing a configuration file. The co-simulation capability is demonstrated for a VISSIM eco-approach and departure CAV scenario and a SUMO cooperative merging scenario for both a passenger CAV and a class 8 heavy-duty connected and automated trucks.

Shao, Yunli↗
DOE OSTI2025

Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm

The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.

Lu, Chao [ORNL] (ORCID:0000000179346933)↗
NASA NTRS1975

A new image enhancement algorithm with applications to forestry stand mapping

The theory and applications are presented of a new image enhancement algorithm which refines computer classification maps of multispectral data. The refinement eliminates connected sets smaller than a prespecified size and merges them to the surrounding area. Conventional practices in forestry timber stand mapping requires small geographic areas to be absorbed by surrounding large areas to form homogeneous stands. This homogeneity is often incompatible with the statistical formulation of homogeneity. Elements within a timber stand which should be labeled as one feature often correspond to more than one class mapped by existing computer classification techniques. The new algorithm is designed to postprocess classification maps to result in more usable timber stand maps. The new image enhancement technique is compared with an accepted neighbor-checking postprocessing technique, demonstrating the superiority of the new technique for forestry stand mapping.

Kan, E. P.↗
DOE OSTI2024

Modular Quantum Processor with an All-to-All Reconfigurable Router

Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more flexible connectivity, which is particularly appealing in light of recent developments in error-correcting codes, however, usually involves complex multilayer packaging and external cabling, which is resource intensive and can impose fidelity limitations. Here, we propose and realize a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We implement the design in a four-node quantum processor, built with a modular design comprising a wiring substrate coupled to two separate qubit-bearing substrates, each including two single-qubit nodes. We use this device to demonstrate reconfigurable controlled-𝑍 gates across all qubit pairs, with a benchmarked average fidelity of 96.00% ± 0.08% and best fidelity of 97.14% ± 0.07%, limited mainly by dephasing in the qubits. We also generate multiqubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of 88.15% ± 0.24% and 75.18% ± 0.11%, respectively. This approach promises efficient scaling to larger-scale quantum circuits and offers a pathway for implementing quantum algorithms and error-correction schemes that benefit from enhanced qubit connectivity.

Quantum circuits↗
DOE OSTI2021

Investigating the Chinese postman problem on a quantum annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution

36 MATERIALS SCIENCE↗
DOE OSTI2023

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗
DOE OSTI2023

High-bandwidth image-based predictive laser stabilization via optimized Fourier filters

Controlling the delivery of kHz-class pulsed lasers is of interest in a variety of industrial and scientific applications, from next-generation laser-plasma acceleration to laser-based x-ray emission and high-precision manufacturing. The transverse position of the laser pulse train on the application target is often subject to fluctuations by external drivers (e.g., room cooling and heating systems, motorized optics stages and mounts, vacuum systems, chillers, and/or ground vibrations). For typical situations where the disturbance spectrum exhibits discrete peaks on top of a broad-bandwidth lower-frequency background, traditional PID (proportional-integral-derivative) controllers may struggle, since as a general rule PID controllers can be used to suppress vibrations up to only about 5%–10% of the sampling frequency. Here, a predictive feed-forward algorithm is presented that significantly enhances the stabilization bandwidth in such laser systems (up to the Nyquist limit at half the sampling frequency) by online identification and filtering of one or a few discrete frequencies using optimized Fourier filters. Furthermore, the system architecture demonstrated here uses off-the-shelf CMOS cameras and piezo-electric actuated mirrors connected to a standard PC to process the alignment images and implement the algorithm. To avoid high-end, high-cost components, a machine-learning-based model of the piezo mirror’s dynamics was integrated into the system, which enables high-precision positioning by compensating for hysteresis and other hardware-induced effects. A successful demonstration of the method was performed on a 1 kHz laser pulse train, where externally-induced vibrations of up to 400 Hz were attenuated by a factor of five, far exceeding what could be done with a standard PID scheme.

Natal, Joseph↗
DOE OSTI2021

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Homomorphic Encryption for Machine Learning and Artificial Intelligence Applications

Third-party and expert analysis is a cost-effective solution for solving specialized problems or processing large datasets related to reactor structural health monitoring and nondestructive evaluation. However, when handling proprietary information, third-party and expert analysts pose a privacy risk. To address this challenge, Homomorphic Encryption (HE) permits arithmetic operations on encrypted data without exposing the underlying data. Implementations of Machine Learning (ML) and Artificial Intelligence (AI) algorithms using HE greatly enhances the capabilities of third-party analysts while maintaining a low security risk. This paper details current success in applying Principal Component Analysis (PCA) and Fully Connected Neural Networks (NN) using the Microsoft SEAL implementation of the popular CKKS Fully Homomorphic Encryption (FHE) algorithm. The MNIST Handwritten Dataset is analyzed as a proof-of-concept demonstration of the implementations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Development of a nearly autonomous management and control system for advanced reactors

This presentation discusses the development of a Nearly Autonomous Management and Control (NAMAC) system for advanced reactors. This presentation first introduces the NAMAC-enabled plant control. Next, this presentation introduces major technologies of implementing NAMAC, including operational workflow, digital twin, and advanced machine learning algorithms. To demonstrate the capability of the NAMAC system, NAMAC is connected with a simulator of the Experimental Breeder Reactor II, where NAMAC is activated to provide recommendations during a single loss of flow accident.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Finding diverse ways to improve algebraic connectivity through multi-start optimization

The algebraic connectivity, also known as the Fiedler value, is a spectral measure of network connectivity that can be increased through edge addition. We present an algorithm for producing many diverse ways to add a fixed number of edges to a network to achieve a near optimal Fiedler value. Previous Fielder value optimization algorithms (i.e. the greedy algorithm) output only one solution. Obtaining a single solution is rarely good enough for real-world network redesign problems, as practical constraints (political, physical or financial) may prevent implementation. Our algorithm takes a multi-start optimization approach, adding a random initial edge and then applies a greedy heuristic to improve the Fiedler value. The random choice moves us to a new region of the search space, enabling discovery of diverse solutions. Additionally, we present a Determinantal Point Process framework for quantifying diversity. We then apply a Markov chain Monte Carlo technique to sift through the large number of output solutions and locate a smaller, more manageable collection of highly diverse solutions that can be presented to network redesign engineers. We demonstrate the effectiveness of our algorithm on real-world graphs with varied structures.

97 MATHEMATICS AND COMPUTING↗