Institut für Informatik, Universität Freiburg

Hauptseminar Handlungsplanung - Themen und Literatur


Falls Sie an diesem Seminar teilnehmen wollen, schicken Sie mir bitte eine e-mail, damit wir einen Besprechungstermin ausmachen können.

Die mit einem roten Punkt markierten Themen sind bereits vergeben.


  1. Planungsformalismen

    1. STRIPS und ADL
      Richard E. Fikes and Nils Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
      Vladimir Lifschitz. On the semantics of STRIPS. In M. P. Georgeff and A. Lansky, editors, Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, pages 1-9, Timberline, OR, June 1986. Morgan Kaufmann.
      Edwin P. D. Pednault. Formulating multiagent, dynamic-world problems in the classical planning framework. In M. P. Georgeff and A. Lansky, editors, Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, pages 47-82, Timberline, OR, June 1986. Morgan Kaufmann.
      Edwin P. D. Pednault. Generalizing nonlinear planning to handle complex goals and actions with context-dependent effects. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 240-245, Sydney, Australia, August 1991. Morgan Kaufmann.
  2. Planertypen

    1. Deduktives Planen
      Cordell Green. Application of theorem proving to problem solving. In James F. Allen, James Hendler, and Austin Tate, editors, Readings in Planning, pages 67-87. Morgan Kaufmann, San Mateo, CA, 1990. An abridged version appeared in Proceedings of the 1st International Joint Conference on Artificial Intelligence, Washington, DC, August 1969.
      Susanne Biundo, Dietmar Dengler, and Jana Koehler. Deductive planning and plan reuse in a command language environment. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 628-632, Vienna, Austria, August 1992. Wiley.
    2. Moderne nicht-lineare Planer SNLP, UCPOP
      David McAllester and David Rosenblitt. Systematic nonlinear planning. In Proceedings of the 9th National Conference of the American Association for Artificial Intelligence, pages 634-639, Anaheim, CA, July 1991. MIT Press.
      J. Scott Penberthy and Daniel S. Weld. UCPOP: A sound, complete, partial order planner for ADL. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference, pages 103-114, Cambridge, MA, October 1992. Morgan Kaufmann.
    3. Hierarchisches Planen UMCP
      Kutluhan Erol, Dana S. Nau, and James A. Hendler. HTN planning: Complexity and expressivity. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, Seattle, WA, July 1994. MIT Press.
      Kutluhan Erol, Dana S. Nau, and James A. Hendler. UMCP: A sound and complete planning procedure for hierarchical task-network planning. In K. Hammond, editor, Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, Chicago, IL, 1994. AAAI Press, Menlo Park.
      Kutluhan Erol, Dana S. Nau, James A. Hendler, and R. Tsuneto. A critical look at critics in HTN planning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, August 1995.
  3. Evaluierung verschiedener Ansätze

    1. linear vs. nicht-linear
      Steve Minton, John L. Bresnia, Mark Drummond. Total-Order and Partial-Order Planning: A Comparative Analysis. Journal of Artificial Intelligence Research, 1994.
    2. Heuristiken bei nicht-linearen Plannern
      Steve Minton, John Bresnia, and Mark Drummond. Commitment strategies in planning: A comparative analysis. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 259-265, Sydney, Australia, August 1991. Morgan Kaufmann.
      D. Joslin and Martha E. Pollack. Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, pages 1004-1009, Seattle, WA, July 1994. MIT Press.
    3. Abstraktionstechniken
      Craig A. Knoblock. Automatically Generating Abstractions for Planning. Artificial Intelligence 68 (2), 1994.
      Christer Bäckström and Peter Jonsson. Planning with abstraction hierarchies can be exponentially less efficient. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, August 1995.
  4. Komplexität des Planens

    1. unabhängig von der Domäne
      Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
    2. domänenabhängig
      Naresh Gupta and Dana S. Nau. On the complexity of blocks-world planning. Artificial Intelligence, 56(2):223-254, 1992.
      Bart Selman. Near-optimal plans, tractability, and reactivity. In J. Doyle, E. Sandewall, and P. Torasso, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 4th International Conference, pages 521-529, Bonn, Germany, May 1994. Morgan Kaufmann.
  5. Planung und Steuerung

    1. Fuzzy-Steuerung und Langzeitpläne
      Alessandro Saffioti, Kurt Konolige, and Enrique H. Ruspini. A multivalued logic approach to integrating planning and control. Artificial Intelligence, 76(1-2):481-526, July 1995.
    2. Planung und Programmierung
      Richard Levinson. A general programming language for unified planning and control. Artificial Intelligence, 76(1-2):319-375, July 1995.
  6. Planwiederverwendung

    1. SNLP und Planwiederverwendung
      Steve Hanks and Daniel S. Weld. Systematic adaptation for case-based planning. In Proceedings of the 1st International Conference on Artificial Intelligence Planning Systems, pages 96-105, Washington, D.C., 1992. Morgan Kaufmann.
      Steve Hanks and Daniel S. Weld. A Domain-Independant Algorithm for Plan Adaption. Journal of AI Research, 48 pages, Fall 1994.
    2. Komplexität und empirische Evaluation
      Bernhard Nebel and Jana Koehler. Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence, 76(1-2):427-454, 1995.
  7. Planen unter Unsicherheit

    1. Partiell beobachtbare Markov-Entscheidungsprozesse
      Lelie Pack Kaelbling, Michael L. Littman, and Anthony R. Cassandra. Partially observable markov decision processes for artificial intelligence. In I. Wachsmuth, C.-R. Rollinger, and W. Brauer, editors, KI-95: Advances in Artificial Intelligence, pages 1-18, Bielefeld, Germany, 1995. Springer-Verlag.
      Leslie Pack Kaelbling, Michael L. Littman and Anthony R. Cassandra. Planning and Acting in Partially Observable Stochastic Domains. Unpublished.
    2. Effiziente Behandlung von Markov-Prozessen
      Thomas Dean, Leslie Pack Kaelbling, Jak Kirman, and Ann Nicholson. Planning under time constraints in stochastic domains. Artificial Intelligence, 76(1-2):35-74, July 1995.
    3. Probabilistische Versionen nicht-linearen Planens
      Nicholas Kushmerick, Steve Hanks, and Daniel S. Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76(1-2):239-286, July 1995.
      Denise Draper, Steve Hanks, and Daniel S. Weld. Probabilistic planning with information gathering and contingent execution. In K. Hammond, editor, Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, pages 31-36, Chicago, IL, 1994. AAAI Press, Menlo Park.
    4. Pfadplanung mit Landmarken unter Unsicherheit
      A. Lazanas and J.-C. Latombe. Motion planning with uncertainty: a landmark approach. Artificial Intelligence 76(1-2): 287-317, July 1995.


Bernhard Nebel, 5. Juli 1996