Abstract
Recent approaches to goal recognition have progressively relaxed the requirements about the amount of domain knowledge and available observations, yielding accurate and efficient algorithms. These approaches, however, assume that there is a domain expert capable of building complete and correct domain knowledge to successfully recognize an agent’s goal. This is too strong for most real-world applications. LATREC applies modern goal recognition algorithms directly to real-world data (images) by building planning domain knowledge using an unsupervised learning algorithm that generates domain theories from raw images. We demonstrate this approach in an online simulation of simple games, such as the n-puzzle game.
Original language | English |
---|---|
Number of pages | 2 |
Publication status | Published - 13 Jul 2019 |
Event | 29th International Conference on Automated Planning and Scheduling - Berkeley, CA, United States Duration: 11 Jul 2019 → 15 Jul 2019 https://icaps19.icaps-conference.org/index.html |
Conference
Conference | 29th International Conference on Automated Planning and Scheduling |
---|---|
Abbreviated title | ICAPS2019 |
Country/Territory | United States |
City | Berkeley, CA |
Period | 11/07/19 → 15/07/19 |
Internet address |