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 5 BFOA main steps

$Define$ $f (x)$ , $N G_{m a x}$
$Define$ $N_{b}$ , $P_{e d}$ , $N_{e d}$ , $N_{r e p}$ , $N_{c h e m o}$ , $N_{s w}$ e $K_{s t e p}$
$Generate$ initial position $x_{i}$ of the $N_{b}$ bacteria
t: = 1
while ( $t \leq N G_{m a x}$ ) and (solution not yet found) do
for (l: = $1, \dots, N_{e d}$ ) do
for k: = $1, \dots, N_{r e p}$ do
for j: = $1, \dots, N_{c h e m o}$ do
$Compute$ $f (i, j, k, l)$ and $Compute$ em $f_{p r e v}$ with associated $m_{1}, m_{2}, m_{3}$
$Generate$ $m o v (i)$ of random values in $[- 1, 1]$
$Move$ bacteria using $f_{i, j + 1, k, l} (m_{1}, m_{2}, m_{3}) = f_{i, j, k, l} (m_{1}, m_{2}, m_{3}) + C (i) \cdot \frac{m o v (i)}{\sqrt{m o v^{T} (i) \cdot m o v (i)}}$
for s: = $1, \dots, N_{s w}$ do
$Move$ for $N_{s w}$ steps and generate $f_{d e v}$
end for
if $f_{d e v} > f_{p r e v}$ then
$Goback$ to positions $f_{d e v}$ for bacteria
for s: = $1, \dots, N_{s w}$ do
$Move$ for $N_{s w}$ steps
end for
end if
end for
$Reproduce$ using the best half of $N_{b}$ the bacteria
end for
$Eliminate$ $P_{e d}$ of the worst bacteria
$Generate$ the same fraction randomly
end for
t: = t + 1
end while
$Return$ best position