Co-Design Dedicated System for Efficient Object Tracking Using Swarm Intelligence-Oriented Search Strategies

. 2023 Jun 25;23(13):5881. doi: 10.3390/s23135881

Algorithm 8 PSO main steps

$Define$ : $ω$ , $ϕ_{1}$ , $ϕ_{2}$ , $f (x)$ , M
$Initialize$ randomically the $N_{p}$ particles in the search space
$Initialize$ $P_{i_{b e s t}} = f (x_{i})$
$Initialize$ $S_{b e s t}$ as $G_{b} e s t = b e s t (P_{i_{b e s t}})$ or $L_{b e s t} = b e s t (P_{i_{b e s t_{n e i g h b o r s}}})$
t: = 1
while ( $t \leq N G_{m a x}$ ) and (solution not yet found) do
for each particle $x_{i}$ do
$Compute$ $v_{i} (t + 1) = ω \cdot v_{i} (t) + ϕ_{1} \cdot r_{1} \cdot (P_{i_{b e s t}} - x_{i} (t)) + ϕ_{2} \cdot r_{2} \cdot (S_{i_{b e s t}} - x_{i} (t))$
$Apply$ velocity control
$Compute$ new position $x_{i} (t + 1) = x_{i} (t) + v_{i} (t + 1)$
$Update$ $P_{i_{b e s t}}$ e $S_{b e s t}$
end for
$Obtain$ $S_{b e s t}$ among $P_{i_{b e s t}}$ for all particle i
t: = t + 1
end while
$Return$ the position of the best particle