{"title":"非线性系统离散PID控制的最优整定","authors":"Robert Vrabel","doi":"10.1016/j.swevo.2025.102052","DOIUrl":null,"url":null,"abstract":"<div><div>This study investigates the application of piecewise affine approximation techniques for the control of nonlinear systems, focusing on the effective linearization of systems described by the <span><math><mi>k</mi></math></span>th order difference equation <span><math><mrow><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mi>k</mi><mo>]</mo></mrow><mo>+</mo><mi>f</mi><mrow><mo>(</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow><mo>,</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>]</mo></mrow><mo>,</mo><mo>…</mo><mo>,</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>]</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>u</mi><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow></math></span>. The proposed approach employs piecewise linearization by partitioning the nonlinear function <span><math><mi>f</mi></math></span> into simplices within a compact domain <span><math><mrow><mi>D</mi><mo>⊂</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>k</mi></mrow></msup></mrow></math></span>. The parameter <span><math><mi>h</mi></math></span>, which determines the number of linear segments, governs the precision of the approximation. As <span><math><mi>h</mi></math></span> increases, the linearized system’s behavior converges uniformly to that of the original nonlinear system, facilitating improved control system performance.</div><div>A key advantage of the approach is that it does not require full knowledge of the nonlinear function <span><math><mi>f</mi></math></span>; only values at selected nodal points are needed. Furthermore, it is sufficient that <span><math><mi>f</mi></math></span> is twice continuously differentiable within each subdomain of the partition. If bounds on the gradient and Hessian of <span><math><mi>f</mi></math></span> are available within each cell, the total approximation error can be rigorously estimated.</div><div>In addition, the study incorporates PID controllers and leverages the Particle Swarm Optimization (PSO) algorithm to optimize controller parameters. The optimization framework is designed to minimize key performance indices, such as the Integral Time Absolute Error (ITAE) and Integral Squared Overshoot (ISO). Numerical simulations demonstrate the efficacy of the proposed method, highlighting its ability to balance computational complexity with approximation accuracy in nonlinear control system design.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102052"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimum settings for discrete PID control of nonlinear systems\",\"authors\":\"Robert Vrabel\",\"doi\":\"10.1016/j.swevo.2025.102052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This study investigates the application of piecewise affine approximation techniques for the control of nonlinear systems, focusing on the effective linearization of systems described by the <span><math><mi>k</mi></math></span>th order difference equation <span><math><mrow><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mi>k</mi><mo>]</mo></mrow><mo>+</mo><mi>f</mi><mrow><mo>(</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow><mo>,</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>]</mo></mrow><mo>,</mo><mo>…</mo><mo>,</mo><mi>x</mi><mrow><mo>[</mo><mi>n</mi><mo>+</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>]</mo></mrow><mo>)</mo></mrow><mo>=</mo><mi>u</mi><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow></math></span>. The proposed approach employs piecewise linearization by partitioning the nonlinear function <span><math><mi>f</mi></math></span> into simplices within a compact domain <span><math><mrow><mi>D</mi><mo>⊂</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>k</mi></mrow></msup></mrow></math></span>. The parameter <span><math><mi>h</mi></math></span>, which determines the number of linear segments, governs the precision of the approximation. As <span><math><mi>h</mi></math></span> increases, the linearized system’s behavior converges uniformly to that of the original nonlinear system, facilitating improved control system performance.</div><div>A key advantage of the approach is that it does not require full knowledge of the nonlinear function <span><math><mi>f</mi></math></span>; only values at selected nodal points are needed. Furthermore, it is sufficient that <span><math><mi>f</mi></math></span> is twice continuously differentiable within each subdomain of the partition. If bounds on the gradient and Hessian of <span><math><mi>f</mi></math></span> are available within each cell, the total approximation error can be rigorously estimated.</div><div>In addition, the study incorporates PID controllers and leverages the Particle Swarm Optimization (PSO) algorithm to optimize controller parameters. The optimization framework is designed to minimize key performance indices, such as the Integral Time Absolute Error (ITAE) and Integral Squared Overshoot (ISO). Numerical simulations demonstrate the efficacy of the proposed method, highlighting its ability to balance computational complexity with approximation accuracy in nonlinear control system design.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102052\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S221065022500210X\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221065022500210X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Optimum settings for discrete PID control of nonlinear systems
This study investigates the application of piecewise affine approximation techniques for the control of nonlinear systems, focusing on the effective linearization of systems described by the th order difference equation . The proposed approach employs piecewise linearization by partitioning the nonlinear function into simplices within a compact domain . The parameter , which determines the number of linear segments, governs the precision of the approximation. As increases, the linearized system’s behavior converges uniformly to that of the original nonlinear system, facilitating improved control system performance.
A key advantage of the approach is that it does not require full knowledge of the nonlinear function ; only values at selected nodal points are needed. Furthermore, it is sufficient that is twice continuously differentiable within each subdomain of the partition. If bounds on the gradient and Hessian of are available within each cell, the total approximation error can be rigorously estimated.
In addition, the study incorporates PID controllers and leverages the Particle Swarm Optimization (PSO) algorithm to optimize controller parameters. The optimization framework is designed to minimize key performance indices, such as the Integral Time Absolute Error (ITAE) and Integral Squared Overshoot (ISO). Numerical simulations demonstrate the efficacy of the proposed method, highlighting its ability to balance computational complexity with approximation accuracy in nonlinear control system design.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.