Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
We study planning problems where the transition function is described by a learned binarized neural network (BNN). Theoretically, we show that feasible planning with a learned BNN model is NP-complete, and present two new constraint programming models of this task as a mathematical optimization problem. Experimentally, we run solvers for constraint programming, weighted partial maximum satisfiability, 0–1 integer programming, and pseudo-Boolean optimization, and observe that the pseudo-Boolean solver outperforms previous approaches by one to two orders of magnitude. We also investigate symmetry handling for planning problems with learned BNNs over long horizons. While the results here are less clear-cut, we see that exploiting symmetries can sometimes reduce the running time of the pseudo-Boolean solver by up to three orders of magnitude.
Originalsprog | Engelsk |
---|---|
Titel | Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings |
Redaktører | Helmut Simonis |
Antal sider | 18 |
Forlag | Springer |
Publikationsdato | 2020 |
Sider | 917-934 |
ISBN (Trykt) | 9783030584740 |
DOI | |
Status | Udgivet - 2020 |
Begivenhed | 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 - Louvain-la-Neuve, Belgien Varighed: 7 sep. 2020 → 11 sep. 2020 |
Konference
Konference | 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 |
---|---|
Land | Belgien |
By | Louvain-la-Neuve |
Periode | 07/09/2020 → 11/09/2020 |
Navn | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Vol/bind | 12333 LNCS |
ISSN | 0302-9743 |
ID: 251866895