Generalised Task Planning with First-Order Function Approximation
Generalised Task Planning with First-Order Function Approximation
复制标题
使用一阶函数逼近的广义任务规划
DOI:
--
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Ronald P. A. Petrick
中科院分区:
文献类型:
--
作者:
Jun Hao Alvin Ng;Ronald P. A. Petrick
: Real world robotics often operates in uncertain and dynamic environ-1 ments. Therefore, generalisation over different planning problems is of practical 2 interest. In the absence of a model, value-based reinforcement learning can be 3 used to learn a goal-directed policy. Typically, the interaction between robots and 4 the objects in the environment exhibit a first-order structure. We propose to use 5 first-order features to approximate the Q-function that generates a generalised pol-6 icy. Empirical results for a service robot domain show that our method of online 7 relational reinforcement learning is scalable to large-scale problems and enables 8 transfer learning across different problems and simulation environments with dis-9 similar transition dynamics. 10