Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Learn a Prior for RHEA for Better Online Planning   Rolling Horizon Evolutionary Algorithms (RHEA) are a class of online planning
methods for real-time game playing; their performance is closely related to the
planning horizon and the search time allowed. In this paper, we propose to
learn a prior for RHEA in an offline manner by training a value network and a
policy network. The value network is used to reduce the planning horizon by
providing an estimation of future rewards, and the policy network is used to
initialize the population, which helps to narrow down the search scope. The
proposed algorithm, named prior-based RHEA (p-RHEA), trains policy and value
networks by performing planning and learning iteratively. In the planning
stage, the horizon-limited search assisted with the policy network and value
network is performed to improve the policies and collect training samples. In
the learning stage, the policy network and value network are trained with the
collected samples to learn better prior knowledge. Experimental results on
OpenAI Gym MuJoCo tasks show that the performance of the proposed p-RHEA is
significantly improved compared to that of RHEA.

18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
2
The categories of this paper are: math
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph