Coming up with good excuses: What to do when no plan can be found

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 81-88

  Göbelbecker, Moritz ^a   Keller, Thomas ^a   Eyerich, Patrick ^a   Brenner, Michael ^a   Nebel, Bernhard ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT ARCHITECTURES; PLANNED ACTION;

PLANNING;

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

References (15)

1. + planning. Comp. Intell. 11(4):625-655.
2. Brenner, M., and Nebel, B. 2009. Continual planning and acting in dynamic multiagent environments. JAAMAS 19(3):297-331.
3. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
4. Edelkamp, S., and Hoffmann, J. 2004. PDDL2.2: The language for the classical part of the 4th international planning competition. Technical Report 195, Univ. Freiburg, Institut für Informatik, Freiburg, Germany.
5. Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. Jour. ACM 42(1):3-42.
6. Erol, K.; Nau, D. S.; and Subrahmanian, V. S. 1995. Complexity, decidability and undecidability results for domain-independent planning. AIJ 76(1-2):75-88.
7. Gärdenfors, P. 1986. Belief revision and the Ramsey test for conditionals. The Philosophical Review XCV (1):81-93.
8. Geffner, H. 2000. Functional STRIPS: a more flexible language for planning and problem solving. In Minker, J., ed., Logic-Based Artificial Intelligence. Dordrecht, Holland: Kluwer.
9. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In ICAPS 2009, 162-169.
10. Helmert, M. 2006. The fast downward planning system. JAIR 26:191-246.
11. Lewis, D. K. 1973. Counterfactuals. Cambridge, MA: Harvard Univ. Press.
12. Plöger, P.-G.; Pervölz, K.; Mies, C.; Eyerich, P.; Brenner, M.; and Nebel, B. 2008. The DESIRE service robotics initiative. KI 4:29-32.
13. Reiter, R. 1987. A theory of diagnosis from first principles. AIJ 32(1):57-95.
14. Savitch, W. J. 1980. Relations between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences 4:177-192.
15. Smith, D. E. 2004. Choosing objectives in over-subscription planning. In ICAPS 2004, 393-401.