Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive 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 415 records · Page 23

Coordinated Turn Trajectory Generation and Tracking Control for Multi-Rotors Operating in Urban Environment

The paper presents an efficient trajectory generation and tracking approach for multi-rotor air vehicles operating in urban environment, which takes into account uncertainties in the urban wind field and in the vehicle's parameters. Generated trajectories are sufficiently smooth, based on the differential flatness of the vehicle's dynamics and optimal in the sense of minimum agility and time. They pass through given set of way points, guarantee flight without a side-slip, and satisfy vehicle's dynamics and actuators constraints. In addition, an algorithm is presented to compute the required power to traverse the generated trajectory. Presented algorithms are implementable in real time using on-board computers. They do not take into account the vehicle's existing flight controller, hence there is no guarantee that the controller will be able to provide acceptable tracking of the generated trajectory, especially in the presence of atmospheric disturbances. To this end, we propose an adaptive augmentation algorithm to improve vehicle's performance by taking into account the effects of disturbances and on-line estimates of vehicle's existing flight controller's gains. The algorithms have been verified by simulations using DJI S1000 octocopter's model.

Stepanyan, Vahram↗

Dynamic Modeling of a Kaplan Hydroturbine Using Optimal Parametric Tuning and Real Plant Operational Data

To address grid variability caused by renewable energy integration and to maintain grid reliability and resilience, hydropower must quickly adjust its power generation over short time periods. This changing energy generation landscape requires advance technology integration and adaptive parameter optimization for hydropower systems via digital twin effort. However, this is difficult owing to the lack of characterization and modeling for the nonlinear nature of hydroturbines. To solve this issue, this paper first formulates a six-coefficient Kaplan hydroturbine model and then proposes a parametric optimization tuning framework based on the Nelder–Mead algorithm for adaptive dynamic learning of the six-coefficients so as to build models that describe the turbine. To assess the performance of the proposed optimal parametric tuning technique, operational data from a real-world Kaplan hydroturbine unit are collected and used to model the relationship between the gate opening and the generated power production. The findings show that the proposed technique can effectively and adaptively learn the unknown dynamics of the Kaplan hydroturbine while optimally tune the unknown coefficients to match the generated power output from the real hydroturbine unit with an inaccuracy of less than 5%. The method can be used to provides optimal tuning of parameters critical for controller design, operational optimization and daily maintenance for hydroturbines in general.

13 HYDRO ENERGY↗

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗

Hail Size Distribution Mapping

A 3-D weather radar visualization software program was developed and implemented as part of an experimental Launch Pad 39 Hail Monitor System. 3DRadPlot, a radar plotting program, is one of several software modules that form building blocks of the hail data processing and analysis system (the complete software processing system under development). The spatial and temporal mapping algorithms were originally developed through research at the University of Central Florida, funded by NASA s Tropical Rainfall Measurement Mission (TRMM), where the goal was to merge National Weather Service (NWS) Next-Generation Weather Radar (NEXRAD) volume reflectivity data with drop size distribution data acquired from a cluster of raindrop disdrometers. In this current work, we adapted these algorithms to process data from a cluster of hail disdrometers positioned around Launch Pads 39A or 39B, along with the corresponding NWS radar data. Radar data from all NWS NEXRAD sites is archived at the National Climatic Data Center (NCDC). That data can be readily accessed at . 3DRadPlot plots Level III reflectivity data at four scan elevations (this software is available at Open Channel Software, ). By using spatial and temporal interpolation/extrapolation based on hydrometeor fall dynamics, we can merge the hail disdrometer array data coupled with local Weather Surveillance Radar-1988, Doppler (WSR-88D) radial velocity and reflectivity data into a 4-D (3-D space and time) picture of hail size distributions. Hail flux maps can then be generated and used for damage prediction and assessment over specific surfaces corresponding to structures within the disdrometer array volume. Immediately following a hail storm, specific damage areas and degree of damage can be identified for inspection crews.

Source record↗

F-8C adaptive control law refinement and software development

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters was designed. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm was implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer, surface position) are telemetered to a ground computer which sends new gain values to an on-board system. Ground test data and flight records were used to establish design values of noise statistics and to verify the ground-based adaptive software.

Hartmann, G. L.↗

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

Shifting Data Collection from a Fixed to an Adaptive Sampling Paradigm

For domains where data are difficult to obtain due to human or resource limitations, an emphasis is needed to efficiently explore the dimensions of information spaces to acquire any given response of interest. Many disciplines are still making the transition from brute force, dense, full factorial exploration of their information spaces to a more efficient design of experiments approach; the latter being in use successfully for many decades in agricultural and automotive applications. Although this transition is still incomplete, groundwork must be laid for incorporating the next generation of algorithms to adaptively explore the information space in response to data collected, as well as any resulting empirical models (i.e., metamodels). The methodology in the present work was to compare metamodel quality using a fixed sampling technique compared to an adaptive sampling technique based on metamodel variance. In order to quantify metamodeling errors, a delta method was used to provide quantitative model variance estimates. The present methodology was applied to a design space with an air-breathing engine performance response. It was shown that competitive metamodel quality with lower associated error could be achieved for an adaptive sampling technique for the same level of effort as a fixed, a priori sampling technique.

Axdahl, Erik L.↗

Reducing Speckle In One-Look SAR Images

Local-adaptive-filter algorithm incorporated into digital processing of synthetic-aperture-radar (SAR) echo data to reduce speckle in resulting imagery. Involves use of image statistics in vicinity of each picture element, in conjunction with original intensity of element, to estimate brightness more nearly proportional to true radar reflectance of corresponding target. Increases ratio of signal to speckle noise without substantial degradation of resolution common to multilook SAR images. Adapts to local variations of statistics within scene, preserving subtle details. Computationally simple. Lends itself to parallel processing of different segments of image, making possible increased throughput.

Nathan, K. S.↗

Runway Incursion Prevention for General Aviation Operations

A Runway Incursion Prevention System (RIPS) and additional incursion detection algorithm were adapted for general aviation operations and evaluated in a simulation study at the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC) in the fall of 2005. RIPS has been designed to enhance surface situation awareness and provide cockpit alerts of potential runway conflicts in order to prevent runway incidents while also improving operational capability. The purpose of the study was to evaluate the airborne incursion detection algorithms and associated alerting and airport surface display concepts for general aviation operations. This paper gives an overview of the system, simulation study, and test results.

Jones, Denise R.↗

Runway Incursion Prevention System for General Aviation Operations

A Runway Incursion Prevention System (RIPS) and additional incursion detection algorithm were adapted for general aviation operations and evaluated in a simulation study at the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC) in the fall of 2005. RIPS has been designed to enhance surface situation awareness and provide cockpit alerts of potential runway conflicts in order to prevent runway incidents while also improving operational capability. The purpose of the study was to evaluate the airborne incursion detection algorithms and associated alerting and airport surface display concepts for general aviation operations. This paper gives an overview of the system, simulation study, and test results.

Jones, Denise R.↗

A fixed/variable bit-rate data compression architecture

A VLSI architecture for an adaptive data compression encoder capable of sustaining fixed or variable bit-rate output has been developed. There are three modes of operation: lossless with variable bit-rate, lossy with fixed bit-rate and lossy with variable bit-rate. For lossless encoding, the implementation is identical to the USES chip designed for Landsat 7. Obtaining a fixed bit-rate is achieved with a lossy DPCM algorithm using adaptive, nonuniform scalar quantization. In lossy mode, variable bit-rate coding uses the lossless sections of the encoder for post-DPCM entropy coding. The encoder shows excellent compression performance in comparison to other current data compression techniques. No external tables or memory are required for operation.

Zweigle, Gregary C.↗

Implementation of an Adaptive Controller System from Concept to Flight Test

The National Aeronautics and Space Administration Dryden Flight Research Center (Edwards, California) is conducting ongoing flight research using adaptive controller algorithms. A highly modified McDonnell-Douglas NF-15B airplane called the F-15 Intelligent Flight Control System (IFCS) was used for these algorithms. This airplane has been modified by the addition of canards and by changing the flight control systems to interface a single-string research controller processor for neural network algorithms. Research goals included demonstration of revolutionary control approaches that can efficiently optimize aircraft performance for both normal and failure conditions, and to advance neural-network-based flight control technology for new aerospace systems designs. Before the NF-15B IFCS airplane was certified for flight test, however, certain processes needed to be completed. This paper presents an overview of these processes, including a description of the initial adaptive controller concepts followed by a discussion of modeling formulation and performance testing. Upon design finalization, the next steps are: integration with the system interfaces, verification of the software, validation of the hardware to the requirements, design of failure detection, development of safety limiters to minimize the effect of erroneous neural network commands, and creation of flight test control room displays to maximize human situational awareness.

Larson, Richard R.↗

Integrating Oil Debris and Vibration Measurements for Intelligent Machine Health Monitoring

A diagnostic tool for detecting damage to gears was developed. Two different measurement technologies, oil debris analysis and vibration were integrated into a health monitoring system for detecting surface fatigue pitting damage on gears. This integrated system showed improved detection and decision-making capabilities as compared to using individual measurement technologies. This diagnostic tool was developed and evaluated experimentally by collecting vibration and oil debris data from fatigue tests performed in the NASA Glenn Spur Gear Fatigue Rig. An oil debris sensor and the two vibration algorithms were adapted as the diagnostic tools. An inductance type oil debris sensor was selected for the oil analysis measurement technology. Gear damage data for this type of sensor was limited to data collected in the NASA Glenn test rigs. For this reason, this analysis included development of a parameter for detecting gear pitting damage using this type of sensor. The vibration data was used to calculate two previously available gear vibration diagnostic algorithms. The two vibration algorithms were selected based on their maturity and published success in detecting damage to gears. Oil debris and vibration features were then developed using fuzzy logic analysis techniques, then input into a multi sensor data fusion process. Results show combining the vibration and oil debris measurement technologies improves the detection of pitting damage on spur gears. As a result of this research, this new diagnostic tool has significantly improved detection of gear damage in the NASA Glenn Spur Gear Fatigue Rigs. This research also resulted in several other findings that will improve the development of future health monitoring systems. Oil debris analysis was found to be more reliable than vibration analysis for detecting pitting fatigue failure of gears and is capable of indicating damage progression. Also, some vibration algorithms are as sensitive to operational effects as they are to damage. Another finding was that clear threshold limits must be established for diagnostic tools. Based on additional experimental data obtained from the NASA Glenn Spiral Bevel Gear Fatigue Rig, the methodology developed in this study can be successfully implemented on other geared systems.

Dempsey, Paula J.↗

Experimental Testing of Advanced Generalized Predictive Control for Stability Augmentation and Vibration Reduction of Tiltrotor Aircraft

Generalized Predictive Control (GPC) is an advanced form of an adaptive control algorithm that uses experimentally acquired data to determine the input-output relationship of complex systems through a process called system identification (system ID). GPC has historically been applied to wind tunnel tests of dynamically-scaled tiltrotor aircraft for stability augmentation and vibration reduction since the complex nature of these dynamic systems does not lend itself well to traditional control theory. Advanced GPC (AGPC) improves upon traditional GPC by enabling self-adaptation as conditions change from those used to acquire the system ID and controller performance would normally erode. The present research expands upon previous analytical development and demonstration of AGPC with experimental demonstration. To support AGPC, this present work also identifies and describes figures of merit that define a good working controller and quantifies the uniqueness of the control inputs and quality of the system ID parameters. The present research demonstrates that AGPC consistently performs better than traditional GPC and can successfully adapt to changing conditions.

Active Controls↗

Experimental Testing of Advanced Generalized Predictive Control for Stability Augmentation and Vibration Reduction of Tiltrotor Aircraft

Generalized Predictive Control (GPC) is an advanced form of an adaptive control algorithm that uses experimentally acquired data to determine the input-output relationship of complex systems through a process called system identification (system ID). GPC has historically been applied to wind tunnel tests of dynamically-scaled tiltrotor aircraft for stability augmentation and vibration reduction since the complex nature of these dynamic systems does not lend itself well to traditional control theory. Advanced GPC (AGPC) improves upon traditional GPC by enabling self-adaptation as conditions change from those used to acquire the system ID and controller performance would normally erode. The present research expands upon previous analytical development and demonstration of AGPC with experimental demonstration. To support AGPC, this present work also identifies and describes figures of merit that define a good working controller and quantifies the uniqueness of the control inputs and quality of the system ID parameters. The present research demonstrates that AGPC consistently performs better than traditional GPC and can successfully adapt to changing conditions.

Active Controls↗

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved Localization Precision and Angular Resolution of a Cylindrical, Time-Encoded Imaging System From Adaptive Detector Movements

To the first order, the localization precision and angular resolution of a cylindrical, time-encoded imaging (c-TEI) system is governed by the geometry of the system. Improving either measure requires increasing the mask radius or decreasing the detector diameter, both of which are undesirable. Here, we propose an alternative option of repositioning the detector within the mask to increase the detector-to-mask distance in the direction of a source, thereby improving the localization precision and angular resolution in that direction. Since the detector-to-mask distance only increases for a small portion of the field of view (FOV), we propose implementing adaptive imaging where one leverages data collected during the measurement to optimize the system configuration. This article utilizes both simulations and experiments to set upper bounds on the potential gain from adaptive detector movements for one and two sources in the FOV. When only one source is present, adaptive detector movements can improve the localization precision and angular resolution by 20% for a source at 90 cm and by 32% for a far-field source. When two sources are present, adaptive detector movements can improve localization precision and angular resolution by up to 50% for sources that are ~10° apart (90 cm from the system). We experimentally verify these results through maximum likelihood estimation of the source position(s) and image reconstruction of point sources that are close together. As a demonstration of an adaptive imaging algorithm, we image a complex arrangement of special nuclear material at the Zero Power Physics Reactor facility at Idaho National Laboratory.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗