Searching for a Target Whose Truncated Brownian Motion

Abstract

This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finite are given. We show the existence of an optimal strategy which minimizes this first meeting time.