Questions tagged [planning]

For questions related to the (automated) planning problem, which is the problem of finding a plan, i.e. a sequence of actions to move from an initial state to a goal state or a policy (a function from states to actions), and planning algorithms. There are different ways to define a planning problem (such as PDDL) and solve a planning problem (e.g. GraphPlan). In reinforcement learning, planning consists in finding a policy that solves an MDP.

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
7
votes
2answers
3k views

What is the difference between search and planning?

I'm studying Artificial Intelligence. A Modern Approach, Stuart Russell, Peter Norvig, specifically about search and planning arguments. I don't understand the difference between the two terms. I was ...
2
votes
0answers
37 views

What trait of a planning problem makes reinforcement learning a well suited solution?

Planning problems have been the first problems studied at the dawn of AI (Shakey the robot). Graph search (e.g. A*) and planning (e.g. GraphPlan) algorithms can be very efficient at generating a plan. ...
2
votes
0answers
75 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 ...
1
vote
0answers
30 views

Can I solve this assignment problem with RL or AI planning, and if yes how?

I have a list of positive nonzero integers $T=[v_1,\dots,v_𝑛|v_𝑖\in Z^{\neq}]$ which sum up to $V=\sum_i v_i$. Typically, the length of T (number of integers) goes from 100 to 1000. The list is not ...
0
votes
0answers
45 views

choose operator in STRIPS algorithm

Let's say we have a "monkey and banana" problem. Let's say we have 3 places: A, B and C. We also have the operator move(X, Y), which moves the monkey from ...