Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Target assignment for robotic networks: asymptotic performance under
  limited communication   We are given an equal number of mobile robotic agents, and distinct target
locations. Each agent has simple integrator dynamics, a limited communication
range, and knowledge of the position of every target. We address the problem of
designing a distributed algorithm that allows the group of agents to divide the
targets among themselves and, simultaneously, leads each agent to reach its
unique target. We do not require connectivity of the communication graph at any
time. We introduce a novel assignment-based algorithm with the following
features: initial assignments and robot motions follow a greedy rule, and
distributed refinements of the assignment exploit an implicit circular ordering
of the targets. We prove correctness of the algorithm, and give worst-case
asymptotic bounds on the time to complete the assignment as the environment
grows with the number of agents. We show that among a certain class of
distributed algorithms, our algorithm is asymptotically optimal. The analysis
utilizes results on the Euclidean traveling salesperson problem.

19
The categories of this paper are: eess
20
The categories of this paper are: acc-phys
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math
26
The categories of this paper are: bayes-an