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 145 records · Page 8

Genetic-Algorithm Tool For Search And Optimization

SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

Wang, Lui↗

SIGHT: Stacked Integration of Geospatial Hierarchical Typologies for Inferring Building Characteristics

Building characteristics are often absent in building stock datasets, particularly in regions most vulnerable to climate change and requiring effective disaster management strategies. Traditional machine learning approaches, while widely used to predict building attributes, typically neglect the spatial context of the data, leading to less accurate and reliable outcomes. To address these challenges, this paper introduces a novel algorithm, the Stacked Integration of Geospatial Hierarchical Typologies. This algorithm adapts a meta-learning framework to incorporate geospatial context into the predictive modeling process. We demonstrate the utility of the algorithm through two primary use cases: building use type classification and building height prediction. The algorithm consistently achieved or exceeded a 0.94 macro average F1 score across five geographically distinct countries for building use type classification. For building height prediction, it accurately predicted heights with a root mean square error of 3.01 in a comprehensive study using roughly 3.6 million buildings in Japan. These results underscore the benefits of integrating spatial hierarchies into machine learning models, enhancing both predictive accuracy and reliability in geospatial modeling. This work introduces a new algorithm to address the pervasive data sparsity issue in existing building stock datasets.

Adams, Daniel [ORNL] (ORCID:0000000196950577)↗

A Predictive Prescription Framework for Stochastic Unit Commitment Using Boosting Ensemble Learning Algorithms

To take unit commitment (UC) decisions under uncertain load, most existing stochastic optimization (SO) frameworks adopt a generic representation of uncertainty. While load levels that materialize on a particular day are influenced by various covariates (such as the day of the week or temperature), SO frameworks typically disregard such side observations, wasting actionable information that could significantly enhance decision quality. Here, this article proposes a contextual SO (CSO) framework for UC under uncertain load, which can effectively exploit covariate observations in conjunction with a class of machine learning (ML) algorithms to improve the out-of-sample performance of UC decisions. It shows how three ML algorithms, adaptive boosting, gradient boosted trees, and extreme gradient boosting, can be used to this end, constituting the first application of these algorithms in any CSO framework. Using real-world data harvested from the New York ISO grid, we measure the out-of-sample performance of the framework in terms of total operation cost, shed load values, locational marginal prices, and total payments by the loads, against several benchmark methods proposed in the literature. The article has an online companion (Yurdakul et al.), wherein we present additional results and lay out further mathematical formulations used in this work.

42 ENGINEERING↗

Speckle noise reduction of 1-look SAR imagery

Speckle noise is inherent to synthetic aperture radar (SAR) imagery. Since the degradation of the image due to this noise results in uncertainties in the interpretation of the scene and in a loss of apparent resolution, it is desirable to filter the image to reduce this noise. In this paper, an adaptive algorithm based on the calculation of the local statistics around a pixel is applied to 1-look SAR imagery. The filter adapts to the nonstationarity of the image statistics since the size of the blocks is very small compared to that of the image. The performance of the filter is measured in terms of the equivalent number of looks (ENL) of the filtered image and the resulting resolution degradation. The results are compared to those obtained from different techniques applied to similar data. The local adaptive filter (LAF) significantly increases the ENL of the final image. The associated loss of resolution is also lower than that for other commonly used speckle reduction techniques.

Nathan, Krishna S.↗

Design of Low Complexity Model Reference Adaptive Controllers

Flight research experiments have demonstrated that adaptive flight controls can be an effective technology for improving aircraft safety in the event of failures or damage. However, the nonlinear, timevarying nature of adaptive algorithms continues to challenge traditional methods for the verification and validation testing of safety-critical flight control systems. Increasingly complex adaptive control theories and designs are emerging, but only make testing challenges more difficult. A potential first step toward the acceptance of adaptive flight controllers by aircraft manufacturers, operators, and certification authorities is a very simple design that operates as an augmentation to a non-adaptive baseline controller. Three such controllers were developed as part of a National Aeronautics and Space Administration flight research experiment to determine the appropriate level of complexity required to restore acceptable handling qualities to an aircraft that has suffered failures or damage. The controllers consist of the same basic design, but incorporate incrementally-increasing levels of complexity. Derivations of the controllers and their adaptive parameter update laws are presented along with details of the controllers implementations.

Hanson, Curt↗

Input error versus output error model reference adaptive control

Algorithms for model reference adaptive control were developed in recent years, and their stability and convergence properties have been investigated. Typical algorithms in continuous time involve strictly positive real conditions on the reference model, while similar discrete time algorithms do not require such conditions. It is shown how algorithms differ by the use of an input error versus an output error, and present a continuous time input error adaptive control algorithm which does not involve SPR conditions. The connections with other schemes are discussed. The input error scheme has general stability and ocnvergence properties that are similar to the output error scheme. However, analysis using averaging methods reveals some preferable convergence properties of the input error scheme. Several other advantages are also discussed.

Bodson, Marc↗

Adaptive control in the presence of unmodeled dynamics

Stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances were investigated. The class of adaptive algorithms considered are those commonly referred to as model reference adaptive control algorithms, self-tuning controllers, and dead beat adaptive controllers, developed for both continuous-time systems and discrete-time systems. A unified analytical approach was developed to examine the class of existing adaptive algorithms. It was discovered that all existing algorithms contain an infinite gain operator in the dynamic system that defines command reference errors and parameter errors; it is argued that such an infinite gain operator appears to be generic to all adaptive algorithms, whether they exhibit explicit or implicit parameter identification. It is concluded that none of the adaptive algorithms considered can be used with confidence in a practical control system design, because instability will set in with a high probability.

Rohrs, C. E.↗

Physics-based adaptivity of a spectral method for the Vlasov–Poisson equations based on the asymmetrically-weighted Hermite expansion in velocity space

We propose a spectral method for the 1D-1V Vlasov–Poisson system where the discretization in velocity space is based on asymmetrically-weighted Hermite functions, dynamically adapted via a scaling α and shifting u of the velocity variable. Specifically, at each time instant an adaptivity criterion selects new values of α and u based on the numerical solution of the discrete Vlasov–Poisson system obtained at that time step. Once the new values of the Hermite parameters α and u are fixed, the Hermite expansion is updated and the discrete system is further evolved for the next time step. The procedure is applied iteratively over the desired temporal interval. The key aspects of the adaptive algorithm are: the map between approximation spaces associated with different values of the Hermite parameters that preserves total mass, momentum and energy; and the adaptivity criterion to update α and u based on physics considerations relating the Hermite parameters to the average velocity and temperature of each plasma species. For the discretization of the spatial coordinate, we rely on Fourier functions and use the implicit midpoint rule for time stepping. The resulting numerical method possesses intrinsically the property of fluid-kinetic coupling, where the low-order terms of the expansion are akin to the fluid moments of a macroscopic description of the plasma, while kinetic physics is retained by adding more spectral terms. Moreover, the scheme features conservation of total mass, momentum and energy associated in the discrete, for periodic boundary conditions. A set of numerical experiments confirms that the adaptive method outperforms the non-adaptive one in terms of accuracy and stability of the numerical solution.

97 MATHEMATICS AND COMPUTING↗

Estimating Alpine Snow Depth by Combining Multi-Frequency Passive Radiance Observations with Ensemble Snowpack Modeling

This paper presents a physically-based snow depth retrieval algorithm adapted for deep mountainous snowpack and airborne multifrequency (10.7, 18.7, 37.0 and 89.0 GHz) passive microwave (PM) radiance observations from a single flight. The algorithm employs a single forecast-analysis cycle of a traditional sequential assimilation scheme. It uses an ensemble of multi-layer snowpack model runs to resolve snow microstructure and melt-refreeze crusts, andmicrowave radiative transfer models to relate snow properties to microwave measurements.Snow depth was retrieved at a 120 m spatial resolution over three 1 km2 Intensive Study Area (ISA) within the Rabbit Ears Meso-Cell Study Area (MSA) from the NASA Cold Land Processes Experiment (CLPX) in Colorado (United States) for one date in February 2003. When evaluated against in situ observations, root mean square error (RMSE) of the snow depth from the assimilation was 13.3 cm for areas with low (<5 %) forest cover, which was a reduction of 48 % in the RMSE compared with the modeled snow depth when the PM observations were not assimilated; indicating a ~5% relative error of the posterior snow depth with respect to the average snow depth (200 cm) measured at these pixels. For pixels with forest cover ranging from 5-15% and 15-30%, results were improved (R2 increased from 0.65 to 0.71 and from 0 to 0.38, respectively) by introducing a forest radiative transfer model during the assimilation.

Airborne Multifrequency↗

Multi-element array signal reconstruction with adaptive least-squares algorithms

Two versions of the adaptive least-squares algorithm are presented for combining signals from multiple feeds placed in the focal plane of a mechanical antenna whose reflector surface is distorted due to various deformations. Coherent signal combining techniques based on the adaptive least-squares algorithm are examined for nearly optimally and adaptively combining the outputs of the feeds. The performance of the two versions is evaluated by simulations. It is demonstrated for the example considered that both of the adaptive least-squares algorithms are capable of offsetting most of the loss in the antenna gain incurred due to reflector surface deformations.

Kumar, R.↗

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100% reduction of the perturbation thrust response to a step gust and more than 50% reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100 percent reduction of the perturbation thrust response to a step gust and more than 50 percent reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

Grid adaptation to multiple functions for applied aerodynamic analysis

A fast and robust method of grid adaptation to multiple functions has been developed for flow analysis in 3D space. It is based on the equidistribution principle and the alternate direction adaptation method. The grid adaptation algorithm has been fully integrated with a space marching flow solver as contained within a 3D Navier-Stokes code and PAB3D-v2. The grid adaptation strategy, details of numerical implementation, examples of application, and potential extensions of the current method are presented in this paper.

Pao, S. P.↗

A new approach to adaptive control of manipulators

An approach in which the manipulator inverse is used as a feedforward controller is employed in the adaptive control of manipulators in order to achieve trajectory tracking by the joint angles. The desired trajectory is applied as an input to the feedforward controller, and the controller output is used as the driving torque for the manipulator. An adaptive algorithm obtained from MRAC theory is used to update the controller gains to cope with variations in the manipulator inverse due to changes of the operating point. An adaptive feedback controller and an auxiliary signal enhance closed-loop stability and achieve faster adaptation. Simulation results demonstrate the effectiveness of the proposed control scheme for different reference trajectories, and despite large variations in the payload.

Seraji, H.↗

Telerobotic control of a mobile coordinated robotic server, executive summary

This interim report continues with the research effort on advanced adaptive controls for space robotics systems. In particular, previous results developed by the principle investigator and his research team centered around fuzzy logic control (FLC) in which the lack of knowledge of the robotic system as well as the uncertainties of the environment are compensated for by a rule base structure which interacts with varying degrees of belief of control action using system measurements. An on-line adaptive algorithm was developed using a single parameter tuning scheme. In the effort presented, the methodology is further developed to include on-line scaling factor tuning and self-learning control as well as extended to the multi-input, multi-output (MIMO) case. Classical fuzzy logic control requires tuning input scale factors off-line through trial and error techniques. This is time-consuming and cannot adapt to new changes in the process. The new adaptive FLC includes a self-tuning scheme for choosing the scaling factors on-line. Further the rule base in classical FLC is usually produced by soliciting knowledge from human operators as to what is good control action for given circumstances. This usually requires full knowledge and experience of the process and operating conditions, which limits applicability. A self-learning scheme is developed which adaptively forms the rule base with very limited knowledge of the process. Finally, a MIMO method is presented employing optimization techniques. This is required for application to space robotics in which several degrees-of-freedom links are commonly used. Simulation examples are presented for terminal control - typical of robotic problems in which a desired terminal point is to be reached for each link. Future activities will be to implement the MIMO adaptive FLC on an INTEL microcontroller-based circuit and to test the algorithm on a robotic system at the Mars Mission Research Center at North Carolina State University.

Lee, Gordon↗

Adaptive piezoelectric sensoriactuator

An adaptive algorithm implemented in digital or analog form is used in conjunction with a voltage controlled amplifier to compensate for the feedthrough capacitance of piezoelectric sensoriactuator. The mechanical response of the piezoelectric sensoriactuator is resolved from the electrical response by adaptively altering the gain imposed on the electrical circuit used for compensation. For wideband, stochastic input disturbances, the feedthrough capacitance of the sensoriactuator can be identified on-line, providing a means of implementing direct-rate-feedback control in analog hardware. The device is capable of on-line system health monitoring since a quasi-stable dynamic capacitance is indicative of sustained health of the piezoelectric element.

Clark, Jr., Robert L.↗

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A time-split finite-volume algorithm for three-dimensional flow-field simulation

A general finite-volume algorithm is developed for solving three-dimensional, time-dependent, compressible Navier-Stokes equations for high Reynolds number flows over an arbitrary geometry. This algorithm adapts MacCormack's (1982) explicit-implicit scheme to a time-split, three-dimensional finite-volume concept in a general coordinate system. It is shown that the thin-layer approximation in all three spatial directions significantly reduces the evaluation of viscous terms and allows the algorithm to solve more complicated geometries with all boundaries in two or all three directions. The calculated results using this method are found to be in good agreement with the experimental measurements of a blunt-fin induced shock wave and boundary-layer interaction problems. Observations of the existence of peak pressure, primary horseshoe and secondary vortices, and reversed supersonic zones show that computational fluid dynamics can effectively supplement the wind tunnel tests for aerodynamic design as well as for understanding basic fluid dynamics.

Hung, C. M.↗