摘要： 以规划领域中的不确定状态转移系统作为研究对象，给出最小权值强规划解的概念，提出一种求最小权值强规划解的方法。该方法可以求解与动作代价相关的数值规划问题，在不确定状态转移系统的执行动作上增加权值来表示动作的代价，在此基础上设计求解最小权值强规划解的算法。实验结果表明，该算法能有效求解最小权值强规划解，且比用反向搜索方法求强规划解的算法效率高。

关键词: 不确定规划, 状态动作序偶, 最小权值强规划解, 带权最小值的规划领域, 执行结构

Abstract: This paper studies strong planning solution under uncertainty. The concept of strong planning solution with minimal cost is proposed and a way for searching strong planning solution with minimal cost is designed, which can figure out the numeric planning problems with the action cost, a weighted algorithm of nondeterministic state-transition system is proposed, which adds the weight to action, that is the action cost, a planning solution with minimal action cost is gotten. Experimental results show that the method for searching strong planning solution with minimal cost is superior to the algorithm based on backward search method for searching strong planning solution.

Key words: uncertainty planning, state-action pair, minimal cost strong planning solution, planning domain with minimal cost, execution structure

中图分类号: 

• TP18