Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 667 records · Page 37

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

Development of activity pencil beam algorithm using measured distribution data of positron emitter nuclei generated by proton irradiation of targets containing {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei in preparation of clinical application

Purpose: The purpose of this study is to develop a new calculation algorithm that is satisfactory in terms of the requirements for both accuracy and calculation time for a simulation of imaging of the proton-irradiated volume in a patient body in clinical proton therapy. Methods: The activity pencil beam algorithm (APB algorithm), which is a new technique to apply the pencil beam algorithm generally used for proton dose calculations in proton therapy to the calculation of activity distributions, was developed as a calculation algorithm of the activity distributions formed by positron emitter nuclei generated from target nuclear fragment reactions. In the APB algorithm, activity distributions are calculated using an activity pencil beam kernel. In addition, the activity pencil beam kernel is constructed using measured activity distributions in the depth direction and calculations in the lateral direction. {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei were determined as the major target nuclei that constitute a human body that are of relevance for calculation of activity distributions. In this study, ''virtual positron emitter nuclei'' was defined as the integral yield of various positron emitter nuclei generated from each target nucleus by target nuclear fragment reactions with irradiated proton beam. Compounds, namely, polyethylene, water (including some gelatin) and calcium oxide, which contain plenty of the target nuclei, were irradiated using a proton beam. In addition, depth activity distributions of virtual positron emitter nuclei generated in each compound from target nuclear fragment reactions were measured using a beam ON-LINE PET system mounted a rotating gantry port (BOLPs-RGp). The measured activity distributions depend on depth or, in other words, energy. The irradiated proton beam energies were 138, 179, and 223 MeV, and measurement time was about 5 h until the measured activity reached the background level. Furthermore, the activity pencil beam data were made using the activity pencil beam kernel, which was composed of the measured depth data and the lateral data including multiple Coulomb scattering approximated by the Gaussian function, and were used for calculating activity distributions. Results: The data of measured depth activity distributions for every target nucleus by proton beam energy were obtained using BOLPs-RGp. The form of the depth activity distribution was verified, and the data were made in consideration of the time-dependent change of the form. Time dependence of an activity distribution form could be represented by two half-lives. Gaussian form of the lateral distribution of the activity pencil beam kernel was decided by the effect of multiple Coulomb scattering. Thus, the data of activity pencil beam involving time dependence could be obtained in this study. Conclusions: The simulation of imaging of the proton-irradiated volume in a patient body using target nuclear fragment reactions was feasible with the developed APB algorithm taking time dependence into account. With the use of the APB algorithm, it was suggested that a system of simulation of activity distributions that has levels of both accuracy and calculation time appropriate for clinical use can be constructed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Flat and Level Analysis Tool (FLAT) for real-time automated segmentation and analysis of concrete slab point clouds

In the United States, the flatness and levelness of concrete floors during construction is traditionally specified by a maximum allowable gap under a 3 meter straightedge. However, the straightedge method is inexact and rarely representative of the entire floor since the technician is free to choose any location on the floor to perform the measurement. In cases requiring a higher degree of precision and repeatability, concrete floor flatness and levelness can be measured using the standard test method ASTM E1155. With the recent introduction of advanced surveying instruments such as robotic theodolites and terrestrial laser scanners (TLS), the means now exist to modernize and expedite the measurement of floor flatness and levelness. This paper details the development and demonstration of a digital tool, named the Flat and Level Analysis Tool (FLAT), to automate and expedite the segmentation and analysis of flatness and levelness from dense point cloud data of concrete floor slabs. Segmentation algorithms were developed using unsupervised machine learning to extract the set of points belonging to the concrete floor slab from a full 360 scan of a construction site. After segmentation, automated analysis algorithms report the results according to the standard method. The developed algorithms were demonstrated on a dense point cloud captured from a concrete slab-on-grade at a construction site. Results show that the digital tool can quickly provide estimates for floor flatness and levelness with minimal human involvement with comparable accuracy to manual methods.

Hayes, Nolan↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Model Predictive Control of HVAC Systems: Implementation and Testing at the University of California, Merced

A Model Predictive Control algorithm was developed for the UC Merced campus chilled water plant. Model predictive control (MPC) is an advanced control technology that has proven successful in the chemical process industry and other industries. The main goal of the research was to demonstrate the practical and commercial viability of MPC for optimization of building energy systems. The control algorithms were developed and implemented in MATLAB, allowing for rapid development, performance, and robustness assessment. The UC Merced chilled water plant includes three water-cooled chillers and a two million gallon chilled water storage tank. The tank is charged during the night to minimize on-peak electricity consumption and take advantage of the lower ambient wet bulb temperature. The control algorithms determined the optimal chilled water plant operation including chilled water supply (CHWS) temperature set-point, condenser water supply (CWS) temperature set-point and the charging start and stop times to minimize a cost function that includes energy consumption and peak electrical demand over a 3-day prediction horizon. A detailed model of the chilled water plant and simplified models of the buildings served by the plant were developed using the equation-based modeling language Modelica. Steady state models of the chillers, cooling towers and pumps were developed, based on manufacturers performance data, and calibrated using measured data collected and archived by the control system. A detailed dynamic model of the chilled water storage tank was also developed and calibrated. Simple, semi-empirical models were developed to predict the temperature and flow rate of the chilled water returning to the plant from the buildings. These models were then combined and simplified for use in a model predictive control algorithm that determines the optimal chiller start and stop times and set-points for the condenser water temperature and the chilled water supply temperature. The report describes the development and testing of the algorithm and evaluates the resulting performance, concluding with a discussion of next steps in further research. The experimental results show a small improvement in COP over the baseline policy but it is difficult to draw any strong conclusions about the energy savings potential for MPC with this system only four days of suitable experimental data were obtained once correct operation of the MPC system had been achieved. These data show an improvement in COP of 3.1% {+-} 2.2% relative to a baseline established immediately prior to the period when the MPC was run in its final form. This baseline includes control policy improvements that the plant operators learned by observing the earlier implementations of MPC, including increasing the temperature of the water supplied to the chiller condensers from the cooling towers. The process of data collection and model development, necessary for any MPC project, resulted in the team uncovering various problems with the chilled water system. Although it is difficult to quantify the energy savings resulting from these problems being remedied, they were likely on the same order as the energy savings from the MPC itself. Although the types of problems uncovered and the level of energy savings may differ significantly from other projects, some of the benefits of detecting and diagnosing problems are expected from the use of MPC for any chilled water plant. The degree of chiller loading was found to be a key factor for efficiency. It is more efficient to operate the chillers at or near full load. In order to maximize the chiller load, one would maximize the temperature difference across chillers and the chilled water flow rate through the chillers. Thus, the CHWS set-point and the chilled water flow-rate can be used to limit the chiller loading to prevent chiller surging. Since the flow rate has an upper bound and the CHWS set point has a lower bound, the chiller loading is constrained and often determined by the chilled water return temperature (CHWR). The CHWR temperature is primarily comprised of warm water from the top of the TES tank. The CHWR temperature falls substantially as the thermocline approaches the top of the tank, which reduces the chiller loading. As a result, it has been determined that overcharging the TES tank can be detrimental to the chilled water plant efficiency. The resulting MPC policy differs from the current practice of fully charging the TES tank. A heuristic rule could possible avoid this problem without using predictive control. Similarly, the COP improvements from the change in CWS set-point were largely captured by a static set-point change by the operators. Further research is required to determine how much of the MPC savings could be garnered through simplified rules (based on the MPC study), with and without prediction.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DSP Algorithms for Fission Fragment and Prompt Fission Neutron Spectroscopy

Digital signal processing (DSP) algorithms are in high demand for modern nuclear fission investigation due to importance of increase the accuracy of fissile nuclear data for new generation of nuclear power stations. DSP algorithms for fission fragment (FF) and prompt fission neutron (PFN) spectroscopy are described in the present work. The twin Frisch-grid ionization chamber (GTIC) is used to measure the kinetic energy-, mass- and angular distributions of the FF in the {sup 252}Cf(SF) reaction. Along with the neutron time-of-flight (TOF) measurement the correlation between neutron emission and FF mass and energy is investigated. The TOF is measured between common cathode of the GTIC and the neutron detector (ND) pulses. Waveform digitizers (WFD) having 12 bit amplitude resolution and 100 MHz sampling frequency are used for the detector pulse sampling. DSP algorithms are developed as recursive procedures to perform the signal processing, similar to those available in various nuclear electronics modules, such as constant fraction discriminator (CFD), pulse shape discriminator (PSD), peak-sensitive analogue-to-digital converter (pADC) and pulse shaping amplifier (PSA). To measure the angle between FF and the cathode plane normal to the GTIC a new algorithm is developed having advantage over the traditional analogue pulse processing schemes. Algorithms are tested by comparing the numerical simulation of the data analysis of the {sup 252}Cf(SF) reaction with data available from literature.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken into account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.

97 MATHEMATICS AND COMPUTING↗

Control and Size Energy Storage for Managing Energy balance of Variable Generation Resources

This paper presents control algorithms and sizing strategies for using energy storage to manage energy balance for variable generation resources. The control objective is to minimize the hourly generation imbalance between the actual and the scheduled generation of the wind farm. Three control algorithms are compared: tracking power imbalance, post-compensation, and pre-compensation. Measurement data from a wind farm located in South-central Washington State are used in the study. The results show that tracking power imbalance yields the best performance by keeping the hourly energy imbalances zero. However, the energy storage system (ESS) will be significantly oversized. Post-compensation reduces power rating of the ESS but the hourly imbalance may not be kept as zero when large and long-lasting energy imbalances occur. A linear regression forecasting algorithm is developed for the pre-compensation algorithm to pre-charge or pre-discharge the ESS based on predicted energy imbalances. The performance comparison shows that the pre-compensation method significantly reduces the size of the ESS while maintaining satisfactory performance.

ENERGY MANAGEMENT↗

Comparing Coordinated Garbage Collection Algorithms for Arrays of Solid-state Drives

Solid-State Drives (SSDs) offer significant performance improvements over hard disk drives (HDD) on a number of workloads. The frequency of garbage collection (GC) activity is directly correlated with the pattern, frequency, and volume of write requests, and scheduling of GC is controlled by logic internal to the SSD. SSDs can exhibit significant performance degradations when garbage collection (GC) conflicts with an ongoing I/O request stream. When using SSDs in a RAID array, the lack of coordination of the local GC processes amplifies these performance degradations. No RAID controller or SSD available today has the technology to overcome this limitation. In our previous work, we presented a Global Garbage Collection (GGC) mechanism to improve response times and reduce performance variability for a RAID array of SSDs. A coordination method is employed so that GCs in the array can run at the same time. The coordination can exhibit substantial performance improvement. In this paper, we explore various GC coordination algorithms. We develop reactive and proactive GC coordination algorithms and evaluate their I/O performance and block erase counts for various workloads. We show that a proactive GC coordination algorithm can improve the I/O response times by up to 9% further and increase the lifetime of SSDs by reducing the number of block erase counts by up to 79% compared to a reactive algorithm.

99 GENERAL AND MISCELLANEOUS↗

Ambient Synchrophasor Measurement Based System Inertia Estimation

This paper develops an algorithm to estimate the system inertia value based on ambient synchrophasor measurement. Informative features are extracted from ambient synchrophasor measurements for machine-learning-based inertia estimation. Besides ambient synchrophasor measurements of FNET/GridEye, other available data relevant to inertia (such as weather and system load data) are also used to improve the inertia estimation accuracy. Then a machine learning algorithm to estimate system inertia is developed. A test dataset including ambient synchrophasor data from FNET/GridEye measurements and the WECC system inertia data from NERC is used to evaluate the performance of the developed inertia estimation method. The average and maximum estimation errors of the developed inertia estimation method is lower than 5% and 10%, respectively. This accuracy is higher than reported accuracy values in existing literature.

CUI, YI↗

Dynamic model-based sensor network design algorithm for system efficiency maximization

Here, a dynamic model-based sensor network design (DMSND) algorithm has been developed for maximizing system efficiency for an estimator-based control system. The algorithm synthesizes the optimal sensor network in the face of disturbances or set point changes. Computational expense of the large-scale combinatorial optimization problem is significantly reduced by parallel computing and by using combination of three novel strategies: multi-rate sampling frequency, model order reduction, and use of an incumbent solution that enables early termination of evaluation of infeasible sensor sets. The developed algorithm is applied to an acid gas removal unit as part of an integrated gasification combined cycle power plant with carbon capture. Even though there are more than thousand process states and more than hundred candidate sensor locations, the optimal sensor network design problem for maximizing process efficiency could be solved within couple of hours for a given budget.

47 OTHER INSTRUMENTATION↗

Data fusion for a vision-aided radiological detection system: Calibration algorithm performance

In order to improve the ability to detect, locate, track and identify nuclear/radiological threats, the University of Florida nuclear detection community has teamed up with the 3D vision community to collaborate on a low cost data fusion system. The key is to develop an algorithm to fuse the data from multiple radiological and 3D vision sensors as one system. The system under development at the University of Florida is being assessed with various types of radiological detectors and widely available visual sensors. A series of experiments were devised utilizing two EJ-309 liquid organic scintillation detectors (one primary and one secondary), a Microsoft Kinect for Windows v2 sensor and a Velodyne HDL-32E High Definition LiDAR Sensor which is a highly sensitive vision sensor primarily used to generate data for self-driving cars. Each experiment consisted of 27 static measurements of a source arranged in a cube with three different distances in each dimension. The source used was Cf-252. The calibration algorithm developed is utilized to calibrate the relative 3D-location of the two different types of sensors without need to measure it by hand; thus, preventing operator manipulation and human errors. The algorithm can also account for the facility dependent deviation from ideal data fusion correlation. Use of the vision sensor to determine the location of a sensor would also limit the possible locations and it does not allow for room dependence (facility dependent deviation) to generate a detector pseudo-location to be used for data analysis later. Using manually measured source location data, our algorithm-predicted the offset detector location within an average of 20 cm calibration-difference to its actual location. Calibration-difference is the Euclidean distance from the algorithm predicted detector location to the measured detector location. The Kinect vision sensor data produced an average calibration-difference of 35 cm and the HDL-32E produced an average calibration-difference of 22 cm. Using NaI and He-3 detectors in place of the EJ-309, the calibration-difference was 52 cm for NaI and 75 cm for He-3. In conclusion, the algorithm is not detector dependent; however, from these results it was determined that detector dependent adjustments are required.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Decision Tree Based Machine Learning Algorithm for Rate Estimation

A subgraph isomorphic decision tree algorithm was developed for estimating chemical reaction rates. The algorithm essentially associates differences in rate estimation with differences in sub-structures on the reactant or reactants, and the tree splits reactions into groups with similar rates by identifying the substructural differences that affect rate estimation the most. The algorithm was trained on rates from the Reaction Mechanism Generator (RMG) database and compared with a much more traditional rate rule estimator based on the same data. Compared to the previous RMG rate rules, the prediction accuracy of the new algorithm, measured by median absolute error (MAE) factor, root mean squared error (RMSE) factor, and 2-sigma error factor, is consistently improved by a factor of two. Uncertainty estimation was also developed for the decision trees based on fitting a lognormal distribution to the leave-one-out errors at each node. Improvements in accuracy introduced by the algorithm should significantly reduce the amount of effort required to refine models and the need for additional quantum calculations and thus reduce the amount of time and cost required to create and refine biofuel models.

Johnson, Matthew S.↗

Retrievals of ice cloud microphysical properties of deep convective systems using radar measurements: Convective Cloud Microphysical Retrieval

This study presents new algorithms for retrieving ice cloud microphysical properties (ice water content (IWC) and median mass diameter (Dm)) for the stratiform and thick anvil regions of Deep Convective Systems (DCSs) using Next-Generation Radar (NEXRAD) reflectivity and recently developed empirical relationships from aircraft in situ measurements during the Midlatitude Continental Convective Clouds Experiment (MC3E). A classic DCS case on 20 May 2011 is used to compare the retrieved IWC profiles with other retrieval and cloud-resolving model simulations. The mean values of each retrieved and simulated IWC fall within one standard derivation of the other two. The statistical results from six selected cases during MC3E show that the aircraft in situ derived IWC and Dm are 0.47 ± 0.29 g m-3 and 2.02 ± 1.3 mm, while the mean values of retrievals have a positive bias of 0.16 g m-3 (34%) and a negative bias of 0.39 mm (19%). To validate the newly developed retrieval algorithms from this study, IWC and Dm are performed with other DCS cases during Bow Echo and Mesoscale Convective Vortex Experiment (BAMEX) field campaign using composite gridded NEXRAD reflectivity and compared with in situ IWC and Dm from aircraft. A total of 64 1-min collocated aircraft and radar samples are available for comparisons, and the averages of radar retrieved and aircraft in situ measured IWCs are 1.22 g m-3 and 1.26 g m-3 with a correlation of 0.5, and their averaged Dm values are 2.15 and 1.80 mm. These comparisons have shown that the retrieval algorithms 45 developed during MC3E can retrieve similar ice cloud microphysical properties of DCS to aircraft in situ measurements during BAMEX with median errors of ~40% and ~25% for IWC and Dm retrievals, respectively. This is indicating our retrieval algorithms are suitable for other midlatitude continental DCS ice clouds, especially at stratiform rain and thick anvil regions. In addition, based on the averaged IWC and Dm values during MC3E and BAMEX, the DCS IWC values over midlatitude are significantly different, while their Dm values are close to each other. On the other hand, these DCS IWC and Dm values are 1-2 orders of magnitude larger than those of single-layered cirrus clouds over midlatitudes.

Tian, Jingjing↗

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.

97 MATHEMATICS AND COMPUTING↗

Asynchronous and Distributed Tracking of Time-Varying Fixed Points

NREL researcher Andrey Bernstein discusses asynchronous and distributed tracking of time-varying fixed points as part of the Innovative Optimization and Control Methods for Highly Distributed Autonomous Systems workshop. NREL hosted the workshop to exchange ideas on state-of-the-art control and optimization strategies as well as get feedback on work being done at NREL.

97 MATHEMATICS AND COMPUTING↗