Improving performance by reformulating PDDL into a bagged representation

Pat Riddle, Jordan Douglas, Mike Barley, Santiago Franco

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper describes Baggy - a system which automatically transforms a PDDL representation into a revised PDDL representation, solves the problem using
the revised representation, and transforms the solution back into the original representation. The basic approach involves counting objects that are indistinguishable, rather than treating them as individual objects. This eliminates some unnecessary combinatorial explosion. We report encouraging results on a number of IPC11/14 domains and give algorithm details including soundness proof sketches. We conclude by discussing related work and outlining plans for future research.
Original languageEnglish
Title of host publicationProceedings of the 8th Workshop on Heuristics and Search for Domain-independent Planning (HSDIP)
Subtitle of host publicationThe 26th International Conference on Automated Planning and Scheduling
EditorsJ. Benton, Daniel Bryce, Michael Katz, Nir Lipovetzky, Christian Muise, Miquel Ramirez, Alvaro Torralba
Pages28-36
Number of pages9
Publication statusPublished - 2016
Externally publishedYes
Event26th International Conference on Automated Planning and Scheduling - London, United Kingdom
Duration: 12 Jun 201617 Jun 2016
Conference number: 26
http://icaps16.icaps-conference.org/ (Link to Conference Website)

Conference

Conference26th International Conference on Automated Planning and Scheduling
Abbreviated titleICAPS 2016
Country/TerritoryUnited Kingdom
CityLondon
Period12/06/1617/06/16
Internet address

Fingerprint

Dive into the research topics of 'Improving performance by reformulating PDDL into a bagged representation'. Together they form a unique fingerprint.

Cite this