Sökning: onr:"swepub:oai:lup.lub.lu.se:dfe6a76b-540c-4526-b038-f42c7e91cd08" >
Theoretical and Exp...
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
-
- Say, Buser (författare)
- Monash University
-
- Devriendt, Jo (författare)
- Lund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH,University of Copenhagen
-
- Nordström, Jakob (författare)
- Lund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH,University of Copenhagen
-
visa fler...
-
- Stuckey, Peter J. (författare)
- Monash University
-
Simonis, Helmut (redaktör/utgivare)
-
visa färre...
-
(creator_code:org_t)
- 2020-09-02
- 2020
- Engelska 18 s.
-
Ingår i: Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. - 9783030584740 ; 12333, s. 917-934
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Nyckelord
- Automated planning
- Binarized neural networks
- Cutting planes reasoning
- Mathematical optimization
- Pseudo-Boolean optimization
- Symmetry
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas