Linear Time Near-Optimal Planning in the Blocks World
暂无分享,去创建一个
[1] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[2] Dana S. Nau,et al. Complexity Results for Blocks-World Planning , 1991, AAAI.
[3] J. Slaney,et al. Blocks World Tamed Ten Thousand Blocks in under a Second , 1995 .
[4] Stephen V. Chenoweth. On the NP-Hardness of Blocks World , 1991, AAAI.
[5] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[6] Bart Selman,et al. Near-Optimal Plans, Tractability, and Reactivity , 1994, KR.
[7] Marcel Schoppers,et al. Estimating Reaction Plan Size , 1994, AAAI.
[8] Stephen V. Chenoweth. On the NP-ardness of blocks world , 1991 .
[9] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[10] Fahiem Bacchus,et al. Using temporal logic to control search in a forward chaining planner , 1996 .
[11] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[12] Dana S. Nau,et al. On the Complexity of Blocks-World Planning , 1992, Artif. Intell..