Skip to main content

Questions tagged [strips]

For questions related to the Stanford Research Institute Problem Solver (also known as STRIPS), which is an automated planner developed by Richard Fikes and Nils Nilsson in 1971 at SRI International.

Filter by
Sorted by
Tagged with
0 votes
1 answer
347 views

How to interpret the output plan of the fast-downward planner

I'm using this domain/problem with the fast-downward planner like this: ./fast-downward.py --plan-file plan.out ../test_domain.pddl ../test_problem.pddl The issue ...
Bilal's user avatar
  • 105
2 votes
1 answer
366 views

FastDownward PDDL Planner Limitations [closed]

I recently had a look at automated planners and experimented a little bit with FastDownward. As I wanted to start a toy project, I created a PDDL model for the ordinary 3D Rubik's Cube (of course ...
ttttttt1's user avatar
2 votes
0 answers
97 views

How can I define the relations, preconditions and effects of each operator for the Sokoban puzzle?

I would like to solve the Sokoban puzzle, which consists in moving a character in a 2D map to push boulders into target cells. Each turn, the player can move to an adjacent cell (no diagonals) if it ...
Peyton's user avatar
  • 21
1 vote
1 answer
99 views

Can the C4.5 algorithm learn a GOAP model?

Goal-oriented action planning (GOAP) is a well-known planning technique in computer games. It was introduced to control the non-player characters in the game F.E.A.R. (2005) by creating an abstract ...
user avatar