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 |
Planning Domain Definition Language is used to define planning domain models used by AI Planning engines. Use this tag for questions about modeling in PDDL syntax, parsing PDDL models, interpreting constructs the PDDL syntax allows and about widely used tools such as VAL/Validate, or well known planner implementations.
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).
Here's an example in Prolog with a domain described in terms of actions, when they are …
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) …