Abstract
Chatterjee et al. have recently shown the utility of SAT in solving a class of planning problems with partial observability. A core component of their logical formulation of planning is constraints expressing s-t-reachability in directed graphs. In this work, we show that the scalability of the approach can be dramatically improved by using dedicated graph constraints, and that a far broader class of important planning problems can be expressed in terms of s-t-reachability and acyclicity constraints.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) |
| Editors | Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs Spaan |
| Publisher | AAAI Press |
| Pages | 190-198 |
| Number of pages | 9 |
| ISBN (Electronic) | 978-1-57735-797-1 |
| Publication status | Published - 24 Jun 2018 |
| MoE publication type | A4 Conference publication |
| Event | International Conference on Automated Planning and Scheduling - Delft, Netherlands Duration: 24 Jun 2018 → 29 Jun 2018 Conference number: 28 |
Publication series
| Name | Proceedings of the International Conference on Automated Planning and Scheduling |
|---|---|
| Publisher | AAAI PRESS |
| ISSN (Electronic) | 2334-0843 |
Conference
| Conference | International Conference on Automated Planning and Scheduling |
|---|---|
| Abbreviated title | ICAPS |
| Country/Territory | Netherlands |
| City | Delft |
| Period | 24/06/2018 → 29/06/2018 |
Keywords
- SAT
- planning
- partial observability
- graphs
- constraints
- acyclicity
- reachability