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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Application of Thévenin equivalent sensitivity equations for reliable voltage stability assessment

In this paper, sensitivity equations for the Thévenin equivalent parameters, voltage and reactance, are derived using the duality between the Thévenin parameters from two consecutive PMU measurements. Using the sensitivity equation for the Thévenin reactance, a robust adaptive X-Th algorithm is developed aiming to extend a well-known adaptive E-Th approach by being able to accurately estimate the parameters for a wider range of loading conditions. In the performed case studies the resulting accuracy is evaluated when estimating the Thévenin parameters for large disturbances, for two sides with respect to a boundary bus, accommodating sensitivity to topology changes and nonlinearities in power systems. In conclusion, the results can be used for accurate voltage stability assessment using the Thévenin parameters.

42 ENGINEERING↗
NASA NTRS2007

Lossless Video Sequence Compression Using Adaptive Prediction

We present an adaptive lossless video compression algorithm based on predictive coding. The proposed algorithm exploits temporal, spatial, and spectral redundancies in a backward adaptive fashion with extremely low side information. The computational complexity is further reduced by using a caching strategy. We also study the relationship between the operational domain for the coder (wavelet or spatial) and the amount of temporal and spatial redundancy in the sequence being encoded. Experimental results show that the proposed scheme provides significant improvements in compression efficiencies.

Li, Ying↗
DOE OSTI2025

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗
NASA NTRS1977

Digital control of high performance aircraft using adaptive estimation techniques

In this paper, an adaptive signal processing algorithm is joined with gain-scheduling for controlling the dynamics of high performance aircraft. A technique is presented for a reduced-order model (the longitudinal dynamics) of a high performance STOL aircraft. The actual controller views the nonlinear behavior of the aircraft as equivalent to a randomly switching sequence of linear models taken from a preliminary piecewise-linear fit of the system nonlinearities. The adaptive nature of the estimator is necessary to select the proper sequence of linear models along the flight trajectory. Nonlinear behavior is approximated by effective switching of the linear models at random times, with durations reflecting aircraft motion in response to pilot commands.

Van Landingham, H. F.↗
DOE OSTI2023

Alignment of the CLAS12 central hybrid tracker with a Kalman Filter

Several factors can contribute to the difficulty of aligning the sensors of tracking detectors, including a large number of modules, multiple types of detector technologies, and non-linear strip patterns on the sensors. All three of these factors apply to the CLAS12 CVT, which is a hybrid detector consisting of planar silicon sensors with non-parallel strips, and cylindrical micromegas sensors with longitudinal and arc-shaped strips located within a 5 T superconducting solenoid. To align this detector, we used the Kalman Alignment Algorithm, which accounts for correlations between the alignment parameters without requiring the time-consuming inversion of large matrices. This is the first time that this algorithm has been adapted for use with hybrid technologies, non-parallel strips, and curved sensors. We present the results for the first alignment of the CLAS12 CVT using straight tracks from cosmic rays and from a target with the magnetic field turned off. After running this procedure, we achieved alignment at the level of 10 µm, and the widths of the residual spectra were greatly reduced. These results attest to the flexibility of this algorithm and its applicability to future use in the CLAS12 CVT and other hybrid or curved trackers, such as those proposed for the future Electron-Ion Collider.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1975

Adaptive Bayes classifiers for remotely sensed data

An algorithm is developed for a learning, adaptive, statistical pattern classifier for remotely sensed data. The estimation procedure consists of two steps: (1) an optimal stochastic approximation of the parameters of interest, and (2) a projection of the parameters in time and space. The results reported are for Gaussian data in which the mean vector of each class may vary with time or position after the classifier is trained.

Raulston, H. S.↗
DOE OSTI2025

Virtual to Physical: Reinforcement Learning to Optimize SNS Particle Accelerator Controls

Complex accelerators must have control systems that can handle dynamic nonlinear environments. This makes traditional control methods unsuitable as they can struggle to adapt to these uncertainties. This provides an ideal environment for reinforcement learning algorithms as they are adaptable and generalizable. We present a reinforcement learning pipeline that can effectively handle the dynamics of a complex accelerator. We test and prove our pipelines capabilities on multiple environments including the Spallation Neutron Source (SNS) and the Beam Test Facility (BTF) at Oakridge National Lab (ORNL). Due to the limited time available to train an online algorithm like reinforcement learning on a real accelerator, we utilize a virtual twin accelerator (VIRAC) developed by ORNL to pretrain the policy and show its ability to converge in the virtual environment. We then test the adaptability of the pretrained RL model by applying it on the real accelerator and comparing the results. Utilizing our Scientific Optimization and Controls Toolkit (SOCT) and open-source standards such as Gymnasium we create and solve for a MEBT orbit correction problem in the SNS and an emittance maximization problem in the BTF. We show how Twin Delayed Deep Deterministic Policy Gradient (TD3) can solve this optimization environment in the virtual accelerator and transfer this policy onto the real accelerator for inference and model retraining. We show how reinforcement learning can be utilized as a control system for complex accelerators and provide a model pipeline for how an implementation performs and can be adapted to new accelerator control problems.

Kasparian, Armen [Thomas Jefferson National Accele↗
DOE OSTI2021

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A hybrid calibration approach to Hertz-type contact parameters for discrete element models

This study aims at providing a hybrid calibration framework to estimate Hertz-type contact parameters (particle-scale shear modulus and Poisson ratio) for both two-dimensional and three-dimensional discrete element modelling (DEM). On the basis of statistically isotropic granular packings, a set of analytical formulae between macroscopic material parameters (Young modulus and Poisson ratio) and particle-scale Hertz-type contact parameters for granular systems are derived under small-strain isotropic stress conditions. However, the derived analytical solutions are only estimated values for general models. By viewing each DEM modelling as an implicit mathematical function taking the particle-level parameters as independent variables and employing the derived analytical solutions as the initial input parameters, an automatic iterative scheme is proposed to obtain the calibrated parameters with higher accuracies. Considering highly nonlinear features and discontinuities of the macro-micro relationship in Hertz-based discrete element models, the adaptive moment estimation algorithm is adopted in this study because of its capacity of dealing with noise gradients of cost functions. Here, the proposed method is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. Noticeable improvements in terms of calibration efficiency and accuracy have been made.

Constitutive law↗
NASA NTRS1992

Locally adaptive vector quantization: Data compression with feature preservation

A study of a locally adaptive vector quantization (LAVQ) algorithm for data compression is presented. This algorithm provides high-speed one-pass compression and is fully adaptable to any data source and does not require a priori knowledge of the source statistics. Therefore, LAVQ is a universal data compression algorithm. The basic algorithm and several modifications to improve performance are discussed. These modifications are nonlinear quantization, coarse quantization of the codebook, and lossless compression of the output. Performance of LAVQ on various images using irreversible (lossy) coding is comparable to that of the Linde-Buzo-Gray algorithm, but LAVQ has a much higher speed; thus this algorithm has potential for real-time video compression. Unlike most other image compression algorithms, LAVQ preserves fine detail in images. LAVQ's performance as a lossless data compression algorithm is comparable to that of Lempel-Ziv-based algorithms, but LAVQ uses far less memory during the coding process.

Cheung, K. M.↗
DOE OSTI2021

Timely Reporting of Heavy Hitters Using External Memory

Given an input stream S of size N, a Φ-heavy hitter is an item that occurs at least ΦN times in S. The problem of finding heavy-hitters is extensively studied in the database literature. In this work, we study a real-time heavy-hitters variant in which an element must be reported shortly after we see its T = Φ N-th occurrence (and hence it becomes a heavy hitter). We call this the Timely Event Detection (TED) Problem. The TED problem models the needs of many real-world monitoring systems, which demand accurate (i.e., no false negatives) and timely reporting of all events from large, high-speed streams with a low reporting threshold (high sensitivity). Like the classic heavy-hitters problem, solving the TED problem without false-positives requires large space (Ω (N) words). Thus in-RAM heavy-hitters algorithms typically sacrifice accuracy (i.e., allow false positives), sensitivity, or timeliness (i.e., use multiple passes). We show how to adapt heavy-hitters algorithms to external memory to solve the TED problem on large high-speed streams while guaranteeing accuracy, sensitivity, and timeliness. Our data structures are limited only by I/O-bandwidth (not latency) and support a tunable tradeoff between reporting delay and I/O overhead. With a small bounded reporting delay, our algorithms incur only a logarithmic I/O overhead. We implement and validate our data structures empirically using the Firehose streaming benchmark. Multi-threaded versions of our structures can scale to process 11M observations per second before becoming CPU bound. In comparison, a naive adaptation of the standard heavy-hitters algorithm to external memory would be limited by the storage device’s random I/O throughput, i.e., ≈100K observations per second.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

An adaptive data-smoothing routine

An adaptive noise reduction algorithm that can be implemented on a microcomputer is developed. Smoothing polynomials are used where the polynomial coefficients are chosen such that the mean-square-error between the noisy and smoothed data is minimized. This approach is equivalent to the implementation of a low-pass finite impulse response filter. The noise reduction depends on the order of the smoothing polynomial. A whiteness test on the error sequence is incorporated to search for the optimal smoothing. Expansion coefficients may be computed via the fast Fourier transform, and the resulting smoothing process is the equivalent of the implementation of an adaptive ideal low-pass filter. Results are obtained for an analytical signal with added white Gaussian noise. The routine may be applied to any smooth signal with additive random noise.

Taylor, Clayborne D.↗
NASA NTRS2010

Station Keeping of Small Outboard-Powered Boats

Three station keeping controllers have been developed which work to minimize displacement of a small outboard-powered vessel from a desired location. Each of these three controllers has a common initial layer that uses fixed-gain feedback control to calculate the desired heading of the vessel. A second control layer uses a common fixed-gain feedback controller to calculate the net forward thrust, one of two algorithms for controlling engine angle (Fixed-Gain Proportional-integral-derivative (PID) or PID with Adaptively Augmented Gains), and one of two algorithms for differential throttle control (Fixed-Gain PID and PID with Adaptive Differential Throttle gains), which work together to eliminate heading error. The three selected controllers are evaluated using a numerical simulation of a 33-foot center console vessel with twin outboards that is subject to wave, wind, and current disturbances. Each controller is tested for its ability to maintain position in the presence of three sets of environmental disturbances. These algorithms were tested with current velocity of 1.5 m/s, significant wave height of 0.5 m, and wind speeds of 2, 5, and 10 m/s. These values were chosen to model conditions a small vessel may experience in the Gulf Stream off of Fort Lauderdale. The Fixed-gain PID controller progressively got worse as wind speeds increased, while the controllers using adaptive methodologies showed consistent performance over all weather conditions and decreased heading error by as much as 20%. Thus, enhanced robustness to environmental changes has been gained by using an adaptive algorithm.

Fisher, A. D.↗
NASA NTRS1986

STEP and STEPSPL: Computer programs for aerodynamic model structure determination and parameter estimation

The successful parametric modeling of the aerodynamics for an airplane operating at high angles of attack or sideslip is performed in two phases. First the aerodynamic model structure must be determined and second the associated aerodynamic parameters (stability and control derivatives) must be estimated for that model. The purpose of this paper is to document two versions of a stepwise regression computer program which were developed for the determination of airplane aerodynamic model structure and to provide two examples of their use on computer generated data. References are provided for the application of the programs to real flight data. The two computer programs that are the subject of this report, STEP and STEPSPL, are written in FORTRAN IV (ANSI l966) compatible with a CDC FTN4 compiler. Both programs are adaptations of a standard forward stepwise regression algorithm. The purpose of the adaptation is to facilitate the selection of a adequate mathematical model of the aerodynamic force and moment coefficients of an airplane from flight test data. The major difference between STEP and STEPSPL is in the basis for the model. The basis for the model in STEP is the standard polynomial Taylor's series expansion of the aerodynamic function about some steady-state trim condition. Program STEPSPL utilizes a set of spline basis functions.

Batterson, J. G.↗
NASA NTRS1995

Performance seeking control (PSC) for the F-15 highly integrated digital electronic control (HIDEC) aircraft

The performance seeking control algorithm optimizes total propulsion system performance. This adaptive, model-based optimization algorithm has been successfully flight demonstrated on two engines with differing levels of degradation. Models of the engine, nozzle, and inlet produce reliable, accurate estimates of engine performance. But, because of an observability problem, component levels of degradation cannot be accurately determined. Depending on engine-specific operating characteristics PSC achieves various levels performance improvement. For example, engines with more deterioration typically operate at higher turbine temperatures than less deteriorated engines. Thus when the PSC maximum thrust mode is applied, for example, there will be less temperature margin available to be traded for increasing thrust.

Orme, John S.↗
NASA NTRS2015

Certification Considerations for Adaptive Systems

Advanced capabilities planned for the next generation of aircraft, including those that will operate within the Next Generation Air Transportation System (NextGen), will necessarily include complex new algorithms and non-traditional software elements. These aircraft will likely incorporate adaptive control algorithms that will provide enhanced safety, autonomy, and robustness during adverse conditions. Unmanned aircraft will operate alongside manned aircraft in the National Airspace (NAS), with intelligent software performing the high-level decision-making functions normally performed by human pilots. Even human-piloted aircraft will necessarily include more autonomy. However, there are serious barriers to the deployment of new capabilities, especially for those based upon software including adaptive control (AC) and artificial intelligence (AI) algorithms. Current civil aviation certification processes are based on the idea that the correct behavior of a system must be completely specified and verified prior to operation. This report by Rockwell Collins and SIFT documents our comprehensive study of the state of the art in intelligent and adaptive algorithms for the civil aviation domain, categorizing the approaches used and identifying gaps and challenges associated with certification of each approach.

Bhattacharyya, Siddhartha↗
DOE OSTI2020

Development and Validation of Quantitative Model-Based Image Reconstruction for NDE of Reinforced Steel-Lined Concrete Structures: Kal-El FY 2020

This project studied the capabilities of Model-Based Image Reconstruction (MBIR) and Machine Learning (ML) algorithms in the imaging and estimation of rebar corrosion from ultrasound signals. The application was challenging due to the introduction of a steel liner between the sensor and the concrete containing the rebar. The study focused in a synthetic specimen with a 6.35 mm thick steel liner, and a 19.05 mm diameter rebar at a depth of 44.5 mm and with four levels of corrosion; 0%, 20%, 50%, and 100% corrosion level. The corrosion was applied uniformly around the rebar, generating a ring in the perimeter of the rebar with different acoustic density. In order to generate a realistic synthetic dataset, we added random texture to the concrete of the synthetic specimens. This texture will mimic the variations encountered in real concrete specimens.We adapted our MBIR algorithm for the application and enhanced the algorithm to integrate in the physical model known specimen features, such as the steel liner thickness. The new MBIR method was able to cancel out reverberation from the steel liner and properly image the rebar. In particular, corrosion for the 50% and 100% cases were easily visible and quantitative metrics showed a slight separation for the 0% and 20% levels. The quantitative results were in agreement with the qualitative assessment. We also developed a ML XGBoost model to estimate corrosion level from the ultrasound signals. By combining the ML method with MBIR, we can pinpoint in the ultrasound signals the section that corresponds to the echoes from the rebar. The extract signals are processed by the XGBoost model for prediction. From each system scan, we obtain 15 predictions. The median prediction value is used as the final prediction. The True Acceptance Rate for the method is over 99%.

36 MATERIALS SCIENCE↗