Lehrstuhl KI, Institut für Informatik, Universität Freiburg

MITTWOCHS von 11-12 Vorlesung und von 12-13 Übung in Raum 51/00-006

Diplomarbeiten, Studienarbeiten, Hiwijobs in der KI

DAS AKTUELLE SCRIPT

Übungsblätter

Hinweise zur Benutzung von Planungssystemen

1. Autonome, mobile Agenten, Sensoren/Aktoren, Handlungskontrolle, Handlungsplanung, Zielmanagement (BN 13.10.97)
   

   • S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Chapter 13 and 25, Prentice Hall, Englewood Cliffs, NJ, 1994

   • Flakey und Robocup Videos

2. Repräsentationsformalismen für Aktionen: STRIPS, Situationskalkül, temporale Logiken, nicht-monotone Formalismen (JK 15.-22.10.97)
   

   • R. E. Fikes and N. Nilsson, STRIPS: A new Approach to the Application of Theorem Proving to Problem Solving, Artificial Intelligence 2: 189-208, 1971

   • V. Lifschitz, On the Semantics of STRIPS, in Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, pp. 1-9, Timberline, OR, 1986

   • J. McCarthy and P. J. Hayes, Some Philosophical Problems from the Standpoint of Artificial Intelligence, in B. Meltzer and D. Mitchie (eds.), Machine Intelligence, Vol. 4, pp. 463-502, Edinburgh University Press, Edinburgh, UK, 1969

   • R. Reiter, The Frame Problem in the Situation Calculus: A simple Solution (sometimes) and a Completeness Result for Goal Regression, in V. Lifschitz (ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy,, pp.359-380, Academic Press, San Diego, CA, 1991

   • W. Stephan and S. Biundo, A New Logical Framework for Deductive Planning, in Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pp. 32-38, Chambery, France 1993

   • Nachschlagewerk: D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming -- Vol. 1: Logical Foundations, Oxford University Press, Oxford, UK 1993

1. Komplexität der STRIPS-Planung (BN 27.-29.10.97)

   • T. Bylander, The Computational Complexity of Propositional STRIPS Planning, Artificial Intelligence 69(1-2): 165-204

   • N. Gupta and D. S. Nau, Complexity Results for Blocks-World Planning, in Proceedings of the 9th National Conference of the American Association for Artificial Intelligence (AAAI-91), pp. 629-633, Anaheim, CA, 1991

   • K. Erol, D. S. Nau and V. S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence, 76(1-2): 75-88

2. SNLP/UCPOP (BN/JK 3.-5.11.97)

   • D. McAllester and D. Rosenblitt, Systematic Nonlinear Planning, in Proceedings of the 9th National Conference of the American Association for Artificial Intelligence (AAAI-91), pp. 634-639, Anaheim, CA, 1991

   • McAllester: Notes zu SNLP, unpublished notes

   • J. S. Penberthy and D. S. Weld, UCPOP: A Sound, Complete, Partial-Order Planner for ADL, in Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR-92),, pp. 103-114, Cambridge, MA, Morgan Kaufmann, 1992

3. GRAPHPLAN/IPP (JK 10.-19.11.97)

   • A. L. Blum and M. L. Furst, Fast Planning Through Planning Graph Analysis, Artificial Intelligence, 90(1-2): 279-298, 1997

   • J. Koehler, B. Nebel, J. Hoffmann and Y. Dimopoulos, Extending Planning Graphs to an ADL Subset, in Proc. European Conference on Planning 1997, Toulouse, France, Springer-Verlag, 1997

4. SATPLAN (BN 24.-26.11.97)

   • H. Kautz, D. McAllester and B. Selman, Encoding Plans in Propositional Logic, in Principles of Knowledge Representation and Reasoning: Proceedings of the 5th International Conference (KR-96), Cambridge, MA, Morgan Kaufmann, 1996

   • H. Kautz and B. Selman, Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search, in Proceedings of the 13th National Conference of the American Association for Artificial Intelligence (AAAI-96), Portland, OR, 1996

5. HTN Planen (JK 1.-3.12.97)

   • K. Erol, J. Hendler and D. S. Nau, UMCP: A sound and Complete Procedure for Hierarchical Task-Network Planning, in Proc. Second International Conf. on AI Planning Systems (AIPS-94), Seiten 249-254, AAAI Press, 1994

   • K. Erol, J. Hendler, D. S. Nau, and R. Tsuneto, A critical look at critics in HTN planning, in Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Morgan Kaufmann, San Francisco, 1995

   • K. Erol, J. Hendler, D. S. Nau: Complexity results for hierarchical task-network planning, Annals of Mathematics and Artificial Intelligence, 18: 69-93, 1996

6. Deduktives Planen (JK 8.-15.12.97)
   • Levesque/Reiter/Lesp�érance/Lin/Scherl: GOLOG: A Logic Programming Language for Dynamic Domains, in Journal of Logic Programming, 19,20:653-679, 1994
   • Lesperance/Levesque/Ruman: An Experiment in Using Golog to Build a Personal Banking Assistant, in Intelligent Agent Systems: Theoretical and Practical Issues LNAI 1209, Springer 1997
7. Planwiederverwendung (JK 17.-22.12.97)
   • Koehler: Correct Modification of Complex Plans, in Proceedings of the 11th European Conference on Artificial Intelligence, Seiten 605-609, John Wiley \& Sons, Chichester, New York 1994
   • Nebel/Koehler: Plan Reuse versus Plan Generation: A theoretical and empirical Analysis, in Artificial Intelligence, 76:427-454, 1995

1. Probabilistisches Planen
   • Kushmerick/Hanks/Weld: An Algorithm for Probabilistic Planning, in Artificial Intelligence, 76:239-286, 1995
2. Komplexit�ät der probabilistischen Planung
   • Goldsmith/Littman/Mundhenk: The complexity of plan existence and evaluation in probabilistic domains
3. MDP's/POMDP's
   • Russell/Norvig: AI - A Modern Approach, Kapitel 17
   • Kaelbling/Littman/Cassandra: Planning and Acting in Partially Observable Stochastic Domains

1. Verhaltensbasierte Ansätze
   • Chapman/Agre: What Are Plans For?
   • Maes: Designing Autonomous Agents: Theory and Practice from Biology to Engineering and back. MIT Press Cambridge, 1994
   • Brooks: A Robust Layered Control System for a Mobile Robot, in Readings in Uncertain Reasoning, Ed. G. Shafer and J. Pearl, Seiten 204-213, Morgan Kaufman San Francisco, 1990
   • Saffiotti/KonoligeRuspini/Konolige: A multivalued-logic approach to integrating planning and control , in Artificial Intelligence, 76:, 1995
2. Universelle Pläne und ihre Komplexität (JK 2.2.-9.2.98)
   • Schoppers: Universal Plans for Reactive Robots in Unpredictable Environments, in Proceedings of the 10th International Joint Conference on Artificial Intelligence, Seiten 1039-1046, Morgan Kaufman, San Francisco, 1987
   • Schoppers/Ginsberg/Chapman: Diskussion in AI Magazine Winter 1989
   • Bart Selman: Near-Optimal Plans, Tractability, and Reactivity, in Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Seiten 521-529, Morgan Kaufman, San Francisco, 1994
   • Jonson/Bäckström: On the Size of Reactive Plans, in Proceedings of the 14th National Conference of the American Association for Artificial Intelligence, AAAI Press, 1996

1. Ausblick: offene Probleme (Diplomarbeitsthemen) (JK/BN 11.2.98)