HS Problemlösen und Planen (WS 04/05)

Aktuelles

Thema / Topic

Im Seminar wird klassische und aktuelle Forschungsliteratur aus den Bereichen menschlichen Problemlösens und KI-Planung gelesen und diskutiert. Die Erarbeitung eines Vortragsthemas umfasst dabei das Lesen eines englischsprachigen Originalaufsatzes, das Lesen von Hintergrundinformation zur Aneignung von zum Verständnis des Aufsatzes notwendigen Grundlagen, sowie das Testen oder Illustrieren der im Artikel eingeführten Algorithmen. Das Vortragskonzept wird in einer Vorbesprechung mit dem Dozenten abgeklärt. Der Vortrag selbst sollte maximal 45 Minuten Länge haben, durch übersichtliche Folien unterstützt werden und in die nachfolgende Diskussion des Themas einstimmen. Thema
Ein Hauptseminar wird üblicherweise belegt, nachdem bereits Vorlesungen (mindestens KogSys I) aus dem Bereich besucht wurden. Für das WS 04/05 entfällt diese Voraussetzung. Voraussetzungen
In this seminar course, fundamental and current research papers of human problem solving and AI planning will be read and discussed. For obtaining course credits, an research paper has to be read together with additional papers introducing the topic and/or help to evaluate the paper. Furthermore, algorithms introduced in the paper should be tested or illustrated with a worked out example. The talk is prepared in a meeting with the lecturer. The talk should be of about 45 minutes length, should be supported by slides and give some questions or theses for starting a subsequent discussion of the persented work. Topic
A seminar course is usually elected after visiting introductory lectures (at least KogSys I). Prerequisites

Termine und Dozenten

Freitag, 14.1.05 (14-20),
Samstag, 15.1.05 (10-16),
F 380
Termin
Ute Schmid Dozentin

Anrechenbarkeit und Leistungsnachweise

Informationen auf der Seite Lehre der Gruppe CogSys im Überblick.

Literatur und Links

empfohlene Grundlagenliteratur / recommended basic literature
Interessantes im Web: (Menschliches) Problemlösen
Interessantes im Web: KI-Planung
Literaturrecherche im Web

Mögliche Vortragsthemen

(Menschliches) Problemlösen

Knoblich, G. (2002). Problemlösen und logisches Schließen. In: J. Müsseler and W. Prinz (Eds.), Allgemeine Psychologie (chap. 5a). Spektrum. Einführung in die Problemlösepsychologie
Newell, A., Simon, H. A. (1961). GPS: A program that simulates human thought. In H. Billings (Ed.), Lernende automaten (pp. 109-124). München: R. Oldenbourg. Reprinted in E. Feigenbaum and J. Feldman, editors, Computers and Thought, pages 279-293. McGraw-Hill, New York, 1963 General Problem Solver (GPS)
Anderson, J. R., Douglass, S. (2001). Tower of Hanoi: Evidence for the Cost of Goal Retrieval. Journal of Experimental Psychology: Learning, Memory, and Cognition, 27(6). Problemlösen in ACT
Altmann, E. M., Trafton, J. G. (2002). Memory for goals: An activation-based model. Cognitive Science, 26, 39-83. Zielgetriebenes Problemlösen
Bartl, Ch., Dörner, D. (.). Comparing the behaviour of PSI with human behaviour in the BioLab game. Memo 32. [PDF] Problemlösen in PSI
Novick, L. R., Holyoak, K. J. (1991). Mathematical problem solving by analogy. Journal of Experimental Psychology: Learning, Memory, and Cognition, 17(3), 398-415. Analoges Problemlösen

KI-Planung

Russell, S. & Norvig, P. (2003). Artificial Intelligence, A Modern Approach (2nd Ed.). Prentice Hall. (chap. 11) Introduction to AI-Planning
R. Fikes, N. Nilsson (1971). STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence, Vol. 2, pp 189-208. Reprinted in Readings in Planning, edited by J. Allen, J. Hendler, and A. Tate. Morgan Kaufmann Publishers, San Mateo, California, 1990. Reprinted in Computation and Intelligence: Collected Readings, edited by George F. Luger. AAAI Press, 1995. STRIPS
C. Cordell Green (1969). Application of Theorem Proving to Problem Solving. IJCAI 1969, 219-240. Theorem Proving and Problem Solving
H. Geffner (2000). Functional Strips: a more flexible language for planning and problem solving. In Jack Minker (Ed.), Logic-Based Artificial Intelligence, Kluwer. [PS] Functional Strips
A. Blum and M. Furst (1997). Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90:281--300. [PS] Graphplan
B. Bonet and H. Geffner (2001) Planning as Heuristic Search. Artificial Intelligence, Special issue on Heuristic Search. Vol 129 (1-2). [PS] Planning as Heuristic Search (HSP)
M. Veloso, J. Carbonell, M. A. Perez, D. Borrajo, E. Fink, and J. Blythe (1995). Integrating planning and learning: The Prodigy architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7(1):81-120. [PDF] Planning and Learning / Prodigy
M. Martin and H. Geffner (2000). Learning generalized policies in planning using concept languages. Proc. 7th Int. Conf. on Knowledge Representation and Reasoning (KR 2000). Colorado, 4/2000, Morgan Kaufmann. [PS] Policy Learning

Seminarplan, Folien und Ausarbeitungen

2 p.m. Human Problem Solving Jörg Faulhaber and Verena Jakob
[pdf] [Chess Expertise]
2:45 The General Problem Solver Simon Röschke and Christian Winter
[pdf] [References, Links, pdf]
3:30 Analogical Problem Solving Max Röglinger and Jürgen Wernsdörfer
[pdf] [example, pdf]
coffee break
4:30 PSI -- An autonomous problem solving agent Dominik Beierschoder and Florian Brosch
[ppt]
5:15 The planning game ``Puerto Rico'' and its implementation in Mandarax Andreas Schönberger (guest talk)
Puerto Rico Mandarax
7 p.m. pub meeting, Klosterbräu
Friday 14/1/05
(14-20)
10:00 Introduction to AI Planning Martin Kalisch and Stefan König
[pdf] [additional infos, pdf]
10:45 Strips Planning Stefanie Sieber and Norbert Wächtler
[pdf] [applet]
11:30 Functional Strips Christian Fleischmann and Julia Trommer
[pdf] [ppt] [Hanoi, pdf] [Spare Tire, pdf]
lunch break
1:30 Heuristic Search Planning Stefan Ender and Matthias Raps
[pdf] [additional infos]
2:15 Graphplan Jörg Mennicke and Jan Weber
[pdf] [ppt]
3:00 Planning for Real Word Problems Torsten Krieger and Steffen Rauch
[pdf] [Explanations of Concepts, pdf] [References, pdf] [SIPE2, pdf]
Saturday 15/1/05
(10 a.m. - 4 p.m.)