Name
Abstract | ||
|---|---|---|
Robots can learn the right reward function by querying a human expert. Existing approaches attempt to choose questions where the robot is most uncertain about the human's response; however, they do not consider how easy it will be for the human to answer! In this paper we explore an information gain formulation for optimally selecting questions that naturally account for the human's ability to answer. Our approach identifies questions that optimize the trade-off between robot and human uncertainty, and determines when these questions become redundant or costly. Simulations and a user study show our method not only produces easy questions, but also ultimately results in faster reward learning. |
Year | Venue | DocType |
|---|---|---|
2019 | CoRL | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erdem Biyik | 1 | 7 | 6.35 |
| Palan Malayandi | 2 | 0 | 0.68 |
| Landolfi Nicholas C. | 3 | 0 | 0.34 |
| dylan p losey | 4 | 52 | 10.77 |
| Dorsa Sadigh | 5 | 175 | 26.40 |