منابع مشابه
SOKOBAN and other motion planning problems
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملSokoban and Other Motion Planning Problems (extended Abstract)
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملAutomatic Making of Sokoban Problems
This paper describes our program that makes Sokoban problems automatically. Sokoban is one of one-person puzzles invented in Japan. The program consists of three stages: generation, checking and evaluation. First, candidates for problems are generated randomly by a prototype and three templates . Second, unsolvable candidates are removed by the Sokoban solver. Finally trivial or uninteresting c...
متن کاملSolving Motion Planning Problems
This work considers a family of motion planning problems with movable blocks. Such problem is defined by a maze grid occupied by immovable blocks (walls) and free squares. There are k movable blocks (stones) and k fixed goal squares. The man is a movable block that can traverse free squares and move stones between them. The problem goal is to move the stones from their initial positions to the ...
متن کاملAdaptive Motion Planning for Complex Planning Problems
Motion planning has been used to solve problems of high complexity in both robotic and biological domains. In robotics, the topology of the planning environment often drives the problem’s complexity. Environments can consist of many different regions each of which may be well suited to a specific planning approach. In biological domains, problem complexity is primarily driven by the size of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1999
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00017-6