Fast strong planning for fully observable nondeterministic planning problems

DOI10.1007/S10472-016-9517-7zbMath1401.68286OpenAlexW2466048576MaRDI QIDQ504220

Farokh B. Bastani, Andres Calderon Jaramillo, Vincent Ng, Jicheng Fu, I.-Ling Yen

Publication date: 25 January 2017

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-016-9517-7

zbMATH Keywords

fully observable nondeterministic planning (FOND)strong planningstrong-cyclic planningweak planning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Plan aggregation for strong cyclic planning in nondeterministic domains
• Weak, strong, and strong cyclic planning via symbolic model checking
• Task decomposition on abstract states, for planning under nondeterminism
• Strong planning under partial observability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast strong planning for fully observable nondeterministic planning problems