Planning for Partial Observability by SAT and Graph Constraints
-
Published:2018-06-15
Issue:
Volume:28
Page:190-198
-
ISSN:2334-0843
-
Container-title:Proceedings of the International Conference on Automated Planning and Scheduling
-
language:
-
Short-container-title:ICAPS
Author:
Pandey Binda,Rintanen Jussi
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.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献