Planning for partial observability by SAT and graph constraints

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Researchers

Research units

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.

Details

Original languageEnglish
Title of host publicationProceedings of the International Conference on Automated Planning and Scheduling (ICAPS)
EditorsMathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs Spaan
Publication statusPublished - 24 Jun 2018
MoE publication typeA4 Article in a conference publication
EventInternational Conference on Automated Planning and Scheduling - Delft, Netherlands
Duration: 24 Jun 201829 Jun 2018
Conference number: 28

Publication series

NameProceedings of the International Conference on Automated Planning and Scheduling
PublisherAAAI PRESS
ISSN (Electronic)2334-0843

Conference

ConferenceInternational Conference on Automated Planning and Scheduling
Abbreviated titleICAPS
CountryNetherlands
CityDelft
Period24/06/201829/06/2018

    Research areas

  • SAT, planning, partial observability, graphs, constraints, acyclicity, reachability

ID: 26845925