Improvements to SAT-Based Conformant Planning

作者: Enrico Giunchiglia , Armando Tacchella , Claudio Castellini

DOI:

关键词:

摘要: Planning as satisfiability is an efficient technique for classical planning. In previous work by the second author, this approach has been extended to conformant planning, that is, planning domains having incomplete information about initial state and/or effects of actions. paper we present some domain independent optimizations basic procedure described in work. A comparative experimental analysis shows resulting competitive with other state-of-the-art planners on a high degree parallelism.

参考文章(23)
Norman McCain, Hudson Turner, Satisfiability planning with causal theories principles of knowledge representation and reasoning. pp. 212- 223 ,(1998)
Blai Bonet, Héctor Geffner, Planning with incomplete information as heuristic search in belief space international conference on artificial intelligence planning systems. pp. 52- 61 ,(2000)
Enrico Giunchiglia, Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism. principles of knowledge representation and reasoning. pp. 657- 666 ,(2000)
Patrik Haslum, Héctor Geffner, Admissible heuristics for optimal planning international conference on artificial intelligence planning systems. ,vol. 21, pp. 140- 149 ,(2000) , 10.1609/AIMAG.V21I4.1536
Fady Copty, Limor Fix, Ranan Fraer, Enrico Giunchiglia, Gila Kamhi, Armando Tacchella, Moshe Y. Vardi, Benefits of Bounded Model Checking at an Industrial Setting computer aided verification. pp. 436- 453 ,(2001) , 10.1007/3-540-44585-4_43
Enrico Giunchiglia, Paolo Ferraris, Planning as Satisfiability in Nondeterministic Domains national conference on artificial intelligence. pp. 748- 753 ,(2000)
Tomás E. Uribe, Mark E. Stickel, Ordered Binary Decision Diagrams and the Davis-Putnam Procedure CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics. pp. 34- 49 ,(1994) , 10.1007/BFB0016843
Enrico Giunchiglia, Massimo Maratea, Armando Tacchella, Davide Zambonin, Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability international joint conference on automated reasoning. pp. 347- 363 ,(2001) , 10.1007/3-540-45744-5_26
Bart Selman, Henry Kautz, Pushing the envelope: planning, propositional logic, and stochastic search national conference on artificial intelligence. pp. 1194- 1201 ,(1996)
Bart Selman, Henry Kautz, Planning as satisfiability european conference on artificial intelligence. pp. 359- 363 ,(1992)