Using path-length localized RRT-like search to solve challenging planning problems.
Nathan A. WedgeMichael S. BranickyPublished in: ICRA (2011)
Keyphrases
- planning problems
- path length
- solving planning problems
- heuristic search
- search problems
- state space
- planning in nondeterministic domains
- planning graph
- classical planning
- ai planning
- search algorithm
- search space
- domain independent planning
- planning systems
- domain independent
- shortest path
- search methods
- macro operators
- partial observability
- probabilistic planning
- planning domains
- search strategy
- fully observable
- htn planning
- causal graph
- search strategies
- general purpose
- small world
- machine learning
- np hard
- dynamic programming
- forward search
- concurrent actions
- deterministic domains
- domain specific
- orders of magnitude