@COMMENT This file was generated by bib2html.pl <http://www.cs.cmu.edu/~pfr/misc_software/index.html#bib2html> version 0.91
@COMMENT written by Patrick Riley <http://www.cs.cmu.edu/~pfr>
@COMMENT This file came from Gal A. Kaminka's publication pages at
@COMMENT http://www.cs.biu.ac.il/~galk/Publications/
@InProceedings{aamas11meytal,
author = {Meytal Traub and Gal A. Kaminka and Noa Agmon},
title = {Who Goes \emph{there}? Using Social Regret to Select a Robot to Reach a Goal },
booktitle = AAMAS-11,
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2011},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
abstract = {A common decision problem in multi-robot applications involves deciding on which 
robot, out of a group of $N$ robots, should travel to a goal location, to carry 
out a task there. Trivially,  this decision problem can be solved greedily, by selecting the robot 
with the shortest expected travel time. However, this ignores the 
inherent uncertainty in path traversal times; we may prefer a robot that is slower 
(but always takes the same time), over a robot that is expected to reach the goal 
faster, but on occasion takes a very long time to arrive. We make several contributions that address  
this challenge. First, we bring to bear economic decision-making theory, to 
distinguish between different selection policies, based on risk (risk averse, risk seeking, etc.). 
Second, we introduce \emph{social regret} (the difference between the actual travel time by the selected 
robot, and the hypothetical time of other robots) to augment decision-making 
in practice. Then, we carry out experiments in simulation and with real  
robots, to demonstrate the usefulness of the selection procedures under real-world settings, 
and find that travel-time distributions have repeating characteristics. },
  wwwnote = {}, 
}