Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The
  Best Input Parameters For R* Algorithm Through Series Of Experiments   Path planning is typically considered in Artificial Intelligence as a graph
searching problem and R* is state-of-the-art algorithm tailored to solve it.
The algorithm decomposes given path finding task into the series of subtasks
each of which can be easily (in computational sense) solved by well-known
methods (such as A*). Parameterized random choice is used to perform the
decomposition and as a result R* performance largely depends on the choice of
its input parameters. In our work we formulate a range of assumptions
concerning possible upper and lower bounds of R* parameters, their
interdependency and their influence on R* performance. Then we evaluate these
assumptions by running a large number of experiments. As a result we formulate
a set of heuristic rules which can be used to initialize the values of R*
parameters in a way that leads to algorithm's best performance.

16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph