Research on improved sparrow search algorithm for PID controller parameter optimization
Name:
BPASTS_2023_71_6_3745.pdf
Size:
1.344Mb
Format:
PDF
Description:
Final Published Version
Affiliation
College of Science – Computer Science, University of ArizonaIssue Date
2023
Metadata
Show full item recordPublisher
Polska Akademia NaukCitation
Bull. Pol. Acad. Sci. Tech. Sci., vol. 71, no. 6, p. e147344, 2023Rights
© 2023 The Author(s). This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
PID controllers are crucial for industrial control because of their simple structure and good robustness. In order to further improve the accuracy of PID controllers, this paper proposes an improved sparrow search algorithm (ISSA) to prevent the problem of the algorithm being prone to falling into the local optimum at the late stage of iteration. Based on the standard sparrow search algorithm, the position update formula and the step size control parameter are optimized to help quickly jump out of the local, and to obtain the optimal solution in the whole domain. Finally, to verify the accuracy and stability of the improved algorithm, nine standard test functions are first simulated. Then, the PID parameter optimization tests are finished with the chilled water and battery charging systems, where the lifting load and applying perturbation are carried out. Both the simulation and test results show that ISSA improves the convergence speed and accuracy, and performs better in terms of stability. © 2023 Polish Academy of Sciences. All rights reserved.Note
Open access journalISSN
0239-7528Version
Final Published Versionae974a485f413a2113503eed53cd6c53
10.24425/bpasts.2023.147344
Scopus Count
Collections
Except where otherwise noted, this item's license is described as © 2023 The Author(s). This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)