skip to main content
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Extremum seeking-based optimization of high voltage converter modulator rise-time

Abstract

We digitally implement an extremum seeking (ES) algorithm, which optimizes the rise time of the output voltage of a high voltage converter modulator (HVCM) at the Los Alamos Neutron Science Center (LANSCE) HVCM test stand by iteratively, simultaneously tuning the first 8 switching edges of each of the three phase drive waveforms (24 variables total). We achieve a 50 μs rise time, which is reduction in half compared to the 100 μs achieved at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory. Considering that HVCMs typically operate with an output voltage of 100 kV, with a 60Hz repetition rate, the 50 μs rise time reduction will result in very significant energy savings. The ES algorithm will prove successful, despite the noisy measurements and cost calculations, confirming the theoretical results that the algorithm is not affected by noise whose frequency components are independent of the perturbing frequencies.

Authors:
 [1];  [1];  [1];  [1]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1200618
Report Number(s):
LA-UR-12-22018
Journal ID: ISSN 1063-6536
Grant/Contract Number:  
AC52-06NA25396
Resource Type:
Accepted Manuscript
Journal Name:
IEEE Transactions on Control Systems Technology
Additional Journal Information:
Journal Volume: 22; Journal Issue: 1; Journal ID: ISSN 1063-6536
Publisher:
IEEE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; 43 PARTICLE ACCELERATORS; Accelerator Design, Technology, and Operations

Citation Formats

Scheinker, Alexander, Bland, Michael, Krstic, Miroslav, and Audia, Jeff. Extremum seeking-based optimization of high voltage converter modulator rise-time. United States: N. p., 2013. Web. doi:10.1109/TCST.2013.2240387.
Scheinker, Alexander, Bland, Michael, Krstic, Miroslav, & Audia, Jeff. Extremum seeking-based optimization of high voltage converter modulator rise-time. United States. doi:10.1109/TCST.2013.2240387.
Scheinker, Alexander, Bland, Michael, Krstic, Miroslav, and Audia, Jeff. Fri . "Extremum seeking-based optimization of high voltage converter modulator rise-time". United States. doi:10.1109/TCST.2013.2240387. https://www.osti.gov/servlets/purl/1200618.
@article{osti_1200618,
title = {Extremum seeking-based optimization of high voltage converter modulator rise-time},
author = {Scheinker, Alexander and Bland, Michael and Krstic, Miroslav and Audia, Jeff},
abstractNote = {We digitally implement an extremum seeking (ES) algorithm, which optimizes the rise time of the output voltage of a high voltage converter modulator (HVCM) at the Los Alamos Neutron Science Center (LANSCE) HVCM test stand by iteratively, simultaneously tuning the first 8 switching edges of each of the three phase drive waveforms (24 variables total). We achieve a 50 μs rise time, which is reduction in half compared to the 100 μs achieved at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory. Considering that HVCMs typically operate with an output voltage of 100 kV, with a 60Hz repetition rate, the 50 μs rise time reduction will result in very significant energy savings. The ES algorithm will prove successful, despite the noisy measurements and cost calculations, confirming the theoretical results that the algorithm is not affected by noise whose frequency components are independent of the perturbing frequencies.},
doi = {10.1109/TCST.2013.2240387},
journal = {IEEE Transactions on Control Systems Technology},
number = 1,
volume = 22,
place = {United States},
year = {2013},
month = {2}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Citation Metrics:
Cited by: 9 works
Citation information provided by
Web of Science

Save / Share: