Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/58843
Title: Automatic beam loss threshold selection for LHC collimator alignment
Authors: Azzopardi, Gabriella
Valentino, Gianluca
Salvachua, Belen
Redaelli, Stefano
Muscat, Adrian
Keywords: Large Hadron Collider (France and Switzerland)
Collimators (Optical instrument)
Issue Date: 2019-10
Publisher: JACoW
Citation: Azzopardi, G., Valentino, G., Salvachua, B., Redaelli, S., & Muscat, A. (2019). AAutomatic beam loss threshold selection for LHC collimator alignment. 17th International Conference on Accelerator and Large Experimental Physics Control Systems (ICALEPCS’19), New York (NY), USA.
Abstract: The collimation system used in the Large Hadron Collider at CERN is positioned around the beam with a hierarchy that protects sensitive equipment from unavoidable beam losses. The collimator settings are determined using a beam-based alignment technique, where collimator jaws are moved towards the beam until the beam losses exceed a predefined threshold. This threshold needs to be updated dynamically, corresponding to the changes in the beam losses. The current method for aligning collimators is semi-automated requiring a collimation expert to monitor the loss signals and continuously select and update the threshold accordingly. The human element in this procedure is a major bottleneck for speeding up the alignment. This paper therefore proposes a method to fully automate this threshold selection. A data set was formed from previous alignment campaigns and analysed to define an algorithm that produced results consistent with the user selections. In over 90% of the cases the difference between the two was negligible and the algorithm presented in this study was used for collimator alignments throughout 2018.
URI: https://www.um.edu.mt/library/oar/handle/123456789/58843
Appears in Collections:Scholarly Works - FacICTCCE

Files in This Item:
File Description SizeFormat 
mopha010.pdf1.56 MBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.