Bayesian-Based Search Decision Framework and Search Strategy Analysis in Probabilistic Search

Algorithm 1

The searching process of the myopic strategy.

(1)	Initialize the belief map M
(2)	Initialization decision threshold B, B and time t = 0
(3)	Calculate the aggregate belief B(0)
(4)	while B < B(t) < B do
(5)	Calculate the cell ath+1 that should be detected at the next moment according to the myopic strategy
(6)	Check the cell ath and get detection result Da(t)
(7)	Update M based on Da(t)
(8)	Calculate B(t)
(9)	t = t + 1
(10)	end while
(11)	return Search result