Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.14796 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910378029481984 |
|---|---|
| author | Coles, Andrew Karpas, Erez Lavrinenko, Andrey Ruml, Wheeler Shimony, Solomon Eyal Shperberg, Shahaf |
| author_facet | Coles, Andrew Karpas, Erez Lavrinenko, Andrey Ruml, Wheeler Shimony, Solomon Eyal Shperberg, Shahaf |
| contents | Standard temporal planning assumes that planning takes place offline and then execution starts at time 0. Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates. Situated temporal planning reflects a more realistic scenario where time passes during planning. However, in situated temporal planning a complete plan must be generated before any action is executed. In some problems with time pressure, timing is too tight to complete planning before the first action must be executed. For example, an autonomous car that has a truck backing towards it should probably move out of the way now and plan how to get to its destination later. In this paper, we propose a new problem setting: concurrent planning and execution, in which actions can be dispatched (executed) before planning terminates. Unlike previous work on planning and execution, we must handle wall clock deadlines that affect action applicability and goal achievement (as in situated planning) while also supporting dispatching actions before a complete plan has been found. We extend previous work on metareasoning for situated temporal planning to develop an algorithm for this new setting. Our empirical evaluation shows that when there is strong time pressure, our approach outperforms situated temporal planning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14796 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Planning and Acting While the Clock Ticks Coles, Andrew Karpas, Erez Lavrinenko, Andrey Ruml, Wheeler Shimony, Solomon Eyal Shperberg, Shahaf Artificial Intelligence Standard temporal planning assumes that planning takes place offline and then execution starts at time 0. Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates. Situated temporal planning reflects a more realistic scenario where time passes during planning. However, in situated temporal planning a complete plan must be generated before any action is executed. In some problems with time pressure, timing is too tight to complete planning before the first action must be executed. For example, an autonomous car that has a truck backing towards it should probably move out of the way now and plan how to get to its destination later. In this paper, we propose a new problem setting: concurrent planning and execution, in which actions can be dispatched (executed) before planning terminates. Unlike previous work on planning and execution, we must handle wall clock deadlines that affect action applicability and goal achievement (as in situated planning) while also supporting dispatching actions before a complete plan has been found. We extend previous work on metareasoning for situated temporal planning to develop an algorithm for this new setting. Our empirical evaluation shows that when there is strong time pressure, our approach outperforms situated temporal planning. |
| title | Planning and Acting While the Clock Ticks |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2403.14796 |