Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.09963 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910385391534080 |
|---|---|
| author | Cardellini, Matteo Giunchiglia, Enrico Maratea, Marco |
| author_facet | Cardellini, Matteo Giunchiglia, Enrico Maratea, Marco |
| contents | In this paper, we propose a novel approach for solving linear numeric planning problems, called Symbolic Pattern Planning. Given a planning problem $Π$, a bound $n$ and a pattern -- defined as an arbitrary sequence of actions -- we encode the problem of finding a plan for $Π$ with bound $n$ as a formula with fewer variables and/or clauses than the state-of-the-art rolled-up and relaxed-relaxed-$\exists$ encodings. More importantly, we prove that for any given bound, it is never the case that the latter two encodings allow finding a valid plan while ours does not. On the experimental side, we consider 6 other planning systems -- including the ones which participated in this year's International Planning Competition (IPC) -- and we show that our planner Patty has remarkably good comparative performances on this year's IPC problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_09963 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Symbolic Numeric Planning with Patterns Cardellini, Matteo Giunchiglia, Enrico Maratea, Marco Artificial Intelligence In this paper, we propose a novel approach for solving linear numeric planning problems, called Symbolic Pattern Planning. Given a planning problem $Π$, a bound $n$ and a pattern -- defined as an arbitrary sequence of actions -- we encode the problem of finding a plan for $Π$ with bound $n$ as a formula with fewer variables and/or clauses than the state-of-the-art rolled-up and relaxed-relaxed-$\exists$ encodings. More importantly, we prove that for any given bound, it is never the case that the latter two encodings allow finding a valid plan while ours does not. On the experimental side, we consider 6 other planning systems -- including the ones which participated in this year's International Planning Competition (IPC) -- and we show that our planner Patty has remarkably good comparative performances on this year's IPC problems. |
| title | Symbolic Numeric Planning with Patterns |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2312.09963 |