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.

Filter by
Sorted by
Tagged with
9
votes
3answers
1k views

What algorithms are considered reinforcement learning algorithms?

What are the areas/algorithms that belong to reinforcement learning? TD(0), Q-Learning and SARSA are all temporal-difference algorithms, which belong to the reinforcement learning area, but is there ...
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 ...
6
votes
1answer
617 views

MCTS: How to choose the final action from the root

When the time allotted to Monte Carlo tree search runs out, what action should be chosen from the root? The original UCT paper (2006) says bestAction in their ...
5
votes
3answers
99 views

Isn't a simulation a great model for model-based reinforcement learning?

Most reinforcement learning agents are trained in simulated environments. The goal is to maximize performance in (often) the same environment, preferably with a minimum amount of interactions. Having ...
3
votes
1answer
110 views

What AI technique should I use to assign a person to a task?

I'm trying to learn AI and thinking to apply it to our system. We have an application for the translation industry. What we are doing now is the coordinator $C$ assigns a file to a translator $T$. The ...
3
votes
1answer
409 views

Several questions related to UCT and MCTS

In Bandit Based Monte-Carlo Planning, the article where UCT is introduced as a planning algorithm, there is an algorithm description in page 285 (4 of the pdf). Comparing this implementation of UCT (a ...
2
votes
1answer
138 views

Is there any AI system for finding the best way to schedule university classes?

I was wondering whether there is an AI system which could be used to resolve the class clashes problem which mostly happens in universities. In almost every university students face this problem, ...
2
votes
1answer
167 views

How to transform a PDDL to search?

I have a question about search and planning: I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with: "Having formulated a ...
2
votes
1answer
626 views

Can't solve Towers of Hanoi in PDDL

I'm using PDDL to generate a plan to solve this tower of Hanoi puzzle. I'll give the problem, the rules, the domain and fact sheet for everything. PDDL is telling me that the goal can be simplified ...
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 ...
2
votes
0answers
135 views

How to choose method for solving planning problems? [closed]

There are many methods and algorithms dealing with planning problems. If I understand correctly, according to Wikipedia, there are classical planning problems, with: a unique known initial state, ...
1
vote
2answers
2k views

What is “planning” in the context of reinforcement learning, and how is it different from RL and SL?

This is an excerpt taken from Sutton and Barto (pg. 3): Another key feature of reinforcement learning is that it explicitly considers the whole problem of a goal-directed agent interacting with an ...
1
vote
1answer
67 views

Is the distribution of state-action pairs from sample based planning accurate for small experience sets?

From the David Silver's lecture 8: Integrating Learning and Planning - based on Sutton and Barto - he talks about using sample-based planning to use our model to take a sample of a state and then use ...
1
vote
2answers
93 views

Can two planning PDDL actions be taken simultaneously?

We are discussing planning algorithms currently, and the question is to describe the steps to check if actions could be taken simultaneously. This is a really open-ended question so I'm not sure where ...
1
vote
1answer
133 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 ...
1
vote
2answers
74 views

Can PDDL be utilized for action recognition?

The Planning Domain Definition Language (PDDL) is known for its capabilities of symbolic planning in the state space. A solver will find a sequence of steps to bring the system from a start state to ...
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
1answer
421 views

How does a PDDL solver find a solution for a given problem?

As far as I know, in PDDL, an environment is designed as well as the initial state described. When we describe the target state, the solver creates some sort of a graph. How is the graph built and ...
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 ...