Lesegruppe Handlungsplanung und Suche
Organisator: Prof. Dr. Malte Helmert
Hinweis
Ab Beginn des Wintersemesters am 1. Oktober verweisen wir auf die Lesegruppe im WS 2011/2012.
Zeit und Ort
Zeit: Dienstag 15:00-16:00 Uhr (s.t.)
Ort: Raum 052 00-016 (Besprechungsraum der Arbeitsgruppen
Grundlagen der Künstlichen Intelligenz und Softwaretechnik)
Beschreibung
In der Lesegruppe werden aktuelle und klassische Forschungsarbeiten diskutiert. Der Schwerpunkt liegt auf den Gebieten Handlungsplanung, Suche und verwandten Gebieten, aber interessante Arbeiten aus anderen Bereichen sind willkommen. Jeder Teilnehmer kann Lesevorschläge einbringen, von denen dann zu jedem Termin ein oder mehrere Arbeiten ausgewählt werden. Die ausgewählten Arbeiten werden von den Teilnehmern vor dem jeweiligen Besprechungstermin gelesen und dann in der Gruppe besprochen.
Die Zielgruppe der Veranstaltung sind Mitarbeiter und interessierte Gäste, vergleichbar einem Oberseminar oder einem Seminar in einem Graduiertenkolleg. Studenten dürfen gerne teilnehmen, können in dieser Veranstaltung aber keine ECTS-Punkte erwerben.
Zeitplan
| Termin | Thema | Ansprechpartner |
|---|---|---|
| 06.04.2011 |
Shaowei Cai, Kaile Su and Qingliang Chen. EWLS: A New Local Search for Minimum Vertex Cover. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 45-50, AAAI Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 13.04.2011 | kein Treffen (Oberseminar) | |
| 20.04.2011 |
Edsger W. Dijkstra. A Note on Two Problems in Connexion with Graphs. In Numerische Mathematik, 1:269-271, 1959. (PDF) |
Prof. Dr. Malte Helmert |
| 27.04.2011 |
Jörg Hoffmann, Ingo Weber and Frank Michael Kraft. SAP Speaks PDDL. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 1096-1101, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 04.05.2011 |
Chu-Min Li and Zhe Quan. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 128-133, AAAI Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 10.05.2011 |
Siddharth Srivastava, Neil Immerman and Shlomo Zilberstein. Computing Applicability Conditions for Plans with Loops: New Results. Preproceedings of 6th Workshop on Model Checking and Artificial Intelligence, held at AAAI 2010, Atlanta. (PDF) |
Prof. Dr. Malte Helmert |
| 17.05.2011 |
David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie and Barbara M. Smith. Symmetry Definitions for Constraint Satisfaction Problems. Constraints 11(2-3):115-137, 2006. (PDF) |
Prof. Dr. Malte Helmert |
| 24.05.2011 |
Yixin Chen, You Xu and Guohui Yao. Stratified Planning. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1665-1670, 2009. (PDF) |
Prof. Dr. Malte Helmert |
| 31.05.2011 |
Yixin Chen and Guohui Yao. Completeness and Optimality Preserving Reduction for Planning. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1659-1664, 2009. (PDF) |
Prof. Dr. Malte Helmert |
| 07.06.2011 | kein Treffen (ACAI Summer School) | |
| 14.06.2011 | kein Treffen (ICAPS) | |
| 21.06.2011 |
You Xu. Partial Order Reduction for Planning. M.Sc. Thesis, School of Engineering of the Washington University, 2009. (PDF) |
Prof. Dr. Malte Helmert |
| 28.06.2011 |
Avitan Gefen and Ronen I. Brafman. The Minimal Seed Set Problem. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011), pp. 319-322, 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 05.07.2011 |
Amanda Coles and Andrew Coles. Completeness-Preserving Pruning for Optimal Planning. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 965-966, 2010. (PDF) Amanda Coles and Andrew Coles. Problem-Structure-Based Pruning for Cost-Optimal Planning. Technical Report, University of Strathclyde, 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 12.07.2011 |
Jason Wolfe and Stuart Russell. Bounded Intention Planning. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 19.07.2011 | kein Treffen (IJCAI) | |
| 26.07.2011 |
Jeffrey Long, Nathan R. Sturtevant, Michael Buro and Timothy Furtak. Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 134-140, AAAI Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 02.08.2011 |
J. N. Hooker. Needed: An Empirical Science of Algorithms. In Operations Research 42, pp. 201-212, 1994. (PDF) J. N. Hooker. Testing Heuristics: We Have It All Wrong. In Journal of Heuristics 1, pp. 33-42, 1995. (PDF) |
Dr. Robert Mattmüller |
| 09.08.2011 |
Mehdi Samadi, Ariel Felner and Jonathan Schaeffer. Learning from Multiple Heuristics. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 357-362, AAAI Press 2008. (PDF) |
Prof. Dr. Malte Helmert |
| 16.08.2011 |
Shahab Jabbari Arfaee, Sandra Zilles and Robert C. Holte. Learning Heuristic Functions for Large State Spaces. To appear in Artificial Intelligence, 2011. (PDF of preprint) |
Prof. Dr. Malte Helmert |
| 23.08.2011 |
Neha Rungta and Eric G. Mercer. Generating Counter-Examples Through Randomized Guided Search. In Proceedings of the 14th International SPIN Workshop (SPIN 2007), pp. 39-57, 2007. (PDF) |
Prof. Dr. Malte Helmert |
| 30.08.2011 |
Tatsuya Imai and Akihiro Kishimoto. A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 985-991, 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 06.09.2011 |
Vidal Alcázar, Manuela Veloso and Daniel Borrajo. Adapting a Rapidly-Exploring Random Tree for Automated Planning. In Proceedings of the Fourth International Symposium on Combinatorial Search (SoCS 2011), pp. 2-9, AAAI Press 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 13.09.2011 | kein Treffen (AVACS-Begehung) | |
| 21.09.2011 |
Jussi Rintanen. Regression for Classical and Nondeterministic Planning. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 568-572, 2008. (PDF) Jussi Rintanen. A Planning Algorithm not based on Directional Search. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 617-624, 1998. (PDF) |
Prof. Dr. Malte Helmert |
| 27.09.2011 |
Saddek Bensalem, Yassine Lakhnech and Hassen Saïdi. Powerful Techniques for the Automatic Generation of Invariants. In Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), pp. 323-335, 1996. (PDF) |
Prof. Dr. Malte Helmert |
Weitere Informationen
Bei Fragen wenden Sie sich bitte an Prof. Dr. Malte Helmert.