Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Control Problem”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints

Modern wind plants are increasingly tasked with multiple performance objectives. In addition to designing plants that maximize power output and minimize the levelized cost of energy (LCOE), the design and operation of wind plants is increasingly influenced by challenges regarding grid integration of variable generation renewables. This places a growing emphasis on making wind plants more controllable and predictable. WindSE is a Reynolds-averaged Navier-Stokes (RANS) model designed around analytical gradient and adjoint methods, with the ability to capture terrain-induced effects, as shown in Figure 1. The recent addition of an unsteady solver with an actuator line method (ALM) and ongoing work to enable massively parallel optimizations gives it a unique niche to explore coupled plant-level controls and design problems. This code is an open source python package built on the FEniCS framework that utilizes fast, parallel PETSc solvers to model fluid flow throughout wind-farm scale domains. Two recent studies performed using WindSE demonstrate the capability to optimize under a wide variety of flow conditions and objective functions. In the first, we present an optimization focused on modifying the layout of a wind farm with a fixed number of turbines for maximum total power output [1]. This study highlights the ability to quickly perform simulations using the steady Navier-Stokes solver combined with rotors represented as actuator disks while also stressing the importance of capturing terrain-induced effects. Gradient-based optimization using the RANS equations is viable due to the inclusion of efficiently computed adjoint derivatives. We interpret the physical results of the optimal layout and also discuss the computational cost of scaling to larger problems. In the second study, we present the capabilities of the unsteady Navier-Stokes solver, where rotor-blade profiles represented by actuator lines are optimized to enhance wake steering effects and overall power production [2]. We quantify the wind plant performance gains obtained from this type of simultaneous control co-design optimization as compared to optimizing the blade design and yaw independently. Figure 2 shows the differences between a baseline two-turbine system and an optimized system where we fine-tune the blade chord profile. Results and challenges from each study are quickly summarized and used to motivate the current development efforts within WindSE. Current and future work is focused on enabling higher-resolution studies with more degrees of freedom through parallelization of both the simulation and optimization algorithms. We present benchmarking results to show that WindSE performs well in both weak- and strong-scaling tests and further demonstrate that the optimizer obtains the same convergence rates in both shared- and distributed-memory environments. Using larger wind farms, we can study deep-array effects within an optimization context, allowing the use of objective functions that have been previously unstudied. As an example, we present ongoing work on a blockage metric which characterizes the loss of available kinetic energy due to wake effects from multiple upstream turbines.

adjoint optimization↗
DOE OSTI2021

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗
DOE OSTI2022

Learning in continuous action space for developing high dimensional potential energy models

Reinforcement learning (RL) approaches that combine a tree search with deep learning have found remarkable success in searching exorbitantly large, albeit discrete action spaces, as in chess, Shogi and Go. Many real-world materials discovery and design applications, however, involve multi-dimensional search problems and learning domains that have continuous action spaces. Exploring high-dimensional potential energy models of materials is an example. Traditionally, these searches are time consuming (often several years for a single bulk system) and driven by human intuition and/or expertise and more recently by global/local optimization searches that have issues with convergence and/or do not scale well with the search dimensionality. Here, in a departure from discrete action and other gradient-based approaches, we introduce a RL strategy based on decision trees that incorporates modified rewards for improved exploration, efficient sampling during playouts and a “window scaling scheme" for enhanced exploitation, to enable efficient and scalable search for continuous action space problems. Using high-dimensional artificial landscapes and control RL problems, we successfully benchmark our approach against popular global optimization schemes and state of the art policy gradient methods, respectively. We demonstrate its efficacy to parameterize potential models (physics based and high-dimensional neural networks) for 54 different elemental systems across the periodic table as well as alloys. We analyze error trends across different elements in the latent space and trace their origin to elemental structural diversity and the smoothness of the element energy surface. Broadly, our RL strategy will be applicable to many other physical science problems involving search over continuous action spaces.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

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

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

Kasparian, Armen [Thomas Jefferson National Accele↗
DOE OSTI2024

A safe reinforcement learning algorithm for supervisory control of power plants

Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a promising solution for control tasks due to its ability to learn from trial-and-error interactions with the environment. It eliminates the need for explicitly modeling the environment’s dynamics, which is potentially inaccurate. However, the direct imposition of state constraints in power plant control raises challenges for standard RL methods. To address this, we propose a chance-constrained RL algorithm based on Proximal Policy Optimization for supervisory control. Our method employs Lagrangian relaxation to convert the constrained optimization problem into an unconstrained objective, where trainable Lagrange multipliers enforce the state constraints. In conclusion, our approach achieves the smallest distance of violation and violation rate in a load-follow maneuver for an advanced Nuclear Power Plant design.

constrained optimization↗
DOE OSTI2024

Control Co-Design Studies for a 22 MW Semisubmersible Floating Wind Turbine Platform

We present a control co-design software framework that can be used to optimize floating wind turbines and their controllers. Because this framework has many options for design variables, constraints, and merit figures, along with modeling fidelity levels, we seek to demonstrate best practices for using the tool while designing a floating platform for the new 22 MW offshore reference wind turbine developed within the International Energy Agency Wind Technology Commercialization Programme 55 on Reference Wind Turbines and Farms. During these studies, we evaluate the use of different simulation fidelity levels, the effect of using different load cases for controller tuning, and the difference between sequential and simultaneous control co-design solutions. Based on these efforts, we suggest using an algorithm that performs an initial search of the design space before optimization. We find that solving smaller optimization problems, in a sequential manner, leads to more reliable outcomes in fewer iterations than larger, simultaneous control co-design solutions. However a simultaneous CCD solution produces a platform with a 2% lower mass than the sequential CCD outcome.

17 WIND ENERGY↗
DOE OSTI2023

A Review of Distributed Secondary Control Architectures in Islanded-Inverter-Based Microgrids

The increasing energy demand, the shortage of energy resources, and the environmental challenges faced by conventional power-generation systems are some of the ongoing challenges faced by modern power systems. Therefore, many efforts have been made by the scientific community to develop comprehensive solutions to overcome these issues. For instance, current technological advances have allowed the integration of distributed generators into the power systems, promoting the use of microgrids to overcome these issues. However, the use of renewable distributed generators have introduced new challenges to the traditional control system schemes. To overcome these challenges, a hierarchical control approach has been proposed for distributed renewable sources. In other words, the control scheme have been divided into three hierarchical levels, primary, secondary, and tertiary, to overcome the new challenges present in modern power systems. Due to extensiveness of this topic, this overview is focused on secondary control systems, mainly for AC isolated microgrids. To improve the power quality of modern systems, several secondary control schemes have been proposed to overcome the well-known problem of frequency and voltage deviation. Some of these schemes have also introduced adequate active/reactive power sharing techniques to optimize the utilization of resources. Additionally, other secondary control schemes have also focused on reducing the communication load, to lower the network cost and adding robustness against communication problems. This article presents an insight of the different control techniques used to overcome power quality and communication problems. A comprehensive overview of distributed secondary control techniques for islanded microgrids is presented. In addition, the implementation of these techniques is explained in an orderly and sequential manner.

14 SOLAR ENERGY↗
DOE OSTI2021

A persistent adjoint method with dynamic time-scaling and an application to mass action kinetics

In this article, we consider an optimization problem where the objective function is evaluated at the fixed-point of a contraction mapping parameterized by a control variable, and optimization takes place over this control variable. Since the derivative of the fixed-point with respect to the parameter can usually not be evaluated exactly, an adjoint dynamical system can be used to estimate gradients. Using this estimation procedure, the optimization algorithm alternates between derivative estimation and an approximate gradient descent step. We analyze a variant of this approach involving dynamic time-scaling, where after each parameter update the adjoint system is iterated until a convergence threshold is passed. Here, we prove that, under certain conditions, the algorithm can find approximate stationary points of the objective function. We demonstrate the approach in the settings of an inverse problem in chemical kinetics, and learning in attractor networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

POINT: Partially Observable Imitation Network for Traffic Signal Control

Smart traffic signals bring together transportation infrastructure and advance technologies to improve the mobility and efficiency of urban transportation network. Adaptive traffic signal control studies can be categorized into modeling-based approaches and learning-based approaches. In order to take advantages of these two systems, this study developed an offline-online combined Partial Observable Imitation Network for Traffic signal control (POINT). In the offline system, the traffic signal timing optimization problem was formulated as a Mixed Integer Nonlinear Programming (MINLP) given complete traffic information, i.e., second-by-second speeds and locations of all vehicles. Furthermore, the objective of MINLP is to minimize total travel delays considering individual vehicle trajectories under Connected Vehicle (CV) environment. The calculated optimal solutions under various traffic conditions were considered as the ”expert” decisions. In the online system, an imitation neural network model was developed to learn the ”expert” signal plans generated from offline system. Given partial observable traffic conditions in real time, e.g., the aggregate-level of traffic volume, the POINT model can compute the signal timing parameters in the online system. The numerical results demonstrated that the proposed method outperformed other state-of-the-art signal control method under high and unbalanced traffic demand levels in terms of reducing travel delays and queue length.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Adaptive Time Step Control for Multirate Infinitesimal Methods

Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Development of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an Integrated Energy System (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. A new RAVEN (Risk Analysis Virtual ENvironment) plugin for grid and capacity optimization (HERON) has been developed for optimizing the production variables of the IES given the demand profile. Currently, only the limits that affect the production variables and their corresponding time rates of change are considered (explicit constraints). However, other variables are additionally subject to constraints, but the associated limits are not accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response effects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. The Reference Governor (RG) algorithm is traditionally used for enforcing state and control constraints by modifying the set-point trajectories supplied to the feedback regulators. In our application, the RG is coupled within an iterative loop with the HERON-power dispatcher to generate optimal trajectories that ensure the operational constraints are met. A data-driven procedure to derive a representation of the dynamics of the controlled system was developed. First, the variables that represented the state of the system are selected (PCA-based approach), and then state-space representation matrices are derived from the collected measurements (DMDc algorithm). A preliminary version of the developed workflow based on Linear Time Invariant matrices was assessed by adopting a two-unit test case. More sophisticated versions of this workflow foreseeing the on-line derivation of system matrices will be deployed in FY 2021. Finally, a “plug-and-play” library of controllers and state observers was developed in Dymola. Some aspects of the current configuration of the IES unit components, e.g., the encapsulation of the control schemes into dedicated blocks, are consistent with the “plug-and-play” philosophy. Other features, e.g., the system buses collecting the input and the output variables, are not. For this reason, once listed and described the limits of the current configuration, necessary modifications to the plant model interface are presented. As a test-case, the interfaces of the SES model in the RAVEN-based HYBRID framework were reworked accordingly, and two different control schemes were applied to the same plant model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Minimum feature size control in level set topology optimization via density fields

A level set topology optimization approach that uses an auxiliary density field to nucleate holes during the optimization process and achieves minimum feature size control in optimized designs is explored. The level set field determines the solid-void interface and the density field describes the distribution of a fictitious porous material using the solid isotropic material with penalization. These fields are governed by two sets of independent optimization variables which are initially coupled using a penalty for hole nucleation. The strength of the density field penalization and projection is gradually increased during the optimization process to promote a 0-1 density distribution. In addition, a second penalty regulates the evolution of the density field in the void phase. The treatment of the density field combined with the second penalty mitigate the appearance of small design features. The minimum feature size of optimized designs is controlled by the radius of the linear filter applied to the density optimization variables. The structural response is predicted by the extended finite element method, the sensitivities by the adjoint method, and the optimization variables are updated by a gradient-based optimization algorithm. Numerical examples investigate the robustness of this approach with respect to algorithmic parameters and mesh refinement. The results show the applicability of the combined density level set topology optimization approach for both optimal hole nucleation and for minimum feature size control in 2D and 3D. This comes, however, at the cost of a more complex problem formulation and additional computational cost due to an increased number of optimization variables.

42 ENGINEERING↗
DOE OSTI2023

Enabling control co-design of the next generation of wind power plants

Abstract. Layout design and wake steering through wind plant control are important and complex components in the design and operation of modern wind power plants. They are currently optimized separately, but with more and more computational and experimental studies demonstrating the gains possible through wake steering, there is a growing need from industry and regulating bodies to combine the layout and control optimization in a co-design process. However, combining these two optimization problems is currently infeasible due to the excessive number of design variables and large solution space. In this article, we present a method that enables the coupled optimization of wind power plant layout and wake steering with no additional computational expense than a traditional layout optimization. We developed a geometric relationship between wind turbines to find an approximate optimal yaw angle, bypassing the need for either a nested or coupled wind plant control optimization. It also provides a significant and immediate improvement to wind power plant design by enabling the co-design of turbine layout and yaw control for wake steering. A small co-designed plant shown in this article produces 0.8 % more energy than its sequentially designed counterpart. This additional energy production comes with no additional infrastructure, turbine hardware, or control software; it is simply the outcome of optimizing the turbine layout and yaw control together, resulting in millions of dollars of additional revenue for the wind power plants of the future.

17 WIND ENERGY↗
DOE OSTI2022

Diagnosing Barren Plateaus with Tools from Quantum Optimal Control

Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes. Such ansatzes include the Quantum Alternating Operator Ansatz (QAOA), the Hamiltonian Variational Ansatz (HVA), and others. With our framework, we prove that avoiding barren plateaus for these ansatzes is not always guaranteed. Specifically, we show that the gradient scaling of the VQA depends on the degree of controllability of the system, and hence can be diagnosed through the dynamical Lie algebra $\mathfrak{g}$ obtained from the generators of the ansatz. We analyze the existence of barren plateaus in QAOA and HVA ansatzes, and we highlight the role of the input state, as different initial states can lead to the presence or absence of barren plateaus. Taken together, our results provide a framework for trainability-aware ansatz design strategies that do not come at the cost of extra quantum resources. Moreover, we prove no-go results for obtaining ground states with variational ansatzes for controllable system such as spin glasses. Our work establishes a link between the existence of barren plateaus and the scaling of the dimension of $\mathfrak{g}$.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Robust cooperative control strategy for a platoon of connected and autonomous vehicles against sensor errors and control errors simultaneously in a real-world driving environment

In a real-world driving environment, a platoon of connected and autonomous vehicles (CAVs) is subject to many internal and external disturbances, resulting in uncertain vehicle dynamics. In general, the disturbances can be categorized into two types: disturbances due to vehicle sensor errors (e.g., GPS error) and disturbances due to vehicle control errors (e.g., actuator delay). In the literature, many control strategies have been proposed to improve the robustness of the CAV platoon against uncertain vehicle dynamics induced by these disturbances. However, most of these strategies only consider one type of disturbance and cannot tackle both types of disturbances simultaneously. Furthermore, they are designed to maximize the benefits of each vehicle in the platoon independently, which can deteriorate the performance of the platoon. Here, to address these problems, this study proposes a robust cooperative control (RCC) strategy to maneuver the vehicles in the platoon cooperatively to counteract the impacts of both types of disturbances. The RCC strategy is developed based on a minimax problem, where the maximization subproblem seeks to find the worst inputs for the uncertainty terms in the vehicle dynamics equation to minimize the platoon performance, while the minimization subproblem seeks to find the optimal control decisions for all subsequent vehicles to maximize the platoon performance in the worst case. To solve the minimax problem, this study proposes a globally convergent solution algorithm. It can solve the minimax problem very efficiently to enable real time deployment of the RCC strategy. Numerical application indicates that compared to the existing methods, the RCC strategy can dramatically improve the robustness of the CAV platoon against the uncertain vehicle dynamics induced by both vehicle state detection errors and vehicle control errors. Therefore, it can maneuver the CAV platoon safely and efficiently in a real-world driving environment.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗