Multiscale Adaptive Search

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.

[1]  Izhak Rubin,et al.  A framework and analysis for cooperative search using UAV swarms , 2004, SAC '04.

[2]  E. S. Pearson,et al.  On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .

[3]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[4]  Marios M. Polycarpou,et al.  Balancing search and target response in cooperative unmanned aerial vehicle (UAV) teams , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  E. S. Pearson,et al.  On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .

[6]  Jiming Liu,et al.  Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP) , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  B. O. Koopman,et al.  Search and its Optimization , 1979 .

[8]  Thomas A. Wettergren,et al.  Robust Deployment of Dynamic Sensor Networks for Cooperative Track Detection , 2009, IEEE Sensors Journal.

[9]  Igor Mezic,et al.  Spectral Multiscale Coverage: A uniform coverage algorithm for mobile sensor networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[10]  R. J. Palmer,et al.  Guiding principles in controlling small automated vehicles , 1995, IEEE WESCANEX 95. Communications, Power, and Computing. Conference Proceedings.

[11]  Marios M. Polycarpou,et al.  Opportunistically cooperative neural learning in mobile agents , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[12]  João Pedro Hespanha,et al.  Cooperative graph-based model predictive search , 2007, 2007 46th IEEE Conference on Decision and Control.

[13]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[14]  I. Mezić,et al.  Metrics for ergodicity and design of ergodic dynamics for multi-agent systems , 2011 .

[15]  D. Blackwell.  Discrete Dynamic Programming , 1962 .

[16]  J R Frost,et al.  REVIEW OF SEARCH THEORY: ADVANCES AND APPLICATIONS TO SEARCH AND RESCUE DECISION SUPPORT: FINAL REPORT , 2001 .

[17]  Silvia Ferrari,et al.  A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks , 2008, IEEE Transactions on Computers.

[18]  Silvia Ferrari,et al.  Information-Driven Sensor Path Planning by Approximate Cell Decomposition , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[19]  Thomas A. Wettergren,et al.  Collaborative search planning for multiple vehicles in nonhomogeneous environments , 2009, OCEANS 2009.

[20]  Lingfeng Wang,et al.  Tracking with Distributed Sets of Proximity Sensors using Geometric Invariants , 2004 .

[21]  Nah-Oak Song,et al.  Discrete search with multiple sensors , 2004, Math. Methods Oper. Res..

[22]  R.L. Streit,et al.  Tracking with distributed sets of proximity sensors using geometric invariants , 2004, IEEE Transactions on Aerospace and Electronic Systems.

[23]  Jason M. Schwier,et al.  Markovian Search Games in Heterogeneous Spaces , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Rafael Fierro,et al.  A Geometric Optimization Approach to Detecting and Intercepting Dynamic Targets , 2007, 2007 American Control Conference.

[25]  Sung-Jin Cho,et al.  A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search , 2009, Eur. J. Oper. Res..

[26]  Peter A. Beling,et al.  Decentralized Bayesian Search Using Approximate Dynamic Programming Methods , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[27]  Joao P. Hespanha,et al.  Honey-pot constrained searching with local sensory information , 2006 .

[28]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[29]  L. Stone.  Theory of Optimal Search , 1975 .

[30]  David J. Marchette,et al.  Identification of Man-Made Regions in Unmanned Aerial Vehicle Imagery and Videos , 1998, IEEE Trans. Pattern Anal. Mach. Intell..