Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “online 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 109 records · Page 6

Real-time control of connected vehicles in signalized corridors using pseudospectral convex optimization

Recent advances in Connected and Automated Vehicle (CAV) technologies have opened up new opportunities to enable safe, efficient, and sustainable transportation systems. However, developing reliable and rapid speed control algorithms in highly dynamic environments with complex inter-vehicle interactions and nonlinear vehicle dynamics is still a daunting task. In this paper, we develop a novel speed control method for CAVs to produce optimal speed profiles that minimize the fuel consumption and avoid idling at signalized intersections. To this end, an optimal control problem is formulated using the information of the upcoming traffic signal to adapt vehicles' speeds to avoid frequent stop-and-go driving patterns. Here, by applying the pseudospectral discretization method and the sequential convex programming method, the computational efficiency is greatly improved, enabling potential real-time on-vehicle applications. In addition, the algorithm is implemented under a model predictive control framework to ensure online control with instant response for collision avoidance and robust vehicle coordination. The proposed algorithm is verified through numerical simulations of three different traffic scenarios. The convergence and accuracy of the proposed approach are demonstrated by comparing with a popular nonlinear solver. Furthermore, the benefit of the proposed method in both traffic mobility and fuel efficiency is validated using the speed profile determined from a traffic following model in a simulation software as the baseline.

42 ENGINEERING↗

Online Bagging and Boosting

Bagging and boosting are two of the most well-known ensemble learning methods due to their theoretical performance guarantees and strong experimental results. However, these algorithms have been used mainly in batch mode, i.e., they require the entire training set to be available at once and, in some cases, require random access to the data. In this paper, we present online versions of bagging and boosting that require only one pass through the training data. We build on previously presented work by presenting some theoretical results. We also compare the online and batch algorithms experimentally in terms of accuracy and running time.

Oza, Nikunji C.↗

Data reduction through optimized scalar quantization for more compact neural networks

Raw data generation for several existing and planned large physics experiments now exceeds TB/s rates, generating untenable data sets in very little time. Those data often demonstrate high dimensionality while containing limited information. Meanwhile, Machine Learning algorithms are now becoming an essential part of data processing and data analysis. Those algorithms can be used offline for post processing and post data analysis, or they can be used online for real time processing providing ultra low latency experiment monitoring. Both use cases would benefit from data throughput reduction while preserving relevant information: one by reducing the offline storage requirements by several orders of magnitude and the other by allowing ultra fast online inferencing with low complexity Machine Learning models. Moreover, reducing the data source throughput also reduces material cost, power and data management requirements. In this work we demonstrate optimized nonuniform scalar quantization for data source reduction. This data reduction allows lower dimensional representations while preserving the relevant information of the data, thus enabling high accuracy Tiny Machine Learning classifier models for online fast inferences. We demonstrate this approach with an initial proof of concept targeting the CookieBox, an array of electron spectrometers used for angular streaking, that was developed for LCLS-II as an online beam diagnostic tool. We used the Lloyd-Max algorithm with the CookieBox dataset to design an optimized nonuniform scalar quantizer. Optimized quantization lets us reduce input data volume by 69% with no significant impact on inference accuracy. When we tolerate a 2% loss on inference accuracy, we achieved 81% of input data reduction. Finally, the change from a 7-bit to a 3-bit input data quantization reduces our neural network size by 38%.

97 MATHEMATICS AND COMPUTING↗

Study of Heavy Flavor Mesons and Flavor-Tagged Jets with the CMS Detector

The goal of this research program is to implement heavy flavor meson triggers in heavy-ion collisions for the Compact Muon Solenoid (CMS) experiment at the Large Hadron Collider (LHC) at CERN, including algorithm design, timing studies, offline validation, and online performance monitoring. The physics analyses which can be achieved by data from these new triggers is to address one of the most important questions in the field: parton flavor dependence of jet-quenching for the understanding of the transport properties of the Quark-Gluon Plasma. This program will allow CMS to collect the highest statistics heavy flavor meson and jet data ever recorded in heavy-ion colliders. The program includes two objectives: (1) Build and maintain the heavy flavor meson and jet triggers for heavy-ion collisions and deploy the trigger algorithms for 2015-2018 PbPb and pPb run at the LHC; (2) Perform heavy flavor meson and jet physics analyses, which can be used to study the parton flavor dependence of jet quenching, to extract the elastic energy loss coefficient of the QGP, and to test whether massive quarks also participate in collective expansion dynamics in heavy-ion collisions. With the heavy flavor physics trigger developed in this project, a competitive heavy flavor physics program in heavy-ion collisions has been established in CMS. This program allows studies of the fully reconstructed and flavor identified charm, beauty, and exotic hadrons that cover the widest transverse momentum range. The novel measurements supported by the award provide new constraints on the size of the flavor dependence of parton energy loss, the value of the in-medium charm quark diffusion coefficient, the mechanism of charm and beauty quark hadronization, and provide new insights to the nature of the X(3872) hadron.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An application of generalized predictive control to rotorcraft terrain-following flight

Generalized predictive control (GPC) describes an algorithm for the control of dynamic systems in which a control input is generated which minimizes a quadratic cost function consisting of a weighted sum of errors between desired and predicted future system output and future predicted control increments. The output predictions are obtained from an internal model of the plant dynamics. The GPC algorithm is first applied to a simplified rotorcraft terrain-following problem, and GPC performance is compared to that of a conventional compensatory automatic system in terms of flight-path following, control activity, and control law implementation. Next, more realistic vehicle dynamics are utilized, and the GPC algorithm is applied to simultaneous terrain following and velocity control in the presence of atmospheric disturbances and errors in the internal model of the vehicle. The online computational and sensing requirements for implementing the GPC algorithm are minimal. Its use for manual control models appears promising.

Hess, Ronald A.↗

Online evolutionary neural architecture search for multivariate non-stationary time series forecasting

Time series forecasting (TSF) is one of the most important tasks in data science. TSF models are usually pre-trained with historical data and then applied on future unseen datapoints. However, real-world time series data is usually non-stationary and models trained offline usually face problems from data drift. Models trained and designed in an offline fashion can not quickly adapt to changes quickly or be deployed in real-time. To address these issues, this work presents the Online NeuroEvolution-based Neural Architecture Search (ONE-NAS) algorithm, which is a novel neural architecture search method capable of automatically designing and dynamically training recurrent neural networks (RNNs) for online forecasting tasks. Without any pre-training, ONE-NAS utilizes populations of RNNs that are continuously updated with new network structures and weights in response to new multivariate input data. ONE-NAS is tested on real-world, large-scale multivariate wind turbine data as well as the univariate Dow Jones Industrial Average (DJIA) dataset. These results demonstrate that ONE-NAS outperforms traditional statistical time series forecasting methods, including online linear regression, fixed long short-term memory (LSTM) and gated recurrent unit (GRU) models trained online, as well as state-of-the-art, online ARIMA strategies. Additionally, results show that utilizing multiple populations of RNNs which are periodically repopulated provide significant performance improvements, allowing this online neural network architecture design and training to be successful.

97 MATHEMATICS AND COMPUTING↗

Differentiable Preisach Modeling for Characterization and Optimization of Particle Accelerator Systems with Hysteresis

Future improvements in particle accelerator performance are predicated on increasingly accurate online modeling of accelerators. Hysteresis effects in magnetic, mechanical, and material components of accelerators are often neglected in online accelerator models used to inform control algorithms, even though reproducibility errors from systems exhibiting hysteresis are not negligible in high precision accelerators. Here, we combine the classical Preisach model of hysteresis with machine learning techniques to efficiently create nonparametric, high-fidelity models of arbitrary systems exhibiting hysteresis. We experimentally demonstrate how these methods can be used in situ, where a hysteresis model of an accelerator magnet is combined with a Bayesian statistical model of the beam response, allowing characterization of magnetic hysteresis solely from beam-based measurements. Finally, we explore how using these joint hysteresis-Bayesian statistical models allows us to overcome optimization performance limitations that arise when hysteresis effects are ignored.

43 PARTICLE ACCELERATORS↗

Identifying Climate Patterns Using Clustering Autoencoder Techniques

Abstract The complexity of growing spatiotemporal resolution of climate simulations produces a variety of climate patterns under different projection scenarios. This paper proposes a new data-driven climate classification workflow via an unsupervised deep learning technique that can dimensionally reduce the vast volume of spatiotemporal numerical climate projection data into a compact representation. We aim to identify distinct zones that capture multiple climate variables as well as their future changes under different climate change scenarios. Our approach leverages convolutional autoencoders combined with k -means clustering (standard autoencoder) and online clustering based on the Sinkhorn–Knopp algorithm (clustering autoencoder) across the conterminous United States (CONUS) to capture unique climate patterns in a data-driven fashion from the Geophysical Fluid Dynamics Laboratory Earth System Model with GOLD component (GFDL-ESM2G). The developed approach compresses 70 years of GFDL-ESM2G simulation at 0.125° spatial resolution across the CONUS under multiple warming scenarios to a lower-dimensional space by a factor of 660 000 and then tested on 150 years of GFDL-ESM2G simulation data. The results show that five climate clusters capture physically reasonable and spatially stable climatological patterns matched to known climate classes defined by human experts. Results also show that using a clustering autoencoder can reduce the computational time for clustering by up to 9.2 times when compared to using a standard autoencoder. Our five unique climate patterns resulting from the deep learning–based clustering of the lower-dimensional space thereby enable us to provide insights on hydrometeorology and its spatial heterogeneity across the conterminous United States immediately without downloading large climate datasets. Significance Statement This paper presents a data-driven climate classification approach using unsupervised deep learning to dimensionally reduce climate model outputs and to identify distinct climate regions for their future changes. Our approach compresses climate information for 70 years of Geophysical Fluid Dynamics Laboratory Earth System Model data across the conterminous United States (CONUS) at 0.125° spatial resolution. The results reveal that five climate clusters capture reasonable and stable climatological patterns matched to known climate patterns. The embedded clustering process in deep learning provides ×9.2 times faster execution than the k -means clustering technique. These results give us insight about climate spatial patterns and heterogeneity of hydrological patterns across the conterminous United States without downloading large climate datasets.

Kurihana, Takuya↗

Performance of the CMS high-level trigger during LHC Run 2

The CERN LHC provided proton and heavy ion collisions during its Run 2 operation period from 2015 to 2018. Proton-proton collisions reached a peak instantaneous luminosity of 2.1× 10 34 cm -2 s -1 , twice the initial design value, at √(s)=13 TeV. The CMS experiment records a subset of the collisions for further processing as part of its online selection of data for physics analyses, using a two-level trigger system: the Level-1 trigger, implemented in custom-designed electronics, and the high-level trigger, a streamlined version of the offline reconstruction software running on a large computer farm. This paper presents the performance of the CMS high-level trigger system during LHC Run 2 for physics objects, such as leptons, jets, and missing transverse momentum, which meet the broad needs of the CMS physics program and the challenge of the evolving LHC and detector conditions. Sophisticated algorithms that were originally used in offline reconstruction were deployed online. Highlights include a machine-learning b tagging algorithm and a reconstruction algorithm for tau leptons that decay hadronically.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Performance of the CMS high-level trigger during LHC Run 2

The CERN LHC provided proton and heavy ion collisions during its Run 2 operation period from 2015 to 2018. Proton-proton collisions reached a peak instantaneous luminosity of 2.1 $\times$ 10$^{34}$ cm$^{-2}$s$^{-1}$, twice the initial design value, at $\sqrt{s}$ = 13 TeV. The CMS experiment records a subset of the collisions for further processing as part of its online selection of data for physics analyses, using a two-level trigger system: the Level-1 trigger, implemented in custom-designed electronics, and the high-level trigger, a streamlined version of the offline reconstruction software running on a large computer farm. This paper presents the performance of the CMS high-level trigger system during LHC Run 2 for physics objects, such as leptons, jets, and missing transverse momentum, which meet the broad needs of the CMS physics program and the challenge of the evolving LHC and detector conditions. Sophisticated algorithms that were originally used in offline reconstruction were deployed online. Highlights include a machine-learning b tagging algorithm and a reconstruction algorithm for tau leptons that decay hadronically.

high energy physics↗

Actuator Grouping Optimization on Flexible Space Reflectors

With the rapid advances in deployable membrane and mesh antenna technologies, the feasibility of developing large, lightweight reflectors has greatly improved. In order to achieve the required surface accuracy, precision surface control is needed on these lightweight reflectors. For this study, an analytical model is shown which combines a flexible Kapton reflector with Polyvinylidene fluoride (PVDF) actuators for surface control. Surface errors are introduced that are similar to real world scenarios, and a least squares control algorithm is developed for surface control. Experimental results on a 2.4 meter reflector show that while the analytical reflector model is generally correct, due to idiosyncrasies in the reflector it cannot be used for online control. A new method called the En Mass Elimination algorithm is used to determine the optimal grouping of actuators when the number of actuators in the system exceeds the number of power supplies available.

en masse elimination (EME) algorithm↗

Charged particle tracking in real-time using a full-mesh data delivery architecture and associative memory techniques

We present a flexible and scalable approach to address the challenges of charged particle track reconstruction in real-time event filters (Level-1 triggers) in collider physics experiments. The method described here is based on a full-mesh architecture for data distribution and relies on the Associative Memory approach to implement a pattern recognition algorithm that quickly identifies and organizes hits associated to trajectories of particles originating from particle collisions. We describe a successful implementation of a demonstration system composed of several innovative hardware and algorithmic elements. The implementation of a full-size system relies on the assumption that an Associative Memory device with the sufficient pattern density becomes available in the future, either through a dedicated ASIC or a modern FPGA. We demonstrate excellent performance in terms of track reconstruction efficiency, purity, momentum resolution, and processing time measured with data from a simulated LHC-like tracking detector.

47 OTHER INSTRUMENTATION↗

PMU Data Quality and Sensor Health Monitoring

Phasor Measurement Units (PMUs) play a critical role in the evolution of the electric power industry by providing high-precision, real-time monitoring of essential power system metrics. However, effectively detecting abnormalities and critical events from PMU data is a complex task, complicated by intricate temporal patterns, a scarcity of labeled data for training algo- rithms, and constraints on online computational power. In this study, we apply TranAD, an innovative algorithm that combines transformer architectures with the refinement of adversarial learning, to both synthetic and real-world PMU datasets for developing a data quality and sensor online health monitoring platform for utilities. Our findings reveal that TranAD not only provides efficient detection and localization but also enhances the detail with which abnormalities are detected, marking a a significant step forward in the field of clean data acquisition processes for power system monitoring

deep neural network, machine learning (ML)↗

Spatial compression of Seasat SAR imagery

The results of a study of techniques for spatial compression of synthetic-aperture-radar (SAR) imagery are summarized. Emphasis is on image-data volume reduction for archive and online storage applications while preserving the image resolution and radiometric fidelity. A quantitative analysis of various techniques, including vector quantization (VQ) and adaptive discrete cosine transform (ADCT), is presented. Various factors such as compression ratio, algorithm complexity, and image quality are considered in determining the optimal algorithm. The compression system requirements are established for electronic access of an online archive system based on the results of a survey of the science community. The various algorithms are presented and their results evaluated considering the effects of speckle noise and the wide dynamic range inherent in SAR imagery. The conclusion is that although the ADCT produces the best signal-to-distortion-noise ratio for a given compression ratio, the two-level tree-searched VQ technique is preferred due to its simplicity of decoding and near-optimal performance.

Chang, C. Y.↗

Learning-Based Load Control to Support Resilient Networked Microgrid Operations

Microgrids have proven to be an effective option for increasing the resiliency of critical end-use loads during extreme events. Building on past operational experiences, some microgrid operators are examining the potential to network microgrids to further improve resiliency. However, the frequency deviations experienced on isolated microgrids during transient events, such as switching operations, step increases in load, and loss of generation, are significantly larger than those typically seen on bulk transmission systems. The larger frequency deviations can cause a loss of inverter-connected assets, resulting in a loss of power to critical end-use loads. This paper presents a method of mitigating the impact of transient events by engaging end-use loads using Grid-Friendly Appliance TM (GFA) controllers. An online, i.e., real-time, device-level algorithm is presented, which adjusts individual GFA controller frequency set-points based on the operational characteristics of each end-use load, and on the changing grid dynamic characteristics. The presented method improves the dynamic stability of the networked microgrid operations while minimizing the interruptions to end-use loads. The presented work is validated with dynamic simulations using a modified version of the IEEE 123-node test system with three microgrids, using the GridLAB-D TM simulation environment.

Radhakrishnan, Nikitha↗

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Validation of turbulence intensity as simulated by the Weather Research and Forecasting model off the US northeast coast

We report turbulence intensity (TI) is often used to quantify the strength of turbulence in wind energy applications and serves as the basis of standards in wind turbine design. Thus, accurately characterizing the spatiotemporal variability in TI should lead to improved predictions of power production. Nevertheless, turbulence measurements over the ocean are far less prevalent than over land due to challenges in instrumental deployment, maintenance, and operation. Atmospheric models such as mesoscale (weather prediction) and large-eddy simulation (LES) models are commonly used in the wind energy industry to assess the spatial variability of a given site. However, the TI derivation from atmospheric models has not been well examined. An algorithm is proposed in this study to realize online calculation of TI in the Weather Research and Forecasting (WRF) model. Simulated TI is divided into two components depending on scale, including sub-grid (parameterized based on turbulence kinetic energy (TKE)) and grid resolved. The sensitivity of sea surface temperature (SST) on simulated TI is also tested. An assessment is performed by using observations collected during a field campaign conducted from February to June 2020 near the Woods Hole Oceanographic Institution Martha's Vineyard Coastal Observatory. Results show that while simulated TKE is generally smaller than the lidar-observed value, wind speed bias is usually small. Overall, this leads to a slight underestimation in sub-grid-scale estimated TI. Improved SST representation subsequently reduces model biases in atmospheric stability as well as wind speed and sub-grid TI near the hub height. Large TI events in conjunction with mesoscale weather systems observed during the studied period pose a challenge to accurately estimating TI from models. Due to notable uncertainty in accurately simulating those events, this suggests summing up sub-grid and resolved TI may not be an ideal solution. Efforts in further improving skills in simulating mesoscale flow and cloud systems are necessary as the next steps.

17 WIND ENERGY↗

Software Tools to Support Research on Airport Departure Planning

A simple, portable and useful collection of software tools has been developed for the analysis of airport surface traffic. The tools are based on a flexible and robust traffic-flow model, and include calibration, validation and simulation functionality for this model. Several different interfaces have been developed to help promote usage of these tools, including a portable Matlab(TM) implementation of the basic algorithms; a web-based interface which provides online access to automated analyses of airport traffic based on a database of real-world operations data which covers over 250 U.S. airports over a 5-year period; and an interactive simulation-based tool currently in use as part of a college-level educational module. More advanced applications for airport departure traffic include taxi-time prediction and evaluation of "windowing" congestion control.

Carr, Francis↗