Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorEspasa Arxer, Joan
dc.contributor.authorMiguel, Ian James
dc.contributor.authorVillaret, Mateu
dc.contributor.editorSolon, Christine
dc.date.accessioned2022-07-28T16:30:09Z
dc.date.available2022-07-28T16:30:09Z
dc.date.issued2022-07-23
dc.identifier279726091
dc.identifier44ded795-0bc1-47a5-bd03-afca8d28ab36
dc.identifier85135685568
dc.identifier.citationEspasa 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.22en
dc.identifier.citationconferenceen
dc.identifier.isbn9783959772402
dc.identifier.issn1868-8969
dc.identifier.otherORCID: /0000-0002-6930-2686/work/116597865
dc.identifier.urihttps://hdl.handle.net/10023/25745
dc.descriptionFunding: UK EPSRC EP/V027182/1 (IM); MCIU/AEI/FEDER, UE (RTI2018-095609-B-I00) (MV).en
dc.description.abstractWe 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.extent17
dc.format.extent897026
dc.language.isoeng
dc.publisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
dc.relation.ispartof28th International Conference on Principles and Practice of Constraint Programming (CP 2022)en
dc.relation.ispartofseriesLeibniz International Proceedings in Informatics (LIPIcs)en
dc.subjectAI Planningen
dc.subjectModellingen
dc.subjectConstraint programmingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectQA76 Computer softwareen
dc.subjectDASen
dc.subject.lccQA75en
dc.subject.lccQA76en
dc.titlePlotting : a planning problem with complex transitionsen
dc.typeConference itemen
dc.contributor.sponsorEPSRCen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Sir James Mackenzie Institute for Early Diagnosisen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doi10.4230/LIPIcs.CP.2022.22
dc.identifier.grantnumberEP/V027182/1en


This item appears in the following Collection(s)

Show simple item record