Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with planning
Search options not deleted
user 15541
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.
0
votes
Can PDDL be utilized for action recognition?
This is theoretically possible for an exhaustive set of sequential, non-concurrent primitive actions:
$$
\forall s_1, s_2 \left( \exists a \left( \text{possible}(a, s_1) \land \text{do}(a, s_1, s_2) …
- 201
2
votes
How to transform a PDDL to search?
Not all search is planning (is A connected to B), but all planning is search (how do I get from this to that). …
- 201