期刊文献+

部分可观察强规划中约减观察变量的研究 被引量:19

Research on Decreasing Observation Variables for Strong Planning under Partial Observation
下载PDF
导出
摘要 给出了一种约减观察变量方法——假设所有的状态变量都不是观察变量,在此基础上逐步增加必要的观察变量,从而最终得到一个必要的观察变量集合.在添加必要的观察变量过程中,该方法不要求得到所有变量的相关信息,从而具有更好的通用性.根据是否存在单个观察变量能够区分域中任意两个状态的问题,分别给出了两种约减观察变量方法:当存在一个观察变量可以区分规划域中任意两个状态时,算法可以得到一个最小的观察变量集合;当不存在这样一个观察变量时,算法可以得到一个尽可能小的观察变量集合,但不能保证该集合最小. How to decrease the observation variables for strong planning under partial observation is explored. Beginning from a domain under no observation, add necessary observation variables gradually to get a minimal set of observation variables necessary. Two methods are presented to decrease observation variables. With the former, when any of the two distinct states of the domain can be distinguished by an observation variable, this algorithm can find a minimal set of observation variables necessary for the execution of a plan. With the latter, when there are states that can't be distinguished by only one observation variable, this algorithm can find a set of observation variables as small as possible which are necessary for the execution of a plan.
出处 《软件学报》 EI CSCD 北大核心 2009年第2期290-304,共15页 Journal of Software
基金 国家自然科学基金 高等学校博士学科点专项科研基金 东北师范大学青年基金~~
关键词 强规划 部分可观察规划 部分可观察强规划 约减观察变量 不确定规划 strong planning planning under partial observation strong planning under partial observation decrease observation variables nondeterministic planning
  • 相关文献

参考文献1

二级参考文献16

  • 1Helmert M. Complexity results for standard benchmark domains in planning. Artificial Intelligence, 2003,143(2):219-262.
  • 2Blum AL, Furst ML. Fast planning through planning graph analysis. Artificial Intelligence, 1997,90:281-300.
  • 3Hoffmann J, Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 2001,14:253-302.
  • 4Edelkamp S, Helmert M. The model checking integrated planning system. AI Magazine, 2001,22(3):67-71.
  • 5Bertoli P, Cimatti A, Pistore M, Roveri M, Traverso P. MBP: A model based planner. In: Proc. of IJCAI 2001 Workshop on Planning under Uncertainty and Incomplete Information. Seattle, 2001.
  • 6Jensen RM, Veloso MM, Bowling MH. OBDD-Based optimistic and strong cyclic adversarial planning. In: Proc. of the 6th European Conf. on Planning (ECP 2001). Springer-Verlag, 2001.
  • 7Bryant RE. Graph-Based algorithms for boolwan function manipulation. IEEE Trans. on Computers, 1986,35(8):677-691.
  • 8Fox M, Long D. PDDL2.1: An extension to PDDL for expressing temporal planning domains. 2002. http://www.dur.ac.uk/d.p.long/ pddl2.ps.gz
  • 9Haslum P, Scholz U. Domain knowledge in planning: Representation and use. In: Proc. of the ICAPS 2003 Workshop on PDDL. 2003.
  • 10AIPS 2002 Competition Domains. 2002. http://www.dur.ac.uk/d.p.long/competition.html

共引文献16

同被引文献209

引证文献19

二级引证文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部