Approximation properties of planning benchmarks

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 585-589

  Helmert, Malte ^a   Mattmüller, Robert ^a   Röger, Gabi ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION PROPERTIES; CLASSICAL PLANNING; COMPLETE CLASSIFICATION; INTERNATIONAL PLANNING COMPETITIONS; OPTIMAL PLAN; OPTIMAL PLANNING; PLANNING DOMAINS;

EID: 84882165117     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (13)

1. Giorgio Ausiello, Pierluigi Crescenzi, Giorgo Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi, Complexity and Approximation, Springer-Verlag, 1999.
2. Fahiem Bacchus, 'The AIPS'00 planning competition', AI Magazine, 22(3), 47-56, (2001).
3. + planning', Computational Intelligence, 11(4), 625-655, (1995).
4. Naresh Gupta and Dana S. Nau, 'On the complexity of blocks-world planning', Artificial Intelligence, 56(2-3), 223-254, (1992).
5. Malte Helmert, 'Complexity results for standard benchmark domains in planning', Artificial Intelligence, 143(2), 219-262, (2003).
6. Malte Helmert, 'New complexity results for classical planning benchmarks', in Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), eds., Derek Long and Stephen Smith. AAAI Press, (2006). To appear.
7. Jörg Hoffmann and Stefan Edelkamp, 'The deterministic part of IPC-4: An overview', Journal of Artificial Intelligence Research, 24, 519-579, (2005).
8. Peter Jonsson and Christer Bäckström, 'State-variable planning under structural restrictions: Algorithms and complexity', Artificial Intelligence, 100(1-2), 125-176, (1998).
9. Derek Long and Maria Fox, 'The 3rd International Planning Competition: Results and analysis', Journal of Artificial Intelligence Research, 20, 1-59, (2003).
10. Drew McDermott, 'The 1998 AI Planning Systems competition', AI Magazine, 21(2), 35-55, (2000).
11. Christos H. Papadimitriou and Mihalis Yannakakis, 'Optimization, approximation, and complexity classes', Journal of Computer and System Sciences, 43, 425-440, (1991).
12. Bart Selman, 'Near-optimal plans, tractability, and reactivity', in Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR'94), eds., Jon Doyle, Erik Sandewall, and Pietro Torasso, 521-529, Morgan Kaufmann, (1994).
13. John Slaney and Sylvie Thiébaux, 'Blocks World revisited', Artificial Intelligence, 125, 119-153, (2001).