Francès, G., Ramírez, M., Lipovetzky, N. and Geffner, H.Purely Declarative Action Representations are Overrated: Classical Planning with Simulators. In Proc. of the 26th Int. Joint Conf. on Artificial Intelligence (IJCAI 2017)
List of results published directly linked with the projects co-funded by the Spanish Ministry of Economy and Competitiveness under the María de Maeztu Units of Excellence Program (MDM-2015-0502).
List of publications acknowledging the funding in Scopus.
The record for each publication will include access to postprints (following the Open Access policy of the program), as well as datasets and software used. Ongoing work with UPF Library and Informatics will improve the interface and automation of the retrieval of this information soon.
The MdM Strategic Research Program has its own community in Zenodo for material available in this repository 
as well as at the UPF e-repository 
Francès, G., Ramírez, M., Lipovetzky, N. and Geffner, H.Purely Declarative Action Representations are Overrated: Classical Planning with Simulators. In Proc. of the 26th Int. Joint Conf. on Artificial Intelligence (IJCAI 2017)
Francès, G., Ramírez, M., Lipovetzky, N. and Geffner, H. Purely Declarative Action Representations are Overrated: Classical Planning with Simulators. In Proc. of the 26th Int. Joint Conf. on Artificial Intelligence (IJCAI 2017)
Classical planning is concerned with problems where a goal needs to be reached from a known initial state by doing actions with deterministic, known effects. Classical planners, however, deal only with classical problems that can be expressed in declarative planning languages such as STRIPS or PDDL. This prevents their use on problems that are not easy to model declaratively or whose dynamics are given via simulations. Simulators do not provide a declarative representation of actions, but simply return successor states. The question we address in this paper is: can a planner that has access to the structure of states and goals only, approach the performance of planners that also have access to the structure of actions expressed in PDDL? To answer this, we develop domain-independent, black box planning algorithms that completely ignore action structure, and show that they match the performance of state-of-the-art classical planners on the standard planning benchmarks. Effective black box algorithms open up new possibilities for modeling and for expressing control knowledge, which we also illustrate.
Additional material:
- Problem encodings and results at Github
- OA publication at the author's web