DPPlan: an Algorithm for Fast Solutions Extraction from a Planning Graph

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 13-21

  Baioletti, M ^a   Marcugini, S ^a   Milani, A ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC;

EFFICIENT PLANNING; FAST SOLUTIONS; GRAPH ANALYSIS; GRAPHPLAN; NEW APPROACHES; PLAN GENERATION; PLANNING ALGORITHMS; PLANNING GRAPHS; SATISFIABILITY; SOLUTION EXTRACTION;

STOCHASTIC SYSTEMS;

EID: 77953825821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A.L. Blum and M.L. Fürst. Fast Planning through Planning Graph Analysis. Artificial Intelligence 90(1-2): 281-300, 1997
2. H. Kautz and Bart Selman. Pushing the envelope: Planning, Prepositional Logic and Stochastic Search. In Proc. of AAAI1996
3. M. D. Ernst, T. D. Milstein, and D. S. Weld. Automatic SAT-Compilation of Planning Problems. In Proc. of IJCAI1997
4. J. Koehler. Planning under Constraints Resource. In Proc. of ECAI1998.
5. Henry Kautz, D. McAllester, and Bart Selman. Encoding Plans in Prepositional Logic. In Proc. of KR 1996.
6. Subbarao Kambhampati, Eric Lambrecht, and Eric Parker. Understanding and Extending Graphplan. In Proc. of ECP 1997
7. Henry Kautz and Bart Selman. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. In AIPS-98 Workshop on Planning as Combinatorial Search.
8. J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending Planning Graphs to an ADL Subset In Proc. of ECP-1997.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM 5, 1962, 394¬ 397.
10. Carla P. Gomes, Bart Selman, and Henry Kaut/.. Boosting Combinatorial Search Through Randomization. In Proc. of AAAI-98.
11. Henry Kautz and Bart Selman. Planning as Satisfiability. In Proc. of ECAI 1992.
12. R.E. Fikes and N.J. Nilsson. STRIPS: A new approach ïo tneipphcation of theorem proving to problem solving. Artificial Intelligence, 2 (3/4), 189-208
13. Subbarao Kambhampati. Challenges in bridging plan synthesis paradigms. In Proc. of IJCAI-97.
14. Jussi Rintanen A Planning Algorithm not based on Directional Search In Proc. of KR-98
15. E. Giunchiglia, A. Massarotto, R. Sebastiani. Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability. Proc. of AAAI 1998.
16. M. Baioletti, A. Milani. A Planning Model for Concurrent Asynchronous Automata Submitted to AIPS-2000