A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems.
J. BentonMenkes van den BrielSubbarao KambhampatiPublished in: ICAPS (2007)
Keyphrases
- planning problems
- domain independent planning
- linear programming
- classical planning
- optimal solution
- planning graph
- planning domains
- plan generation
- ai planning
- state space
- heuristic search
- domain independent
- planning systems
- dynamic programming
- optimal planning
- linear program
- planning tasks
- concurrent actions
- heuristic functions
- planning in nondeterministic domains
- partial observability
- automated planning
- partial information
- np hard
- probabilistic planning
- optimal plans
- heuristic function
- solving planning problems
- deterministic domains
- constraint satisfaction
- stochastic domains
- domain specific
- partially observable
- state space search
- temporal planning
- htn planning
- general purpose
- causal graph
- goal state
- search strategies
- forward search
- belief space
- constraint propagation
- plan quality
- objective function
- markov decision processes