Plotting : a planning problem with complex transitions
Abstract
We focus on a planning problem based on Plotting, a tile-matching puzzle video game published by Taito. The objective of the game is to remove at least a certain number of coloured blocks from a grid by sequentially shooting blocks into the same grid. The interest and difficulty of Plotting is due to the complex transitions after every shot: various blocks are affected directly, while others can be indirectly affected by gravity. We highlight the difficulties and inefficiencies of modelling and solving Plotting using PDDL, the de-facto standard language for AI planners. We also provide two constraint models that are able to capture the inherent complexities of the problem. In addition, we provide a set of benchmark instances, an instance generator and an extensive experimental comparison demonstrating solving performance with SAT, CP, MIP and a state-of-the-art AI planner.
Citation
Espasa Arxer , J , Miguel , I J & Villaret , M 2022 , Plotting : a planning problem with complex transitions . in C Solon (ed.) , 28th International Conference on Principles and Practice of Constraint Programming (CP 2022) . , 23 , Leibniz International Proceedings in Informatics (LIPIcs) , vol. 235 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Dagstuhl , 28th International Conference on Principles and Practice of Constraint Programming (CP 2022) , Haifa , Israel , 31/07/22 . https://doi.org/10.4230/LIPIcs.CP.2022.22 conference
Publication
28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
ISSN
1868-8969Type
Conference item
Description
Funding: UK EPSRC EP/V027182/1 (IM); MCIU/AEI/FEDER, UE (RTI2018-095609-B-I00) (MV).Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.