REINFORCED ENCODING FOR PLANNING AS SAT
Solving planning problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning. We propose a new encoding scheme, called Reinforced Encoding, which encodes a planning problem represented in the SAS+ formalism into SAT. The Reinforced Encoding is a co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CTU Central Library
2015-12-01
|
| Series: | Acta Polytechnica CTU Proceedings |
| Online Access: | https://ojs.cvut.cz/ojs/index.php/APP/article/view/3392 |