Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.14224 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929474609610752 |
|---|---|
| author | Wilken, Nils Cohausz, Lea Bartelt, Christian Stuckenschmidt, Heiner |
| author_facet | Wilken, Nils Cohausz, Lea Bartelt, Christian Stuckenschmidt, Heiner |
| contents | We present a new approach to goal recognition that involves comparing observed facts with their expected probabilities. These probabilities depend on a specified goal g and initial state s0. Our method maps these probabilities and observed facts into a real vector space to compute heuristic values for potential goals. These values estimate the likelihood of a given goal being the true objective of the observed agent. As obtaining exact expected probabilities for observed facts in an observation sequence is often practically infeasible, we propose and empirically validate a method for approximating these probabilities. Our empirical results show that the proposed approach offers improved goal recognition precision compared to state-of-the-art techniques while reducing computational complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14224 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fact Probability Vector Based Goal Recognition Wilken, Nils Cohausz, Lea Bartelt, Christian Stuckenschmidt, Heiner Artificial Intelligence We present a new approach to goal recognition that involves comparing observed facts with their expected probabilities. These probabilities depend on a specified goal g and initial state s0. Our method maps these probabilities and observed facts into a real vector space to compute heuristic values for potential goals. These values estimate the likelihood of a given goal being the true objective of the observed agent. As obtaining exact expected probabilities for observed facts in an observation sequence is often practically infeasible, we propose and empirically validate a method for approximating these probabilities. Our empirical results show that the proposed approach offers improved goal recognition precision compared to state-of-the-art techniques while reducing computational complexity. |
| title | Fact Probability Vector Based Goal Recognition |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2408.14224 |