arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.02303cs.ROcs.AIcs.LGstat.ML

A survey on policy search algorithms for learning robot controllers in a handful of trials

Inria(法国国家信息与自动化研究所);CNRS(法国国家科学研究中心);Université de Lorraine(洛林大学);LORIA(洛林计算机科学及其应用研究所);Research Centre on Interactive Media, Smart Systems and Emerging Technologies(互动媒体、智能系统与新兴技术研究中心);German Aerospace Center (DLR)(德国航空航天中心);Idiap Research Institute(Idiap研究所)

Konstantinos Chatzilygeroudis, Vassilis Vassiliades, Freek Stulp, Sylvain Calinon, Jean-Baptiste Mouret

英文摘要:

Most policy search algorithms require thousands of training episodes to find an effective policy, which is often infeasible with a physical robot. This survey article focuses on the extreme other end of the spectrum: how can a robot adapt with only a handful of trials (a dozen) and a few minutes? By analogy with the word "big-data", we refer to this challenge as "micro-data reinforcement learning". We show that a first strategy is to leverage prior knowledge on the policy structure (e.g., dynamic movement primitives), on the policy parameters (e.g., demonstrations), or on the dynamics (e.g., simulators). A second strategy is to create data-driven surrogate models of the expected reward (e.g., Bayesian optimization) or the dynamical model (e.g., model-based policy search), so that the policy optimizer queries the model instead of the real system. Overall, all successful micro-data algorithms combine these two strategies by varying the kind of model and prior knowledge. The current scientific challenges essentially revolve around scaling up to complex robots (e.g., humanoids), designing generic priors, and optimizing the computing time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑