@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/
@techreport{fence08yehuda,
 author = {Yehuda Elmaliach and Asaf Shiloni and Gal A. Kaminka},
 title = {Frequency-Based Multi-Robot Fence Patrolling},
 year = {2008},
 number = {MAVERICK 2008/01},
 institution = {Bar Ilan University, Computer Science Department, {MAVERICK} Group},
 abstract = {Patrolling---sometimes referred to as repeated coverage---is a task where points 
in a target work-area are repeatedly visited by robots. The patrolling algorithm can be optimized towards different performance criteria, such as frequency of point visits, minimization of travel time to arbitrary points of interest, etc.  Most existing work provides 
patrolling solutions for closed-polygon work-areas, in which a topologically-circular path is used to guarantee optimal performance. In contrast,
we focus in this paper on patrolling along an open polygon, e.g., a two-ended fence.
Here, there are inherent challenges to maintain uniformity of point visit frequencies,
and other performance criteria. We introduce two coordinated multi-robot fence-patrol techniques: The \emph{synchronized} and
\emph{synchronized-overlap} methods. We show that
in general, the synchronized approaches to multi-robot patrolling outperform the individual, unsynchronized methods. We then analyze the performance of the synchronized methods in depth, with respect to different performance goals, and investigate key trade-offs.  },
  wwwnote = {}, 
}