Login / Signup
Fast strong planning for fully observable nondeterministic planning problems.
Jicheng Fu
Andres Calderon Jaramillo
Vincent Ng
Farokh B. Bastani
I-Ling Yen
Published in:
Ann. Math. Artif. Intell. (2016)
Keyphrases
</>
fully observable
planning problems
heuristic search
domain independent
partial observability
state space
ai planning
planning domains
planning systems
solving planning problems
classical planning
stochastic domains
deterministic domains
optimal planning
search algorithm
domain specific
reinforcement learning