Abstract

Using data-driven methodology, we exploit the time series of relevant plasma parameters for a large set of disrupted and non-disrupted discharges from the DIII-D tokamak with the objective of developing a disruption classification algorithm. We focus on a subset of disruption predictors, most of which are dimensionless and/or machine-independent parameters such as the plasma internal inductance and the Greenwald density fraction , coming from both plasma diagnostics and equilibrium reconstructions. The utilization of dimensionless indicators will facilitate a more direct comparison between different tokamak devices.In order to eventually develop a robust disruption warning algorithm, we leverage Machine Learning techniques, and in particular, we choose the Random Forests algorithm to explore the DIII-D database. We show the results coming from both binary (disrupted/non-disrupted) and multiclass classification problems. In the latter, the time dependency is introduced through the definition of class labels on the basis of the elapsed time before the disruption (i.e., ‘far from a disruption’, ‘within 350 ms of disruption’, etc.). Depending on the formulation of the problem, overall disruption prediction accuracy up to 90% is demonstrated, approaching 97% when identifying a stable and a disruptive phase for disrupted discharges. The performances of the different Random Forest classifiers are discussed in terms of accuracy, by showing the percentages of successfully detected samples, together with the false positive and false negative rates.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.