By Topic

Multiscale Adaptive Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hubenko, A. ; Dept. of Mech. Eng., Univ. of California, Santa Barbara, CA, USA ; Fonoberov, V.A. ; Mathew, G. ; Mezic, I.

We present a continuous-space multiscale adaptive search (MAS) algorithm for single or multiple searchers that finds a stationary target in the presence of uncertainty in sensor diameter. The considered uncertainty simulates the influence of the changing environment and terrain as well as adversarial actions that can occur in practical applications. When available, information about the foliage areas and a priori distribution of the target position is included in the MAS algorithm. By adapting to various uncertainties, MAS algorithm reduces the median search time to find the target with a probability of detection of at least PD and a probability of false alarm of at most PFA. We prove that MAS algorithm discovers the target with the desired performance bounds PD and PFA. The unique features of the MAS algorithm are realistic second-order dynamics of the mobile sensors that guarantees uniform coverage of the surveyed area and a two-step Neyman-Pearson-based decision-making process. Computer simulations show that MAS algorithm performs significantly better than lawnmower-type search and billiard-type random search. Our tests suggest that the median search time in the MAS algorithm may be inversely proportional to the number of participating searchers. As opposed to lawnmower search, the median search time in the MAS algorithm depends only logarithmically on the magnitude of uncertainty.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:41 ,  Issue: 4 )