Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2307.07876 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909294310457344 |
|---|---|
| author | Tesch, Douglas Amado, Leonardo Rosa Meneguzzi, Felipe |
| author_facet | Tesch, Douglas Amado, Leonardo Rosa Meneguzzi, Felipe |
| contents | While recent work on online goal recognition efficiently infers goals under low observability, comparatively less work focuses on online goal recognition that works in both discrete and continuous domains. Online goal recognition approaches often rely on repeated calls to the planner at each new observation, incurring high computational costs. Recognizing goals online in continuous space quickly and reliably is critical for any trajectory planning problem since the real physical world is fast-moving, e.g. robot applications. We develop an efficient method for goal recognition that relies either on a single call to the planner for each possible goal in discrete domains or a simplified motion model that reduces the computational burden in continuous ones. The resulting approach performs the online component of recognition orders of magnitude faster than the current state of the art, making it the first online method effectively usable for robotics applications that require sub-second recognition. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_07876 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Real-time goal recognition using approximations in Euclidean space Tesch, Douglas Amado, Leonardo Rosa Meneguzzi, Felipe Artificial Intelligence While recent work on online goal recognition efficiently infers goals under low observability, comparatively less work focuses on online goal recognition that works in both discrete and continuous domains. Online goal recognition approaches often rely on repeated calls to the planner at each new observation, incurring high computational costs. Recognizing goals online in continuous space quickly and reliably is critical for any trajectory planning problem since the real physical world is fast-moving, e.g. robot applications. We develop an efficient method for goal recognition that relies either on a single call to the planner for each possible goal in discrete domains or a simplified motion model that reduces the computational burden in continuous ones. The resulting approach performs the online component of recognition orders of magnitude faster than the current state of the art, making it the first online method effectively usable for robotics applications that require sub-second recognition. |
| title | Real-time goal recognition using approximations in Euclidean space |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2307.07876 |