An optimal two-stages search plan for a random walk target motion in the plane Online publication date: Tue, 16-May-2017
by Mohamed Abd Allah El-Hadidy
International Journal of Mathematics in Operational Research (IJMOR), Vol. 10, No. 4, 2017
Abstract: This paper addresses the problem of searching for a moving target in the plane by a single autonomous sensor platform unmanned air vehicle (UAV). This sensor consists of a search team from two-searchers. The target moves in the plane with autocollimator linear motion (one-dimensional random walk) either for x-axis or y-axis. The search consists of two stages, the broad search and investigating search. In a broad search the sensor wishes to find the target's initial position, which is given by the value of the two independent random variables (X, Y ) and they have joint symmetric probability density function f(x, y). In an investigation search stage, the search team will be unmanned to detect the target on one of two real lines intersected at the target's initial position. It is desired to search in an optimal manner in each stage to minimise the expected value of the first meeting time between one of the searchers and the target, assuming circular normal distributed estimates of its initial position.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook