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.
|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|
|Number of pages||9|
|Publication status||Published - 24 Jun 2018|
|MoE publication type||A4 Article in a conference publication|
|Event||International Conference on Automated Planning and Scheduling - Delft, Netherlands|
Duration: 24 Jun 2018 → 29 Jun 2018
Conference number: 28
|Name||Proceedings of the International Conference on Automated Planning and Scheduling|
|Conference||International Conference on Automated Planning and Scheduling|
|Period||24/06/2018 → 29/06/2018|
- partial observability
Rintanen, J., & Pandey, B. (2018). Planning for partial observability by SAT and graph constraints. In M. de Weerdt, S. Koenig, G. Röger, & M. Spaan (Eds.), Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (pp. 190-198). (Proceedings of the International Conference on Automated Planning and Scheduling). AAAI PRESS.