Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Distributed Algorithm for Gathering Many Fat Mobile Robots in the
  Plane   In this work we consider the problem of gathering autonomous robots in the
plane. In particular, we consider non-transparent unit-disc robots (i.e., fat)
in an asynchronous setting. Vision is the only mean of coordination. Using a
state-machine representation we formulate the gathering problem and develop a
distributed algorithm that solves the problem for any number of robots.
  The main idea behind our algorithm is for the robots to reach a configuration
in which all the following hold: (a) The robots' centers form a convex hull in
which all robots are on the convex, (b) Each robot can see all other robots,
and (c) The configuration is connected, that is, every robot touches another
robot and all robots together form a connected formation. We show that starting
from any initial configuration, the robots, making only local decisions and
coordinate by vision, eventually reach such a configuration and terminate,
yielding a solution to the gathering problem.

31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex