Compiling Planning Problems with Non-deterministic Events into FOND Planning.
Lukás ChrpaMartin PilátJakub GemrotPublished in: RCRA/RiCeRcA@AI*IA (2019)
Keyphrases
- planning problems
- deterministic domains
- fully observable
- heuristic search
- stochastic domains
- domain independent
- state space
- planning domains
- ai planning
- probabilistic planning
- planning systems
- solving planning problems
- domain independent planning
- classical planning
- concurrent actions
- causal graph
- plan generation
- conformant planning
- planning tasks
- search algorithm
- partial observability
- optimal planning
- temporal relations
- temporal planning
- htn planning
- sensing actions
- temporal information
- domain specific
- machine learning
- planning in nondeterministic domains