@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{iros13,
 author = {Roi Yehoshua and Noa Agmon and Gal A. Kaminka},
 title = {Towards Efficient Robot Adversarial Coverage},
 booktitle = IROS-13,
 OPTcrossref = {},
 OPTkey = {},
 OPTpages = {},
 year = {2013},
 OPTeditor = {},
 OPTvolume = {},
 OPTnumber = {},
 OPTseries = {},
 OPTaddress = {},
 OPTmonth = {},
 OPTorganization = {},
 OPTpublisher = {},
 OPTnote = {},
 OPTannote = {},
 OPTurl = {},
 OPTurldate = {},
 OPTlastchecked = {},
 OPTdoi = {},
 OPTisbn = {},
 OPTissn = {},
 OPTlocalfile = {},
 abstract = {
 This paper discusses the problem of generating efficient coverage paths for
 a mobile robot in an adversarial environment, where threats exist that might
 stop the robot. First, we formally define the problem of adversarial coverage,
 and present optimization criteria used for evaluation of coverage algorithms
 in adversarial environments. We then present a coverage area planning algorithm
 based on a map of the probable threats. The algorithm tries to minimize the total
 risk involved in covering the target area while taking into account coverage time
 constrains. The algorithm is based on incrementally extending the coverage path
 to the nearest safe cells while allowing the robot to repeat its steps. By
 allowing the robot to visit each cell in the target area more than once, the
 accumulated risk can be reduced at the expense of extending the coverage time.
 We show the effectiveness of this algorithm in extensive experiments.
},
  wwwnote = {},
 OPTkeywords = {},
}