Moving target search optimization - A literature review

Abstract The path-constrained moving target search problem has been subject to research since 1979 and is still investigated due to its important application, namely: search missions. This review paper provides an overview of the two main research branches. We cover approaches for path-constrained searchers, as well as approaches for kinematics-constrained searchers such as aerial search platforms. Besides an extensive overview of the literature, an overview of properties that are typical for search optimization approaches is given. A tabular summary of the approaches and their properties is provided for easy comparison and efficient lookup of applicable methods. Finally, we identify a main research gap and propose a promising type of algorithm for efficiently solving moving target search optimization problems.

[1]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[2]  Hiroyuki Sato,et al.  Route optimization for multiple searchers , 2010 .

[3]  T. J. Stweart.  Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion , 1980 .

[4]  Nicholas R. Jennings,et al.  Decentralised Coordination of Unmanned Aerial Vehicles for Target Search using the Max-Sum Algorithm , 2010 .

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

[6]  Akira Ohsumi,et al.  Stochastic Control with Searching a Randomly Moving Target , 1984, 1984 American Control Conference.

[7]  José Antonio López Orozco,et al.  A multi-UAV minimum time search planner based on ACOR , 2017, GECCO.

[8]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[10]  James R. Riehl,et al.  A UAV routing and sensor control optimization algorithm for target search , 2007, SPIE Defense + Commercial Sensing.

[11]  François Laviolette,et al.  Constraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path Problem , 2012, CP.

[12]  Alan R. Washburn,et al.  Branch and bound methods for a search problem , 1998 .

[13]  Alan Washburn.  Search for a Moving Target: The FAB Algorithm , 1983, Oper. Res..

[14]  James N. Eagle,et al.  An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem , 1990, Oper. Res..

[15]  Luc Lamontagne,et al.  The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility , 2010, Canadian Conference on AI.

[16]  James N. Eagle.  The Optimal Search for a Moving Target When the Search Path Is Constrained , 1984, Oper. Res..

[17]  Luc Lamontagne,et al.  The optimal searcher path problem with a visibility criterion in discrete time and space , 2009, 2009 12th International Conference on Information Fusion.

[18]  Lawrence D. Stone,et al.  Search and Rescue Optimal Planning System , 2010, 2010 13th International Conference on Information Fusion.

[19]  James N. Eagle.  The Approximate Solution of a Simple Constrained Search Path Moving Target Problem Using Moving Horizon Policies. , 1984 .

[20]  Gamini Dissanayake,et al.  Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times , 2008, Eur. J. Oper. Res..

[21]  Jiang Wu,et al.  A cooperative approach to multiple UAVs searching for moving targets based on a hybrid of virtual force and receding horizon , 2012, IEEE 10th International Conference on Industrial Informatics.

[22]  Silja Meyer-Nieberg,et al.  Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations , 2017, J. Optim. Theory Appl..

[23]  Hugh F. Durrant-Whyte,et al.  Coordinated decentralized search for a lost target in a Bayesian world , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[24]  T. Stewart.  Optimizing search with positive information feedback , 1985 .

[25]  José Antonio López Orozco,et al.  A Real World Multi-UAV Evolutionary Planner for Minimum Time Target Detection , 2016, GECCO.

[26]  T. J. Stewart.  Search for a moving target when searcher motion is restricted , 1979, Comput. Oper. Res..

[27]  Tomonari Furukawa,et al.  Multi-vehicle Bayesian Search for Multiple Lost Targets , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[28]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[29]  James N. Eagle,et al.  Criteria and approximate methods for path‐constrained moving‐target search problems , 1995 .

[30]  Isaac Kaminer,et al.  Optimal Motion Planning for Searching for Uncertain Targets , 2014 .

[31]  Wei Xu,et al.  Simulation analysis of cooperative target search strategies for multiple UAVs , 2015, The 27th Chinese Control and Decision Conference (2015 CCDC).

[32]  Gonzalo Pajares,et al.  Minimum time search for lost targets using cross entropy optimization , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[33]  Scott Shorey Brown.  Optimal Search for a Moving Target in Discrete Time and Space with an Exponential Detection Function , 1980 .

[34]  Lihua Xie,et al.  Decentralized Multi-UAV Flight Autonomy for Moving Convoys Search and Track , 2017, IEEE Transactions on Control Systems Technology.

[35]  Isaac Kaminer,et al.  Search-Trajectory Optimization: Part II, Algorithms and Computations , 2015, Journal of Optimization Theory and Applications.

[36]  Johannes O. Royset,et al.  Optimal search for moving targets , 1980, Advances in Applied Probability.

[37]  Koji Iida,et al.  Optimal strategy of route and look for the path constrained search problem with reward criterion , 1997, Eur. J. Oper. Res..

[38]  Sung-Jin Cho,et al.  Optimal search-relocation trade-off in Markovian-target searching , 2009, Comput. Oper. Res..

[39]  Hugh F. Durrant-Whyte,et al.  Decentralized Bayesian negotiation for cooperative search , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[40]  Isaac Kaminer,et al.  Search-Trajectory Optimization: Part I, Formulation and Theory , 2016, J. Optim. Theory Appl..

[41]  Hugh F. Durrant-Whyte,et al.  Optimal Search for a Lost Target in a Bayesian World , 2003, FSR.

[42]  Hiroyuki Sato,et al.  Path optimization for the resource‐constrained searcher , 2010 .

[43]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[44]  James N. Eagle,et al.  Using multiple searchers in constrained‐path, moving‐target search problems , 1996 .

[45]  Stefan Pickl,et al.  Trajectory optimization under kinematical constraints for moving target search , 2017, Comput. Oper. Res..

[46]  Hugh F. Durrant-Whyte,et al.  The element-based method - theory and its application to bayesian search and tracking - , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[47]  Alan R. Washburn.  Branch and bound methods for search problems , 1995 .

[48]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[49]  J. R. Weisinger,et al.  A survey of the search theory literature , 1991 .

[50]  Lihua Xie,et al.  Vision-based multi-agent cooperative target search , 2012, 2012 12th International Conference on Control Automation Robotics & Vision (ICARCV).