This paper describes a system that automatically transforms a PDDL encoding, calls a planner to solve the transformed representation, and translates the solution back into the original representation. The approach involves counting objects that are indistinguishable, rather than treating them as individuals, which eliminates some unnecessary combinatorial explosion.
|Title of host publication||Proceedings of the Eighth International Symposium on Combinatorial Search (SoCS-2015)|
|Number of pages||2|
|Publication status||Published - 14 May 2015|
|Event||8th Annual Symposium on Combinatorial Search - Ein Gedi, Israel|
Duration: 11 Jun 2015 → 13 Jun 2015
Conference number: 8
http://www.ise.bgu.ac.il/socs2015/ (Link to Conference Website)
|Conference||8th Annual Symposium on Combinatorial Search|
|Abbreviated title||SoCS 2015|
|Period||11/06/15 → 13/06/15|
Riddle, P., Barley, M., Franco, S., & Douglas, J. (2015). Automated Transformation of PDDL Representations. In Proceedings of the Eighth International Symposium on Combinatorial Search (SoCS-2015) (pp. 214-215). AAAI press.