Plan aggregation for strong cyclic planning in nondeterministic domains.
Artificial Intelligence(2014)
摘要
We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. NDP2 is provably correct, and fixes several problems with prior work.
更多查看译文
关键词
Automated planning,Nondeterministic actions,Strong cyclic solutions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络