A new deterministic PSO algorithm for real-time systems implemented on low-power devices

• Published in: Journal of computational and applied mathematics Vol. 429; p. 115225
• Main Authors: Długosz, Zofia, Rajewski, Michał, Długosz, Rafał, Talaśka, Tomasz, Pedrycz, Witold
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2023
• Subjects: CMOS technology; Deterministic approach; Hardware implementation; Low power circuits; Parallel computing; Particle swarm optimization algorithm; Hardware implementation; CMOS technology; Parallel computing; Deterministic approach; Low power circuits; Particle swarm optimization algorithm
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2023.115225

The paper presents a novel, deterministic particle swarm optimization (PSO) algorithm, facilitating its implementation in low-power application specific integrated circuits (ASIC) realized in CMOS technology. The PSO algorithms are commonly used in a variety of optimization problems. They allow to search for a global extreme in a selected fitness function, which is used for numerical modeling of specific optimized problems. The conventional version of the algorithm is relatively difficult to implement directly in hardware, especially when each particle is represented by a separate circuit working in parallel with other particles. In such a situation, each particle has to be equipped with its own copy of each function. One of the problems is, for example, an efficient realization of the random function block that provides for each particle some factors used in computing a cognitive and a social velocity components. In this paper we shows a novel way to work around this problem. In the proposed approach the random function does not need to be used. It has been replaced by a simple computationally deterministic mechanism, which at the level of the overall swarm allows for effective emulation of the former random mechanism. We proposed such simplifications that reduce the formulas describing the algorithm to only basic arithmetic and logic operations. Comprehensive investigations have shown that performance of the proposed approach is comparable with its original version or in may situations even better. The proposed algorithm was tested with numerous test functions (50 runs for each tested function), to verify its flexibility and adaptation abilities to different problems.