Planning for partial observability by SAT and graph constraints

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Standard

Planning for partial observability by SAT and graph constraints. / Rintanen, Jussi; Pandey, Binda.

Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). toim. / Mathijs de Weerdt; Sven Koenig; Gabriele Röger; Matthijs Spaan. 2018. s. 190-198 (Proceedings of the International Conference on Automated Planning and Scheduling).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Harvard

Rintanen, J & Pandey, B 2018, Planning for partial observability by SAT and graph constraints. julkaisussa M de Weerdt, S Koenig, G Röger & M Spaan (toim), Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). Proceedings of the International Conference on Automated Planning and Scheduling, Sivut 190-198, INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, Delft, Alankomaat, 24/06/2018.

APA

Rintanen, J., & Pandey, B. (2018). Planning for partial observability by SAT and graph constraints. teoksessa M. de Weerdt, S. Koenig, G. Röger, & M. Spaan (Toimittajat), Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (Sivut 190-198). (Proceedings of the International Conference on Automated Planning and Scheduling).

Vancouver

Rintanen J, Pandey B. Planning for partial observability by SAT and graph constraints. julkaisussa de Weerdt M, Koenig S, Röger G, Spaan M, toimittajat, Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). 2018. s. 190-198. (Proceedings of the International Conference on Automated Planning and Scheduling).

Author

Rintanen, Jussi ; Pandey, Binda. / Planning for partial observability by SAT and graph constraints. Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). Toimittaja / Mathijs de Weerdt ; Sven Koenig ; Gabriele Röger ; Matthijs Spaan. 2018. Sivut 190-198 (Proceedings of the International Conference on Automated Planning and Scheduling).

Bibtex - Lataa

@inproceedings{d9e189233df04e38a1f06e00d302d568,
title = "Planning for partial observability by SAT and graph constraints",
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.",
keywords = "SAT, planning, partial observability, graphs, constraints, acyclicity, reachability",
author = "Jussi Rintanen and Binda Pandey",
year = "2018",
month = "6",
day = "24",
language = "English",
series = "Proceedings of the International Conference on Automated Planning and Scheduling",
publisher = "AAAI PRESS",
pages = "190--198",
editor = "{de Weerdt}, Mathijs and Sven Koenig and Gabriele R{\"o}ger and Matthijs Spaan",
booktitle = "Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)",

}

RIS - Lataa

TY - GEN

T1 - Planning for partial observability by SAT and graph constraints

AU - Rintanen, Jussi

AU - Pandey, Binda

PY - 2018/6/24

Y1 - 2018/6/24

N2 - 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.

AB - 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.

KW - SAT

KW - planning

KW - partial observability

KW - graphs

KW - constraints

KW - acyclicity

KW - reachability

M3 - Conference contribution

T3 - Proceedings of the International Conference on Automated Planning and Scheduling

SP - 190

EP - 198

BT - Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)

A2 - de Weerdt, Mathijs

A2 - Koenig, Sven

A2 - Röger, Gabriele

A2 - Spaan, Matthijs

ER -

ID: 26845925