Files in this item
Plotting : a planning problem with complex transitions
Item metadata
dc.contributor.author | Espasa Arxer, Joan | |
dc.contributor.author | Miguel, Ian James | |
dc.contributor.author | Villaret, Mateu | |
dc.contributor.editor | Solon, Christine | |
dc.date.accessioned | 2022-07-28T16:30:09Z | |
dc.date.available | 2022-07-28T16:30:09Z | |
dc.date.issued | 2022-07-23 | |
dc.identifier | 279726091 | |
dc.identifier | 44ded795-0bc1-47a5-bd03-afca8d28ab36 | |
dc.identifier | 85135685568 | |
dc.identifier.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 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783959772402 | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.other | ORCID: /0000-0002-6930-2686/work/116597865 | |
dc.identifier.uri | https://hdl.handle.net/10023/25745 | |
dc.description | Funding: UK EPSRC EP/V027182/1 (IM); MCIU/AEI/FEDER, UE (RTI2018-095609-B-I00) (MV). | en |
dc.description.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. | |
dc.format.extent | 17 | |
dc.format.extent | 897026 | |
dc.language.iso | eng | |
dc.publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing | |
dc.relation.ispartof | 28th International Conference on Principles and Practice of Constraint Programming (CP 2022) | en |
dc.relation.ispartofseries | Leibniz International Proceedings in Informatics (LIPIcs) | en |
dc.subject | AI Planning | en |
dc.subject | Modelling | en |
dc.subject | Constraint programming | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | QA76 Computer software | en |
dc.subject | DAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | QA76 | en |
dc.title | Plotting : a planning problem with complex transitions | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Sir James Mackenzie Institute for Early Diagnosis | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.4230/LIPIcs.CP.2022.22 | |
dc.identifier.grantnumber | EP/V027182/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.