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.

SourceResearch connectionFrom yearThrough year

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

At least 613 records · Page 34

All sources NASA NTRS DOE OSTI

NASA NTRS2018

Silhouette-Informed Trajectory Generation Through a Wire Maze for Small UAS

Current rapidly-exploring random tree (RRT) algorithms rely on proximity query packages that often include collision checkers, tolerance verification, and distance computation algorithms for the generation of safe paths. In this paper, we broaden the information available to the path-planning algorithm by incorporating silhouette information of nearby obstacles in conflict. A silhouette-informed tree (SIT) is generated through the flight-safe region of a wire maze for a single unmanned aerial system (UAS). The silhouette is used to extract local geometric information of nearby obstacles and provide path alternatives around these obstacles. Thus, focusing the search for the generation of new tree branches near these obstacles, and decreasing the number of samples required to explore the narrow corridors within the wire maze. The SIT is then processed to extract a path that connects the initial location of the UAS with the goal, reduce the number of line segments in this path if possible, and smooth the resulting path using Pythagorean Hodograph Bezier curves. To ensure that the smoothed path remains in the flight-safe region of the configuration space, a tolerance verification algorithm for Bezier curves and convex polytopes in three dimensions is proposed. Lastly, temporal specifications are imposed on the smoothed path in the shape of an arbitrary speed profile.

Puig-Navarro, Javier↗

DOE OSTI2020

Wave function analysis with a maximum flow algorithm

An efficient algorithm for computing the maximum-flow path in a network is applied to the identification of the dominant configuration state functions (CSFs) in a graphically contracted function (GCF), configuration interaction, wave function. The flow network is a space of spin-adapted CSFs represented by a Shavitt graph, wherein the nodes correspond to orbital occupations and spin quantum numbers. The graph nodes are connected by arcs, and an arc density is defined as sums of the associated squared CSF coefficients. A max-min approach determines an upper bound to the maximum possible incoming flow for each graph node. A backtracking step generates a candidate walk and is followed by a limited search of alternative branching paths for the dominant CSF. The arc density contributions are removed from the graph, and the algorithm is reapplied to the updated graph. This list of generated walks can be partitioned in order to guarantee that the dominant CSFs have been identified. All of the steps in this algorithm are computationally efficient and do not depend on the potentially large dimension of the underlying linear CSF expansion space. An analysis of low-lying valence states of C-2 illustrates the method.

74 ATOMIC AND MOLECULAR PHYSICS↗

NASA NTRS2010

Simulation of Propellant Loading System Senior Design Implement in Computer Algorithm

Propellant loading from the Storage Tank to the External Tank is one of the very important and time consuming pre-launch ground operations for the launch vehicle. The propellant loading system is a complex integrated system involving many physical components such as the storage tank filled with cryogenic fluid at a very low temperature, the long pipe line connecting the storage tank with the external tank, the external tank along with the flare stack, and vent systems for releasing the excess fuel. Some of the very important parameters useful for design purpose are the prediction of pre-chill time, loading time, amount of fuel lost, the maximum pressure rise etc. The physics involved for mathematical modeling is quite complex due to the fact the process is unsteady, there is phase change as some of the fuel changes from liquid to gas state, then conjugate heat transfer in the pipe walls as well as between solid-to-fluid region. The simulation is very tedious and time consuming too. So overall, this is a complex system and the objective of the work is student's involvement and work in the parametric study and optimization of numerical modeling towards the design of such system. The students have to first become familiar and understand the physical process, the related mathematics and the numerical algorithm. The work involves exploring (i) improved algorithm to make the transient simulation computationally effective (reduced CPU time) and (ii) Parametric study to evaluate design parameters by changing the operational conditions

Bandyopadhyay, Alak↗

DOE OSTI2021

High-Fidelity Models and Fast EMT Simulation Algorithms for Isolated Multi-port Autonomous Reconfigurable Solar power plant (MARS)

The integration of hybrid photovoltaic (PV) and energy storage system (ESS) based plants has become a promising way of solving the intermittency of PV plants and providing frequency support to the power grid. The multi-port autonomous reconfigurable solar power plant (MARS) can integrate the PV systems and ESSs to an ac grid and dc lines. The proposed isolated MARS incorporates an isolated converter that connects to the PV arrays and is based on the dual active bridge (DAB) converter. The high frequency switching in the DAB and the means to control the DAB converter using delays between switching signals lead to the need for a small timestep in simulations. Moreover, several hundreds of modules that include a DAB converter are present in the MARS. The small timestep and the presence of several hundreds of modules lead to a significant rise in the overall simulation time. To address this issue, simulation algorithms like numerical stiffness-based hybrid discretization and the hysteresis relaxation technique are applied to the switched system model of isolated MARS. Additionally, an event-driven interpolating method is introduced to help increase the minimum timestep to simulate the conventional DAB converter model while maintaining high accuracy in the simulation results. The developed model is validated by comparison with its reference model built in the PSCAD/EMTDC and MATLAB software environments using library components.

Xia, Qian↗

DOE OSTI2023

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Incentivizing Cooperative Merging Control: Insights from Multi-Agent Deep Reinforcement Learning

Cooperative driving automation enables connected and automated vehicles (CAVs) to devise cooperative merging control, introducing great potentials to alleviate traffic congestion, reduce energy consumption, and enhance safety for highway on-ramp operations. Although numerous CAV cooperative merging algorithms have been developed to improve energy and traffic performance, the agreement-seeking among CAV users and their local benefits have been understudied. This can lead to rejections of cooperative merging plans and jeopardizing CAV performance, as a cooperation may entail certain CAVs to sacrifice their local benefits to achieve a system optimum. To address this issue, the study first leverages multi-agent deep reinforcement learning (MADRL) factoring both local reward and regional reward to demonstrate the discrepancies between CAV users’ local benefits and system optimum. Next, the existence of a correlated equilibrium is proved to characterize the convergence of MADRL training. This further facilitates the incorporation of incentives (computed based on reward discrepancies) to compensate for CAV users’ local benefits and facilitate system-optimal agreements in cooperative merging operations.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗

DOE OSTI2024

Leveraging Existing Assets for Long Duration Energy Storage

Increased renewables penetration to electrical grid is necessary to reduce overall emissions from the electrical power generation sector. Nonetheless, its integration creates challenges to grid operators who must match the power being generated by intermittent renewables and other traditional energy sources with the demand from consumers, while ensuring the reliability and power quality for the entire system. Energy storage has been proposed as an alternative to natural gas peaking plants and a form to deliver excess renewable energy generation at times of peak demand. For energy storage to provide benefits to end customers (energy consumers), it must be reliable, efficient, and cost effective. The Illinois Sustainable Technology Center (ISTC), one of the surveys that integrate the Prairie Research Institute (PRI), aims to develop a Center for Energy Storage at Existing Assets (CESEA) at UIUC with the participation of Waste Pressure Corp and Ecotek Engineering USA LLC. CESEA will focus on LDES systems that can integrate to existing infrastructure in a manner that reduces the initial capital expenditure and demonstrates the ability to repurpose fossil assets that would otherwise become stranded, to serve the energy transition. CESEA aims to leverage UIUC’s unique facilities to validate LDES systems performance at a relevant operating environment. UIUC’s facilities include a 85-MW combined heat and power (CHP) power plant, two (2) solar PV plants totaling over 18 MWdc of installed capacity, an electrical grid along with a substation at transmission and distribution voltages, a 22-mile gas pipeline network operating at two pressure levels, along with steam and chilled water distribution networks. The new LDES systems will connect to the existing UIUC grid through a new test electrical station, which will have the capacity to accommodate additional connections to test new devices and technologies as part of future CESEA R&D activities. The test electrical station will contain meters, instrumentation, and controls to accurately capture data and allow optimization of control algorithms. CESEA will initially focus on technologies that: i) utilize existing equipment or facilities to perform at least one of the process steps in LDES (charging, storage, or discharging), ii) leverage mature or commercially available components or controls, iii) show potential for cost-leadership in 10+ hour storage at a commercial scale. Initial technologies that were identified to meet these criteria include Compressed Gas Energy Storage (CGES), and TES. CGES stores electricity by raising the pressure of a compressible gas inside a control volume and converting the stored energy to electricity via expansion-generation. CGES is a generalization of CAES that covers any working gas (not just air). A successful CGES demo will help to circumvent many challenges faced by CAES (long development times due to site prospecting, high cost of compression and storage, heat recovery management, etc.) by: 1) utilizing existing infrastructure (compressors, pipelines, underground storage or pressure vessels) used in the transportation and storage of industrial gases for LDES charging and storage; 2) deploying over sites already-developed for industrial applications with minor additional work; 3) leveraging the price structure of commercial industrial gas to cover the costs of electricity used during charging. A previous DOE-sponsored conceptual study (DE-FE-0032018) estimated the levelized cost of energy of a 1.1 MW / 17 MWh CGES system at $0.08/kWh, with a commercial 10x scale system cost estimated at <$0.04/kWh (Giardinella, 2022). The pilot-sized system was estimated to avoid up to 2693 tons of CO2/year.

25 ENERGY STORAGE↗

NASA NTRS1986

Estimation of coefficients and boundary parameters in hyperbolic systems

Semi-discrete Galerkin approximation schemes in connection with inverse problems for the estimation of spatially varying coefficients and boundary condition parameters in second order hyperbolic systems typical of those arising in 1-D surface seismic problems are considered. Spline based algorithms are proposed for which theoretical convergence results along with a representative sample of numerical findings are given.

Banks, H. T.↗

NASA NTRS1993

Sensor tip for a robotic gripper and method of manufacture

A sensor tip (10) for use in a robotic hand has a three-dimensional compliant elastomeric body (12) with an outer boundary (22) having a circular base (24) and a convex surface (26) extending therefrom. Four strain transducers (14, 16, 18, and 20) produce electrical signals indicative of the strain at various positions near the boundary of the elastomeric body (12) resulting from forces exerted upon the sensor tip (10) by an object which the robotic hand is manipulating. The transducers (14, 16, 18, and 20) are positioned about the convex surface (26) so as to produce signals that may be decoupled to determine the normal and tangential forces and the applied torque. A buffer amplifier circuit (34), one for each of the transducers (14, 16, 18, and 20), receives the signals and provides quasi-steady state force information. The circuit (34) connects the respective transducer (40) in a feedback loop around an amplifier (36) and has desirable attributes for static charge buffering. The sensor tip (10) is calibrated to determine proportionality constants for the decoupling algorithm for use of a force delivering system (60), which uses voice coils (74) to apply a force that is linearly related to the current introduced to each of the coils (74). A method of manufacture of the sensor tip (10) results in improved bonding between the transducers (14, 16, 18, and 20) and the elastomeric body (12) for better performance and longer life of the sensor tip (10).

Lorenz, Robert D.↗

NASA NTRS1991

Sensor tip for a robotic gripper and method of manufacture

Lorenz, Robert D.↗

NASA NTRS1997

Sequence information signal processor for local and global string comparisons

A sequence information signal processing integrated circuit chip designed to perform high speed calculation of a dynamic programming algorithm based upon the algorithm defined by Waterman and Smith. The signal processing chip of the present invention is designed to be a building block of a linear systolic array, the performance of which can be increased by connecting additional sequence information signal processing chips to the array. The chip provides a high speed, low cost linear array processor that can locate highly similar global sequences or segments thereof such as contiguous subsequences from two different DNA or protein sequences. The chip is implemented in a preferred embodiment using CMOS VLSI technology to provide the equivalent of about 400,000 transistors or 100,000 gates. Each chip provides 16 processing elements, and is designed to provide 16 bit, two's compliment operation for maximum score precision of between -32,768 and +32,767. It is designed to provide a comparison between sequences as long as 4,194,304 elements without external software and between sequences of unlimited numbers of elements with the aid of external software. Each sequence can be assigned different deletion and insertion weight functions. Each processor is provided with a similarity measure device which is independently variable. Thus, each processor can contribute to maximum value score calculation using a different similarity measure.

Peterson, John C.↗

NASA NTRS2014

SPHERES Facility

Synchronized Position Hold, Engage, Reorient, Experimental Satellites (SPHERES) are bowling-ball sized satellites that provide a test bed for development and research into multi-body formation flying, multi-spacecraft control algorithms, and free-flying physical and material science investigations. Up to three self-contained free-flying satellites can fly within the cabin of the International Space Station (ISS), performing flight formations, testing of control algorithms or as a platform for investigations requiring this unique free-flying test environment. Each satellite is a self-contained unit with power, propulsion, computers, navigation equipment, and provides physical and electrical connections (via standardized expansion ports) for Principal Investigator (PI) provided hardware and sensors.

Material science investigations↗

DOE OSTI2020

Adaptive Neuro Fuzzy Inference System for Cyber-Intrusion Detection in a Smart Grid

The evolution of the power grid has brought increasing deployment of advance metering infrastructure, penetration of intelligent electronic devices, and integration of physical power system components with information and communications technologies. With the fast-expanding connectivity, cyber vulnerabilities arise due to the use of internet-based communication systems. These systems are targets of cyber-intrusions which attempt to disturb the normal power system functions. Traditional intrusion detection algorithms have been developed without an explicit model of the cyber components. In this paper, an algorithm to detect false data injections in the power system is proposed considering both cyber and physical models of the power system. The algorithm is based on an Adaptive Neuro Fuzzy Inference System (ANFIS) which collects information from state variables of the cyber-physical system to meet the performance requirements of the grid. Simulations of the proposed approach using the IEEE 13-bus test system validate the effectiveness of this artificial intelligence-based algorithm.

Adaptive Neuro Fuzzy Inference System (ANFIS), cyb↗

DOE OSTI2025

An adaptive and stability-promoting layerwise training approach for sparse deep neural network architecture

This work presents a two-stage adaptive framework for progressively developing deep neural network (DNN) architectures that generalize well for a given training data set. In the first stage, a layerwise training approach is adopted where a new layer is added each time and trained independently by freezing parameters in the previous layers. We impose desirable structures on the DNN by employing manifold regularization, sparsity regularization, and physics-informed terms. We introduce a ε – δ – stability-promoting concept as a desirable property for a learning algorithm and show that employing manifold regularization yields a ε – δ stability-promoting algorithm. Further, we also derive the necessary conditions for the trainability of a newly added layer and investigate the training saturation problem. In the second stage of the algorithm (post-processing), a sequence of shallow networks is employed to extract information from the residual produced in the first stage, thereby improving the prediction accuracy. Numerical investigations on prototype regression and classification problems demonstrate that the proposed approach can outperform fully connected DNNs of the same size. Moreover, by equipping the physics-informed neural network (PINN) with the proposed adaptive architecture strategy to solve partial differential equations, we numerically show that adaptive PINNs not only are superior to standard PINNs but also produce interpretable hidden layers with provable stability. As a result, we also apply our architecture design strategy to solve inverse problems governed by elliptic partial differential equations.

42 ENGINEERING↗

NASA NTRS1984

A connection between state-space and doubly coprime fractional representations

Explicit formulas for a doubly coprime fractional representation of the transfer function of a lumped LTI system are given in terms of a stabilizable and detectable state-space realization of the transfer function. These formulas allow existing computational algorithms to be utilized for the purpose of computing doubly coprime factorizations. Several additional implications of this result are briefly discussed, as are some immediate extensions and future research directions.

Nett, C. N.↗

NASA NTRS1993

Irrelevance Reasoning in Knowledge Based Systems

This dissertation considers the problem of reasoning about irrelevance of knowledge in a principled and efficient manner. Specifically, it is concerned with two key problems: (1) developing algorithms for automatically deciding what parts of a knowledge base are irrelevant to a query and (2) the utility of relevance reasoning. The dissertation describes a novel tool, the query-tree, for reasoning about irrelevance. Based on the query-tree, we develop several algorithms for deciding what formulas are irrelevant to a query. Our general framework sheds new light on the problem of detecting independence of queries from updates. We present new results that significantly extend previous work in this area. The framework also provides a setting in which to investigate the connection between the notion of irrelevance and the creation of abstractions. We propose a new approach to research on reasoning with abstractions, in which we investigate the properties of an abstraction by considering the irrelevance claims on which it is based. We demonstrate the potential of the approach for the cases of abstraction of predicates and projection of predicate arguments. Finally, we describe an application of relevance reasoning to the domain of modeling physical devices.

INFERENCE↗

DOE OSTI2021

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

AlphaBuilding ResCommunity: A multi-agent virtual testbed for community-level load coordination

Training and validating algorithms in a simulation testbed can accelerate research and applications of optimal control of residential loads to improve energy flexibility and grid resilience. We developed an open-source simulation environment, AlphaBuilding ResCommunity, that can be used to train and validate algorithms to control a single thermostatically controlled load (TCL) or coordinate a group of TCLs. We used reduced-order models to simulate the thermodynamics of TCLs, and the parameter values were determined from the connected smart thermostat data of real households. The environment was built upon the standardized OpenAI Gym interface. Ancillary functions, such as retrieving the parameters and weather forecasts, are provided to facilitate control strategies that require predictive information. Compared with existing efforts, AlphaBuilding ResCommunity has three advantages: (1) more realistic model settings because the parameter values are identified from actual household operating data, and modelling and measurement uncertainty are considered; (2) passive thermal storage control; and (3) ease of use due to a simple software dependency and standardized interface. We demonstrated the applications of the environment by implementing a Kalman Filter and Model Predictive Control on a single TCL and a Priority-Stack-Based Control and Alternating Direction Method of Multipliers to coordinate multiple TCLs for load tracking.

Wang, Z↗