Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Exhaustive Geographic Search with Mobile Robots Along Space-Filling Curves
CRW '98 Proceedings of the First International Workshop on Collective Robotics
A realistic model of frequency-based multi-robot polyline patrolling
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Cooperative exploration in the electronic marketplace
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Physical search problems applying economic search models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Physical search problems with probabilistic knowledge
Artificial Intelligence
Join Me with the Weakest Partner, Please
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Evaluating the Applicability of Peer-Designed Agents in Mechanisms Evaluation
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Competitive Shopbots-Mediated Markets
ACM Transactions on Economics and Computation
Sequential multi-agent exploration for a common goal
Web Intelligence and Agent Systems
Evaluating the applicability of peer-designed agents for mechanism evaluation
Web Intelligence and Agent Systems
Hi-index | 0.00 |
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.