Maximizing mutual information for multipass target search in changing environments

Motion planning for multi-target autonomous search requires efficiently gathering as much information over an area as possible with an imperfect sensor. In disaster scenarios and contested environments the spatial connectivity may unexpectedly change (due to aftershock, avalanche, flood, building collapse, adversary movements, etc.) and the flight envelope may evolve as a known function of time to ensure rescue worker safety or to facilitate other mission goals. Algorithms designed to handle both expected and unexpected changes must: (1) reason over a sufficiently long time horizon to respect expected changes, and (2) replan quickly in response to unexpected changes. These ambitions are hindered by the submodularity property of mutual information, which makes optimal solutions NP-hard to compute. We present an algorithm for autonomous search in changing environments that uses a variety of techniques to improve both the speed and time horizon, including using e-admissible heuristics to speed up the search.

[1]  Vijay Kumar,et al.  A Multi-robot Control Policy for Information Gathering in the Presence of Unknown Hazards , 2011, ISRR.

[2]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[3]  Geoffrey A. Hollinger,et al.  Sampling-based robotic information gathering algorithms , 2014, Int. J. Robotics Res..

[4]  John W. Fisher,et al.  Performance Guarantees for Information Theoretic Active Inference , 2007, AISTATS.

[5]  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).

[6]  Larry R. Harris,et al.  The Heuristic Search under Conditions of Error , 1974, Artif. Intell..

[7]  Simon Lacroix,et al.  Multi-robot target detection and tracking: taxonomy and survey , 2016, Auton. Robots.

[8]  Joao P. Hespanha,et al.  E cient Computation of Dynamic Probabilistic Maps , 2002 .

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

[10]  Gaurav S. Sukhatme,et al.  Branch and bound for informative path planning , 2012, 2012 IEEE International Conference on Robotics and Automation.

[11]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

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

[13]  Debasish Ghose,et al.  Optimal uncertainty reduction search using the k-shortest path algorithm , 2003, Proceedings of the 2003 American Control Conference, 2003..

[14]  J. Karl Hedrick,et al.  Autonomous UAV path planning and estimation , 2009, IEEE Robotics & Automation Magazine.

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

[16]  Yanli Yang,et al.  Decentralized cooperative search by networked UAVs in an uncertain environment , 2004, Proceedings of the 2004 American Control Conference.

[17]  Vijay Kumar,et al.  Active Magnetic Anomaly Detection Using Multiple Micro Aerial Vehicles , 2016, IEEE Robotics and Automation Letters.

[18]  Hugh F. Durrant-Whyte,et al.  Recursive Bayesian search-and-tracking using coordinated uavs for lost targets , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

[20]  Youmin Zhang,et al.  Cooperative multi-vehicle search and coverage problem in uncertain environments , 2011, IEEE Conference on Decision and Control and European Control Conference.

[21]  J.P. How,et al.  Robust UAV Search for Environments with Imprecise Probability Maps , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[22]  Geoffrey A. Hollinger,et al.  Distributed Data Fusion for Multirobot Search , 2015, IEEE Transactions on Robotics.

[23]  Agathoniki Trigoni,et al.  Supporting Search and Rescue Operations with UAVs , 2010, 2010 International Conference on Emerging Security Technologies.

[24]  A. Shende,et al.  Toward a mission value for subsea search with bottom-type variability , 2012, 2012 Oceans.

[25]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[26]  Collin C. Lutz,et al.  Utility-based adaptive path planning for subsea search , 2015, OCEANS 2015 - MTS/IEEE Washington.

[27]  B. O. Koopman.  The Theory of Search. II. Target Detection , 1956 .

[28]  João Pedro Hespanha,et al.  Cooperative Search by UAV Teams: A Model Predictive Approach using Dynamic Graphs , 2011, IEEE Transactions on Aerospace and Electronic Systems.

[29]  Vijay Kumar,et al.  Autonomous Localization of an Unknown Number of Targets Without Data Association Using Teams of Mobile Sensors , 2015, IEEE Transactions on Automation Science and Engineering.

[30]  Mac Schwager,et al.  Decentralized, Adaptive Control for Coverage with Networked Robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[31]  Mac Schwager,et al.  Distributed robotic sensor networks: An information-theoretic approach , 2012, Int. J. Robotics Res..

[32]  Debasish Ghose,et al.  Negotiation schemes for multi-agent cooperative search , 2009 .

[33]  Bernhard Rinner,et al.  Information Exchange and Decision Making in Micro Aerial Vehicle Networks for Cooperative Search , 2015, IEEE Transactions on Control of Network Systems.

[34]  Geoffrey J. Gordon,et al.  Finding Approximate POMDP solutions Through Belief Compression , 2011, J. Artif. Intell. Res..