@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/
@MastersThesis{noam-msc, 
  author = {Noam Hazon}, 
  title = {Robust and Efficient Multi-Robot Coverage}, 
  school = 	 {{B}ar {I}lan {U}niversity}, 
  year = 	 {2005}, 
  OPTkey = 	 {}, 
  OPTtype = 	 {}, 
  OPTaddress = 	 {}, 
  OPTmonth = 	 {}, 
  OPTnote = 	 {}, 
   abstract = {
Area coverage is an important task for mobile robots, with many
real-world applications. Motivated by potential efficiency and
robustness improvements, there is growing interest in the use of
multiple robots in coverage. Previous investigations of
multi-robot coverage algorithms focused on the improved efficiency
gained from the use of multiple robots, but did not formally
addressed the potential for greater robustness. We address
robustness and efficiency in a family of multi-robot coverage
algorithms, based on spanning-tree coverage of approximate cell
decomposition. We present off-line and on-line algorithms and
analytically show that the algorithms are complete and robust, in
that as long as a single robot is able to move, the coverage will
be completed. We analyze the assumptions underlying the algorithms
requirements and present a number of techniques for executing it
in real robots. We show extensive empirical coverage-time results
of running the algorithms in a number of different environments
and several group sizes.
  }, 
  wwwnote = {}, 
 OPTannote = 	 {} 
}