International audienceThis paper deals with sliding games, which are a variant of the better known pushpush game. On a given structure (grid, torus...), a robot can move in a specific set of directions, and stops when it hits a block or boundary of the structure. The objective is to place the minimum number of blocks such that the robot can visit all the possible positions of the structure. In particular, we give the exact value of this number when playing on a rectangular grid and a torus. Other variants of this game are also considered, by constraining the robot to stop on each case, or by replacing blocks by walls
A key objective for a game playing robot is to have the inferface between the player and the robot b...
This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal...
In this paper, we consider exploring a 2-D environment with multiple robots by modeling the problem ...
International audienceThis paper deals with sliding games, which are a variant of the better known p...
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull blo...
Blocked In is a sliding block puzzle game which has some similarities with the ice cave block puz...
We prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban, genera...
Face-connected configurations of cubes are a common model for modular robots in three dimensions. In...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an...
AbstractWe prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban...
We study the computational complexity of collecting items inside a grid map with obstacles, using an...
Some robot tasks require manipulation of objects that may be touching other fixed objects. The effec...
We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result t...
Title: Sub-optimal algorithms for solving sliding puzzles Author: Petr Michalík Department: Departme...
A key objective for a game playing robot is to have the inferface between the player and the robot b...
This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal...
In this paper, we consider exploring a 2-D environment with multiple robots by modeling the problem ...
International audienceThis paper deals with sliding games, which are a variant of the better known p...
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull blo...
Blocked In is a sliding block puzzle game which has some similarities with the ice cave block puz...
We prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban, genera...
Face-connected configurations of cubes are a common model for modular robots in three dimensions. In...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an...
AbstractWe prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban...
We study the computational complexity of collecting items inside a grid map with obstacles, using an...
Some robot tasks require manipulation of objects that may be touching other fixed objects. The effec...
We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result t...
Title: Sub-optimal algorithms for solving sliding puzzles Author: Petr Michalík Department: Departme...
A key objective for a game playing robot is to have the inferface between the player and the robot b...
This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal...
In this paper, we consider exploring a 2-D environment with multiple robots by modeling the problem ...