Search NASA⌕ Search

SEARCH · Search NASA

Results for “online optimization”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Online Optimization for Networked Distributed Energy Resources With Time-Coupling Constraints

This paper proposes a Lyapunov optimization-based online distributed (LOOD) algorithmic framework for active distribution networks (ADNs) with numerous photovoltaic inverters and inverter air conditionings (IACs). In the proposed scheme, ADNs can track an active power setpoint reference at the substation in response to transmission-level requests while concurrently minimizing the social utility loss and ensuring the security of voltages. Conventional distributed optimization methods are rarely feasible to track the optimal solutions in fast variable environments using a fine-grained sampling interval where the underlying optimization problem evolves with the iterations of the algorithms. In contrast, based on the framework of online convex optimization (OCO), the developed approach uses a distributed algebraic update to compute the next round decisions relying on the current feedback of measurements. Notably, the time-coupling constraints of IACs are decoupled for online implementation with Lyapunov optimization technique. An incentive scheme is tailored to coordinate the customer-owned assets in lieu of the direct control from network operators. Optimality and convergency are characterized analytically. Finally, we corroborate the proposed method on a modified version of 33-node test feeder. Benchmark tests show that the proposed method is computationally and economically efficient, and outperforming existing algorithms.

active distribution networks↗
DOE OSTI2021

Online Optimization of NSLS-II Dynamic Aperture and Injection Transient (Facility Improvement Project)

The Facility Improvement Project (FIP) “Methods of online optimization of NSLS-II storage ring concurrent with user operations” proposed and approved in 2018 is now complete. The first goal is the online optimization of nonlinear beam dynamics to increase the beam lifetime and injection efficiency. We have developed a model-independent optimization technique using advanced algorithms. Using this technique, we increased the NSLS-II dynamic aperture by 20% and reduced the amplitude-dependent tune shift by a factor of two. We applied sextupole optimization to the new high-chromaticity lattice, which has been developed to improve the beam stability and to increase the single-bunch beam intensity. We were able to double the injection efficiency and exceed 90%. The second goal of this project is to provide the top-off injection with minimized perturbations of the beamline user operations. To achieve the transparent injection, we optimize the matching of four storage ring injection kickers reducing the perturbation of the stored beam orbit. The first application of the online optimization resulted in a reduction of the amplitude of residual beam oscillation by a factor of six, from 1300 μm down to 200 μm. Further improvement was limited by the timing jitter of the trigger boards. Then, we replaced all trigger boards with a new design and reduced the timing jitter by a factor of five, from 5 ns down to 1 ns. This upgrade resulted in the injection transient reduction from 200 μm to 120 μm. To optimize the full set of kicker parameters, including the trigger timing, amplitude, and pulse width, we upgraded all kicker power supplies with the capability of tunable waveform width. As a result, we have reduced the injection transient to the limit of 60 μm.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Autonomous online optimization of a closed-circuit reverse osmosis system

As freshwater becomes increasingly scarce, many industrial and municipal water utilities look at premise-scale water treatment and reuse to meet water demand. Closed-circuit reverse osmosis (CCRO) has been proposed as a promising process design to do so. This sequencing batch process enables operation at higher brine salinity levels by means of a recycle flow. Optimal operation requires that the maximum salinity level at the membrane surface represents an optimal trade-off between brine disposal costs and energy efficiency. This maximum salinity level may change over time as the feed water composition changes and electricity markets fluctuate. In this article, we present the results of the experimental evaluation of an automatic technique for continuous online optimization, known as extremum seeking control. This technique has a long history in the process control community but has received little traction so far in the water industry. We modify this technique to enable its use for online optimization of CCRO, specifically to account for its sequential batch operation. We challenge the optimization schemes through several experimental tests and illustrate the advantages and drawbacks of extremum-seeking control.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2019

Online Optimization as a Feedback Controller: Stability and Tracking

This paper develops and analyzes feedback-based online optimization methods to regulate the output of a linear time-invariant (LTI) dynamical system to the optimal solution of a time-varying convex optimization problem. The design of the algorithm is based on continuous-time primal-dual dynamics, properly modified to incorporate feedback from the LTI dynamical system, applied to a proximal augmented Lagrangian function. The resultant closed-loop algorithm tracks the solution of the time-varying optimization problem without requiring knowledge of (time-varying) disturbances in the dynamical system. The analysis leverages integral quadratic constraints to provide linear matrix inequality (LMI) conditions that guarantee global exponential stability and bounded tracking error. Analytical results show that, under a sufficient time-scale separation between the dynamics of the LTI dynamical system and the algorithm, the LMI conditions can be always satisfied. The paper further proposes a modified algorithm that can track an approximate solution trajectory of the constrained optimization problem under less restrictive assumptions. As an illustrative example, the proposed algorithms are showcased for power transmission systems, to compress the time scales between secondary and tertiary control, and allow to simultaneously power re-balancing and tracking of DC optimal power flow points.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

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↗
DOE OSTI2024

EBIS Beam Intensity Online Optimization with GPTune and Offline Analysis with XGBoost

The application of machine learning techniques to accelerator research has led to significant breakthroughs in optimization strategies. This paper presents a pioneering study using a novel machine learning algorithm, GPTune, to optimize beam intensity by adjusting parameters in the EBIS injection and extraction beam lines. Our research demonstrates substantial improvements, achieving a remarkable 22% and 70% increase in beam intensity at two separate measurement locations.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit

We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.

Chen, Xiaowei↗
DOE OSTI2020

Online accelerator optimization with a machine learning-based stochastic algorithm

Abstract Online optimization is critical for realizing the design performance of accelerators. Highly efficient stochastic optimization algorithms are needed for many online accelerator optimization problems in order to find the global optimum in the non-linear, coupled parameter space. In this study, we propose to use the multi-generation Gaussian process optimizer for online accelerator optimization and demonstrate that the algorithm is significantly more efficient than other stochastic algorithms that are commonly used in the accelerator community.

Zhang, Zhe (ORCID:0000000281430381)↗
DOE OSTI2020

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗
DOE OSTI2023

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Online Stochastic Optimization of Networked Distributed Energy Resources

Our work investigates distributed control and incentive mechanisms to coordinate distributed energy resources (DERs) with both continuous and discrete decision variables as well as device dynamics in distribution grids. We formulate a multi-period social welfare maximization problem, and based on its convex relaxation propose a distributed stochastic dual gradient algorithm for managing DERs. Moreover, we extend it to an online realtime setting with time-varying operating conditions, asynchronous updates by devices, and feedback being leveraged to account for nonlinear power flows as well as reduce communication overhead. The resulting algorithm provides a general online stochastic optimization algorithm for coordinating networked DERs with discrete power setpoints and dynamics to meet operational and economic objectives and constraints. We characterize the convergence of the algorithm analytically and evaluate its performance numerically.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

An Online Joint Optimization–Estimation Architecture for Distribution Networks

Here in this article, we propose an optimal joint optimization-estimation architecture for distribution networks, which jointly solves the optimal power flow (OPF) problem and static state estimation (SE) problem through an online gradient-based feedback algorithm. The main objective is to enable a fast and timely interaction between the OPF decisions and state estimators with limited sensor measurements. First, convergence and optimality of the proposed algorithm are analytically established. Then, the proposed gradient-based algorithm is modified by introducing statistical information of the inherent estimation and linearization errors for an improved and robust performance of the online OPF decisions. Overall, the proposed method eliminates the traditional separation of operation and monitoring, where optimization and estimation usually operate at distinct layers and different time scales. Hence, it enables a computationally affordable, efficient, and robust online operational framework for distribution networks under time-varying settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

A compact tunable quadrupole lens for brighter and sharper ultra-fast electron diffraction imaging

In this article, we report our proof-of-principle design and experimental commissioning of a broadly tunable and low-cost transverse focusing lens system for MeV-energy electron beams. The lens system based on electromagnetic (EM) quadrupoles has been built as a part of the existing instrument for ultra-fast electron diffraction (UED) experiments at the Accelerator Test Facility II (ATF-II) at Brookhaven National Laboratory (BNL). We experimentally demonstrated the independent control of the size and divergence of the beam with the charge ranging from 1 to 13 pC. The charge density and divergence of the beam at the sample are the most important factors determining the quality of the Bragg-diffraction image (BDI). By applying the Robust Conjugate Directional Search (RCDS) algorithm for online optimization of the quadrupoles, the transverse beam size can be kept constant down to 75 µm from 1 to 13 pC. The charge density is nearly two orders of magnitude higher than the previously achieved value using a conventional solenoid. Using the BDI method we were able to extract the divergence of the beam in real-time and apply it to the emittance measurement for the first time. Our results agree well with simulations and with the traditional quadrupole scan method. The real-time divergence measurement opens the possibility of online optimization of the beam divergence (< 0.2 mrad) at the sample with the increased beam charge. This optimization is crucial for the future development of single-shot ultra-fast electron microscope (UEM). Finally, we demonstrated BDI with significant improvement, up to 3 times higher peak intensity and 2 times sharper Bragg-diffraction peaks at 13 pC. The charge is now limited by the laser power and increasing charge may improve the quality of BDI further. The capability we demonstrated here provides us with opportunities for new sciences using near-parallel, bright and ultrafast electron beams for single-shot imaging, to directly visualize the dynamics of defects and nanostructured materials, or even record molecular movie, which are impossible using present electron-beam technologies.

43 PARTICLE ACCELERATORS↗