Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929568474988544 |
|---|---|
| author | Acampora, Renato Della Monica, Dario Geatti, Luca Gigante, Nicola Montanari, Angelo Sala, Pietro |
| author_facet | Acampora, Renato Della Monica, Dario Geatti, Luca Gigante, Nicola Montanari, Angelo Sala, Pietro |
| contents | Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membership has been proved via reduction to the nonemptiness problem for nondeterministic finite automata. However, nondeterministic automata cannot be directly used to synthesize planning strategies as a costly determinization step is needed. In this paper, we identify a large fragment of qualitative timeline-based planning whose plan-existence problem can be directly mapped into the nonemptiness problem of deterministic finite automata, which can then be exploited to synthesize strategies. In addition, we identify a maximal subset of Allen's relations that fits into such a deterministic fragment.
|
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22757 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Synthesis of Timeline-Based Planning Strategies Avoiding Determinization Acampora, Renato Della Monica, Dario Geatti, Luca Gigante, Nicola Montanari, Angelo Sala, Pietro Formal Languages and Automata Theory Computational Complexity Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membership has been proved via reduction to the nonemptiness problem for nondeterministic finite automata. However, nondeterministic automata cannot be directly used to synthesize planning strategies as a costly determinization step is needed. In this paper, we identify a large fragment of qualitative timeline-based planning whose plan-existence problem can be directly mapped into the nonemptiness problem of deterministic finite automata, which can then be exploited to synthesize strategies. In addition, we identify a maximal subset of Allen's relations that fits into such a deterministic fragment. |
| title | Synthesis of Timeline-Based Planning Strategies Avoiding Determinization |
| topic | Formal Languages and Automata Theory Computational Complexity |
| url | https://arxiv.org/abs/2410.22757 |