Name
Abstract | ||
|---|---|---|
We consider the problem of performing inverse reinforcement learning when the trajectory of the agent being observed is partially occluded from view. Motivated by robotic scenarios in which limited sensor data is available to a learner, we treat the missing information as hidden variables and present an algorithm based on expectation-maximization to solve the non-linear, non-convex problem. Previous work in this area simply removed the occluded portions from consideration when computing feature expectations; in contrast our technique takes expectations over the missing values, enabling learning even in the presence of dynamic occlusion. We evaluate our new algorithm in a simulated reconnaissance scenario in which the visible portion of the state space varies. Finally, we show our approach enables apprenticeship learning by observing a human performing a sorting task in spite of key information missing from observations. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.5555/2936924.2937076 | AAMAS |
Field | DocType | Citations |
Computer science,Expectation–maximization algorithm,Apprenticeship learning,Sorting,Unsupervised learning,Artificial intelligence,Missing data,Hidden variable theory,State space,Machine learning,Learning classifier system | Conference | 4 |
PageRank | References | Authors |
0.43 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenneth Bogert | 1 | 18 | 3.89 |
| Jonathan Feng-Shun Lin | 2 | 27 | 4.07 |
| Prashant Doshi | 3 | 926 | 90.23 |
| Dana Kulic | 4 | 810 | 69.21 |