Variational Bayesian optimization for runtime risk-sensitive control

6Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

Abstract

We present a new Bayesian policy search algorithm suitable for problems with policy-dependent cost variance, a property present in many robot control tasks. We extend recent work on variational heteroscedastic Gaussian processes to the optimization case to achieve efficient minimization of very noisy cost signals. In contrast to most policy search algorithms, our method explicitly models the cost variance in regions of low expected cost and permits runtime adjustment of risk sensitivity without relearning. Our experiments with artificial systems and a real mobile manipulator demonstrate that flexible risk-sensitive policies can be learned in very few trials.

Cite

CITATION STYLE

APA

Kuindersma, S., Grupen, R., & Barto, A. (2013). Variational Bayesian optimization for runtime risk-sensitive control. In Robotics: Science and Systems (Vol. 8, pp. 201–208). MIT Press Journals. https://doi.org/10.15607/rss.2012.viii.026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free