Search Results for author:
Found 11 papers, 5 papers with code
Behaviour Planning: A Toolkit for Diverse Planning
Diverse planning is the problem of generating plans with distinct characteristics.
Bridging the Gap between Structural and Semantic Similarity in Diverse Planning
In this work, we propose two new domain-independent metrics which are able to capture relevant information on the difference between two given plans from a domain-dependent viewpoint.
Towards Automatic Design of Factorio Blueprints
Factorio is a 2D construction and management simulation video game about building automated factories to produce items of increasing complexity.
A Good Snowman is Hard to Plan
In this work we face a challenging puzzle video game: A Good Snowman is Hard to Build.
Challenges in Modelling and Solving Plotting with PDDL
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989.
Towards a Model of Puzznic
We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks.
On Grid Graph Reachability and Puzzle Games
Many puzzle video games, like Sokoban, involve moving some agent in a maze.
A Framework for Generating Informative Benchmark Instances
This separation presents an opportunity for automated approaches to generate instance data that define instances that are graded (solvable at a certain difficulty level for a solver) or can discriminate between two solving approaches.
A Preliminary Case Study of Planning With Complex Transitions: Plotting
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.
Using Small MUSes to Explain How to Solve Pen and Paper Puzzles
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-level logical description.
Exploring Instance Generation for Automated Planning
Many of the core disciplines of artificial intelligence have sets of standard benchmark problems well known and widely used by the community when developing new algorithms.
