Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient Algorithms for Optimal Perimeter Guarding   We investigate the problem of optimally assigning a large number of robots
(or other types of autonomous agents) to guard the perimeters of closed 2D
regions, where the perimeter of each region to be guarded may contain multiple
disjoint polygonal chains. Each robot is responsible for guarding a subset of a
perimeter and any point on a perimeter must be guarded by some robot. In
allocating the robots, the main objective is to minimize the maximum 1D
distance to be covered by any robot along the boundary of the regions. For this
optimization problem which we call optimal perimeter guarding (OPG), thorough
structural analysis is performed, which is then exploited to develop fast exact
algorithms that run in guaranteed low polynomial time. In addition to formal
analysis and proofs, experimental evaluations and simulations are performed
that further validate the correctness and effectiveness of our algorithmic
results.

0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th