Planning for Partial Observability by SAT and Graph Constraints

Book One

Volume

Proceedings of the International Conference on Automated Planning and Scheduling, 28

Main Track

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.

10.1609/icaps.v28i1.13896