arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.14397cs.AIcs.LO
收藏

复杂过渡规划的初步案例研究:标绘

A Preliminary Case Study of Planning With Complex Transitions: Plotting

Aix Marseille Univ(艾克斯-马赛大学);Université de Toulon(土伦大学);CNRS(法国国家科学研究中心);University of St Andrews(圣安德鲁斯大学);Universitat de Girona(赫罗纳大学)

Jordi Coll, Joan Espasa, Ian Miguel, Mateu Villaret

摘要:

Plotting是Taito于1989年发行的一款拼图游戏。其目标是将给定的彩色块网格减少到目标数量或更少。这是通过化身角色重复地将其持有的块射击到网格中来实现的。规划是规划问题的一个例子:给定一个环境模型,规划问题要求我们找到一系列行动,这些行动可以从环境的初始状态引导到给定的目标状态,同时尊重一些约束。建模Plotting的关键困难在于捕捉每一次射击后谜题状态的变化方式。一个Single Shot可以直接影响多个图块,而网格会受到重力的影响,因此许多其他图块可能会间接受到影响。我们提出并评估了一个约束模型的绘图问题,捕捉这种复杂性。我们还讨论了在PDDL中建模绘图的困难和效率低下,PDDL是用于向专业AI规划者输入的标准语言。最后,我们认为人工智能规划可以从更丰富的建模语言中受益。

英文摘要:

Plotting is a tile-matching puzzle video game published by Taito in 1989. Its objective is to reduce a given grid of coloured blocks down to a goal number or fewer. This is achieved by the avatar character repeatedly shooting the block it holds into the grid. Plotting is an example of a planning problem: given a model of the environment, a planning problem asks us to find a sequence of actions that can lead from an initial state of the environment to a given goal state while respecting some constraints. The key difficulty in modelling Plotting is in capturing the way the puzzle state changes after each shot. A single shot can affect multiple tiles directly, and the grid is affected by gravity so numerous other tiles can be affected indirectly. We present and evaluate a constraint model of the Plotting problem that captures this complexity. We also discuss the difficulties and inefficiencies of modelling Plotting in PDDL, the standard language used for input to specialised AI planners. We conclude by arguing that AI planning could benefit from a richer modelling language.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑