Domain independent approaches for finding diverse plans

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2016-2022

  Srivastava, Biplav ^a   Nguyen, Tuan A ^b   Gerevini, Alfonso ^c   Kambhampati, Subbarao ^d   Do, Minh Binh ^e   Serina, Ivan ^c  

^a IBM INDIA RESEARCH LAB   (India)

^b UNIVERSITY OF NATURAL SCIENCES   (Viet Nam)

^c UNIVERSITY OF BRESCIA   (Italy)

^d ARIZONA STATE UNIVERSITY   (United States)

^e PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENT DOMAINS; DISTANCE FUNCTIONS; DIVERSE PLANS; DOMAIN-INDEPENDENT APPROACH; DOMAIN-INDEPENDENT PLANNING; EXTERNAL SYSTEMS; HEURISTIC LOCAL SEARCH;

ARTIFICIAL INTELLIGENCE;

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

References (12)

1. Boddy, M.; Gohde, J.; Haigh, T.; and Harp, S. 2005. Course of action generation for cyber security using classical planning. In Proc. ICAPS. AAAI.
2. Callan, J., and Minka, T. 2002. Novelty and redundancy detection in adaptive filtering. In Proc. SIGIR. ACM Press.
3. Chafle, G.; Dasgupta, K.; Kumar, A.; Mittal, S.; and Srivastava, B. 2006. Adaptation in Web Services Composition and Execution. In Proc. ICWS.
4. Do, M. B., and Kambhampati, S. 2001. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. AI 132(2):151-182.
5. Fox, M.; Gerevini, A.; Long, D.; and Serina, I. 2006. Plan stability: Replanning versus plan repair. In Proc. ICAPS.
6. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research (JAIR) 20:pp. 239-290. (Pubitemid 41530527)
7. Hebrard, E.; Hnich, B.; O'Sullivan, B.; and Walsh, T. 2005. Finding diverse and similar solutions in constraint programming. In Proc. AAAI.
8. Kautz, H., and Selman, B. 1998. Blackbox: A new approach to the application of theorem proving to problem solving. In Workshop on Planning as Combinatorial Search, AIPS-98, Pittsburgh, PA.
9. Myers, K., and Lee, T. J. 1999. Generating qualitatively different plans through metatheoretic biases. In Proc. AAAI.
10. Myers, K. 2005. Metatheoretic plan summarization and comparison. In Proc. ICAPS WK. Mixed-initiative Planning and Scheduling.
11. Srivastava, B.; Vanhatalo, J.; and Koehler, J. 2005. Managing the life cycle of plans. In Proc. IAAI, pg 1569-1575.
12. Tate, A.; Dalton, J.; and Levine, J. 1998. Generation of multiple qualitatively different plan options. In Proc. AIPS-98, Pittsburgh. AIAI.