New identification of induction machine parameters with a meta-heuristic algorithm based on least squares method

被引:1
|
作者
Zorig, Anwar [1 ]
Belkheiri, Ahmed [1 ]
Bendjedia, Bachir [2 ]
Kouzi, Katia [1 ]
Belkheiri, Mohammed [1 ]
机构
[1] Univ Amar Telidji Laghouat, Lab Telecommun Signals & Syst, Laghouat, Algeria
[2] Univ Amar Telidji Laghouat, LACoSERE Lab, Laghouat, Algeria
关键词
Induction machine; Meta-heuristic algorithms; Parameters identification; Least squares (LS); Salp swarm algorithm (SSA); SALP SWARM ALGORITHM; SYSTEMS;
D O I
10.1108/COMPEL-01-2023-0051
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
PurposeThe great value of offline identification of machine parameters is when the machine manufacturer does not provide its parameters. Most machine control strategies require parameter values, and some circumstances in the industrial sector only require offline identification. This paper aims to present a new offline method for estimating induction motor parameters based on least squares and a salp swarm algorithm (SSA).Design/methodology/approachThe central concept is to use the classic least squares (LS) method to acquire the majority of induction machine (IM) constant parameters, followed by the SSA method to obtain all parameters and minimize errors.FindingsThe obtained results showed that the LS method gives good results in simulation based on the assumption that the measurements are noise-free. However, unlike in simulations, the LS method is unable to accurately identify the machine's parameters during the experimental test. On the contrary, the SSA method proves higher efficiency and more precision for IM parameter estimation in both simulations and experimental tests.Originality/valueAfter performing a primary identification using the technique of least squares, the initial intention of this study was to apply the SSA for the purpose of identifying all of the machine's parameters and minimizing errors. These two approaches use the same measurement from a simple running test of an IM, and they offer a quick processing time. Therefore, this combined offline strategy provides a reliable model based on the identified parameters.
引用
收藏
页码:1852 / 1866
页数:15
相关论文
共 50 条
  • [1] Parameters Identification of Induction Motor for Electric Vehicle Based on Least Squares Method
    Liang, Zhang Jin
    Shan, Zhang Cun
    MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8, 2012, 383-390 : 648 - 653
  • [2] Shuffled shepherd optimization method: a new Meta-heuristic algorithm
    Kaveh, Ali
    Zaerreza, Ataollah
    ENGINEERING COMPUTATIONS, 2020, 37 (07) : 2357 - 2389
  • [3] Playground Algorithm as a New Meta-heuristic Optimization Algorithm
    Altwlkany, Kemal
    Konjicija, Samim
    2019 XXVII INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND AUTOMATION TECHNOLOGIES (ICAT 2019), 2019,
  • [4] Boxing Match Algorithm: a new meta-heuristic algorithm
    Tanhaeean, M.
    Tavakkoli-Moghaddam, R.
    Akbari, A. H.
    SOFT COMPUTING, 2022, 26 (24) : 13277 - 13299
  • [5] Boxing Match Algorithm: a new meta-heuristic algorithm
    M. Tanhaeean
    R. Tavakkoli-Moghaddam
    A. H. Akbari
    Soft Computing, 2022, 26 : 13277 - 13299
  • [6] Special forces algorithm: A new meta-heuristic algorithm
    Pan K.
    Zhang W.
    Wang Y.-G.
    Kongzhi yu Juece/Control and Decision, 2022, 37 (10): : 2497 - 2504
  • [7] Billiards-inspired optimization algorithm; a new meta-heuristic method
    Kaveh, A.
    Khanzadi, M.
    Moghaddam, M. Rastegar
    STRUCTURES, 2020, 27 : 1722 - 1739
  • [8] A new meta-heuristic optimizer: Pathfinder algorithm
    Yapici, Hamza
    Cetinkaya, Nurettin
    APPLIED SOFT COMPUTING, 2019, 78 : 545 - 568
  • [9] Intelligent accounting optimization method based on meta-heuristic algorithm and CNN
    Dong, Yanrui
    PEERJ COMPUTER SCIENCE, 2024, 10
  • [10] A new offloading method in the green mobile cloud computing based on a hybrid meta-heuristic algorithm
    Almadhor, Ahmad
    Alharbi, Abdullah
    Alshamrani, Ahmad M.
    Alosaimi, Wael
    Alyami, Hashem
    SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS, 2022, 36