OBDD-based Deterministic Planning using the UMOP
暂无分享,去创建一个
[1] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[2] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[3] Daniel S. Weld. An Introduction to Least Commitment Planning , 1994, AI Mag..
[4] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[5] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[6] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[7] Amedeo Cesta,et al. Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.
[8] Mauro Di Manzo,et al. Planning via Model Checking in Deterministic Domains: Preliminary Report , 1998, AIMSA.
[9] Paolo Traverso,et al. Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.
[10] Maria Fox,et al. The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..
[11] Manuela M. Veloso,et al. OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains , 1999, Artificial Intelligence Today.
[12] S. Edelkamp,et al. Deterministic State Space Planning with BDDs , 1999 .