Fragment-based Conformant Planning

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 153-162

  Kurien, James ^a   Nayak, P Pandurang ^b   Smith, David E ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b Stratify Inc ^*  (United States)

^c NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMANT PLANNING; INITIAL STATE; ONE.WORLD; PARALLEL PLANS; PLANNING DOMAINS; SEARCH STRATEGIES;

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

References (16)

1. Bertoli, P.; Cimatti, A.; and Roveri, M. 2001. Heuristic search + symbolic model checking = efficient conformant planning. In Procs. IJCAI-01.
2. Blum, A. L., and Furst, M. L. 1995. Fast planning through planning graph analysis. In Proceedings of IJCAI-95, 1636-1642.
3. Bonet, B., and Geffner, H. 2001. Gpt: A tool for planning with uncertainty and partial information. In Workshop on Planning with Uncertainty and Partial Information, IJCAI-2001.
4. Castellini, C.; Giunchiglia, E.; and Tacchella, A. 2001. Improvements to sat-based conformant planning. In ECP2001.
5. Cimatti, A., and Roveri, M. 2000. Conformant planning via symbolic model checking. In JAIR, volume 13, 303-338.
6. Gazen, B. C., and Knoblock, C. A. 1997. Combining the ex-pressivity of UCPOP with the efficiency of graphplan. In ECP, 221-233.
7. Gomes, C. P.; Selman, B.; McAloon, K.; and Tretkoff, C. 1998. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In Procs. AIPS-98, 208-213.
8. Joslin, D. E., and Clements, D. P. 1999. Squeaky wheel optimization. JAIR 10.
9. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Procs. AAAI-96.
10. Kautz, H., and Selman, B. 1999. Unifying sat-based and graph-based planning. In Procs. IJCAI-98.
11. Kurien, J.; Nayak, P. P.; and Smith, D. E. 2002. Maximizing safety and achievement under time constraints. In preparation.
12. Langley, P. 1992. Systematic and nonsystematic search strategies. In Procs. AIPS-92, 145-152.
13. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Procs. IJCAI-97, 366-371.
14. McDermott, D. 1987. A critique of pure reason. Computational Intelligence 3:151-160.
15. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26.
16. Smith, D. E., and Weld, D. S. 1998. Conformant graphplan. In Proceedings of AAAI-98.