A simplified criterion for repeatability and its application in constraint path planning problems.
Ralf SchauflerChristian H. FedrowitzReiner KammüllerPublished in: IROS (2000)
Keyphrases
- planning problems
- heuristic search
- domain independent
- state space
- ai planning
- planning domains
- planning systems
- solving planning problems
- binary constraints
- partial observability
- causal graph
- fully observable
- planning tasks
- probabilistic planning
- plan generation
- htn planning
- partially observable markov decision processes
- machine learning
- stochastic domains
- concurrent actions
- optimal planning
- goal state
- linear constraints
- service composition
- deterministic domains
- learning algorithm