@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Gal A. Kaminka's publication pages at
@COMMENT http://www.cs.biu.ac.il/~galk/publications/
@InProceedings{qrasa09,
author = {Noa Agmon and Sarit Kraus and Gal A. Kaminka},
title = {Uncertainties in Adversarial Patrol},
booktitle = {Proceedings of the {IJCAI} 2009 workshop on Quantitative Risk Analysis for Security Applications ({QRASA})},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2009},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
  abstract = {In this paper, we study the problem of multi-robot perimeter patrol in adversarial environments, under uncertainty. In this problem, the robots patrol around a closed
area, where their goal is to  patrol in a way that maximizes their chances of detecting an adversary trying to penetrate into the area. Uncertainties may rise in diffe
rent aspects in this domain, and herein our focus is twofold. First, uncertainty in the robots' sensing capabilities, and second uncertainty of the adversary's knowled
ge of the patrol's weak points. Specifically, in the first part of the paper, we consider the case in which the robots have realistic, and thus imperfect, sensors. The
se cannot always detect the adversary, and their detection capability changes with their range. In the second part of the paper, we deal with different possible choice
s of penetration spots by the adversary, and find an optimal solution for the patrolling robots in each such case.
},
  wwwnote = {}, 
}