Collaborative Multi Agent Physical Search with Probabilistic Knowledge

This paper considers the setting wherein a group of agents (e.g., robots) is seeking to obtain a given tangible good, potentially available at different locations in a physical environment. Traveling between locations, as well as acquiring the good at any given location consumes from the resources available to the agents (e.g., battery charge). The availability of the good at any given location, as well as the exact cost of acquiring the good at the location is not fully known in advance, and observed only upon physically arriving at the location. However, apriori probabilities on the availability and potential cost are provided. Given such as setting, the problem is to find a strategy/plan that maximizes the probability of acquiring the good while minimizing resource consumption. Sample applications include agents in exploration and patrol missions, e.g., rovers on Mars seeking to mine a specific mineral. Although this model captures many real world scenarios, it has not been investigated so far. We focus on the case where locations are aligned along a path, and study several variants of the problem, analyzing the effects of communication and coordination. For the case that agents can communicate, we present a polynomial algorithm that works for any fixed number of agents. For noncommunicating agents, we present a polynomial algorithm that is suitable for any number of agents. Finally, we analyze the difference between homogeneous and heterogeneous agents, both with respect to their allotted resources and with respect to their capabilities.

[1]  Joel W. Burdick,et al.  Multi-robot boundary coverage with plan revision , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[2]  L. Stone Search and Screening: General Principles with Historical Applications (B. O. Koopman) , 1981 .

[3]  D. Gibson,et al.  Redundancy , 1984 .

[4]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[5]  Jérôme Lang,et al.  Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.

[6]  Yehuda Elmaliach,et al.  A realistic model of frequency-based multi-robot polyline patrolling , 2008, AAMAS.

[7]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[8]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[9]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[10]  J. Dupacová,et al.  Scenario reduction in stochastic programming: An approach using probability metrics , 2000 .

[11]  Sarit Kraus,et al.  Physical Search Problems Applying Economic Search Models , 2008, AAAI.

[12]  Giorgio Ausiello,et al.  On Salesmen, Repairmen, Spiders, and Other Traveling Agents , 2000, CIAC.

[13]  P. Hudson Search Games , 1982 .

[14]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[15]  Steven Y. Goldsmith,et al.  Exhaustive Geographic Search with Mobile Robots Along Space-Filling Curves , 1998, CRW.

[16]  S. Hart,et al.  Handbook of Game Theory with Economic Applications , 1992 .

[17]  S. Lippman,et al.  THE ECONOMICS OF JOB SEARCH: A SURVEY* , 1976 .

[18]  Pascal Van Hentenryck,et al.  Constraint Programming in OPL , 1999, PPDP.

[19]  G. Kaminka,et al.  Frequency-Based Multi-Robot Fence Patrolling , 2008 .

[20]  Toby Walsh,et al.  Stochastic Constraint Programming , 2002, ECAI.

[21]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[22]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[23]  Thomas Schiex,et al.  Semi-ring based CSPs and valued CSPs: Basic properties and com-parison , 1996 .

[24]  Sarit Kraus,et al.  Cooperative Exploration in the Electronic Marketplace , 2005, AAAI.

[25]  Toniann Pitassi,et al.  Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.