Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Clearing an Orthogonal Polygon Using Sliding Robots   In a multi-robot system, a number of autonomous robots would sense,
communicate, and decide to move within a given domain to achieve a common goal.
In this paper, we consider a new variant of the pursuit-evasion problem in
which the robots (pursuers) each move back and forth along an orthogonal line
segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a
sliding robot that moves along a line segment s, if there exists a point $q\in
s$ such that $\overline{pq}$ is a line segment perpendicular to $s$. In the
pursuit-evasion problem, a polygonal region is given and a robot called a
pursuer tries to find some mobile targets called evaders. The goal of this
problem is to design a motion strategy for the pursuer such that it can detect
all the evaders. We assume that $P$ includes unpredictable, moving evaders that
have unbounded speed. We propose a motion-planning algorithm for a group of
sliding robots, assuming that they move along the pre-located line segments
with a constant speed to detect all the evaders with unbounded speed.

21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
25
The categories of this paper are: patt-sol