Reading Group on Planning and Search
Organizer: Prof. Dr. Malte Helmert
Time and Place
Time: Wednesday 15:00-16:00
Place: Room 052 00-016 (meeting room of the
Foundations of Artificial Intelligence and Software Engineering groups)
Description
In the reading group, we discuss current and classical research papers. The emphasis lies on work on action planning, search and related areas, but interesting papers from other areas are welcome. All participants can make recommendations for the reading list, from which one or more papers are selected for each meeting. Participants read the selected papers individually in preparation for the meeeting and discuss them during the meeting.
The target audience of the reading group consists of academic staff and interested guests, comparable to a staff seminar or a seminar in a graduate school. Students may feel free to participate, but should be aware that no ECTS points can be earned for the reading group.
Schedule
| Date | Topic | Contact |
|---|---|---|
| 06.10.2010 |
Sridhar Hannenhalli and Pavel A. Pevzner. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. In Journal of the ACM, 46:1(1-27), 1999. (PDF) |
Prof. Dr. Malte Helmert |
| 13.10.2010 |
Shahab Jabbari Arfaee, Sandra Zilles and Robert C. Holte. Bootstrap Learning of Heuristic Functions. In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 52-60, AAAI Press 2010. (PDF) |
Dr. Gabriele Röger |
| 20.10.2010 |
Jussi Rintanen. Heuristics for Planning with SAT. In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP 2010), LNCS 6308, pp. 414-428, Springer-Verlag 2010. (PDF) Jussi Rintanen. Heuristic Planning with SAT: Beyond Strict Depth-First Search. In Proceedings of the Twenty-Third Australasian Joint Conference on Artificial Intelligence (AI 2010), 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 27.10.2010 |
Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search; Sections 1-3 (pp. 1031-1053). In Artificial Intelligence, 170(12-13):1031-1080, 2006. (PDF) |
Dr. Robert Mattmüller |
| 03.11.2010 | postponed | |
| 10.11.2010 |
Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search; Remaining sections. In Artificial Intelligence, 170(12-13):1031-1080, 2006. (PDF) |
Dr. Robert Mattmüller |
| 17.11.2010 | postponed | |
| 24.11.2010 |
Bradford Larsen, Ethan Burns, Wheeler Ruml and Robert C. Holte. Searching Without a Heuristic: Efficient Use of Abstraction. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 114-120, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 01.12.2010 |
Christopher Raphael. Coarse-to-Fine Dynamic Programming. In IEEE Transactions on Pattern Analysis and Machine Intelligence 23(12):1379-1390, 2001. (PDF) |
Prof. Dr. Malte Helmert |
| 08.12.2010 |
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann and Kevin Tierney. ISAC — Instance-Specific Algorithm Configuration. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 751-756, IOS Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 15.12.2010 |
Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, and Thomas Stützle. ParamILS: An Automatic Algorithm Configuration Framework. In Journal of Artificial Intelligence Research, 36:267-306, 2009. (PDF) |
Dr. Robert Mattmüller |
| 22.12.2010 |
Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. SATzilla: Portfolio-based Algorithm Selection for SAT. In Journal of Artificial Intelligence Research, 32:565-606, 2008. (PDF) |
Dr. Robert Mattmüller |
| 12.01.2011 |
Lin Xu, Holger H. Hoos and Kevin Leyton-Brown. Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 210-216, AAAI Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 19.01.2011 | postponed due to IPC deadline | |
| 26.01.2011 |
Vidal Alcázar, Daniel Borrajo and Carlos Linares López. Using Backwards Generated Goals for Heuristic Planning. In Proceedings of the Twentieth Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 2-9, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 02.02.2011 |
Ruoyun Huang, Yixin Chen and Weixiong Zhang. A Novel Transition Based Encoding Scheme for Planning as Satisfiability. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 89-94, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 09.02.2011 | postponed due to AAAI deadline | |
| 16.02.2011 |
Daniel Delling, Peter Sanders, Dominik Schultes and Dorothea Wagner. Engineering Route Planning Algorithms. In Algorithmics of Large and Complex Networks, LNCS 5515, pp. 117-139, Springer 2009. (PDF) |
Prof. Dr. Malte Helmert |
| 23.02.2011 |
Robert Geisberger and Dennis Schieferdecker. Heuristic Contraction Hierarchies with Approximation Guarantee. In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 31-38, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 02.03.2011 |
Detlef Sieling and Ingo Wegener. NC-Algorithms for Operations on Binary Decision Diagrams. In Parallel Processing Letters 3(1):3-12, 1993. (PDF) |
Prof. Dr. Malte Helmert |
| 09.03.2011 |
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein and Ariel Felner. Search Space Reduction Using Swamp Hierarchies. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 155-160, AAAI Press 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 16.03.2011 |
Marijn Heule and Toby Walsh. Symmetry within Solutions. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 77-82, AAAI Press 2010. (PDF) |
Prof. Dr. Jan-Georg Smaus |
| 23.03.2011 |
Teresa M. Breyer and Richard E. Korf. 1.6-Bit Pattern Databases. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 39-44, AAAI Press 2010. (PDF) |
Prof. Dr. Jan-Georg Smaus |
| 30.03.2011 |
Blai Bonet. Efficient Algorithms to Rank and Unrank Permutations in Lexicographic Order. In Proceedings of the Workshop on Search in Artificial Intelligence and Robotics at AAAI 2008. (PDF) |
Dr. Robert Mattmüller |
Further Information
- Reading group website for SS 2010
- Reading group website for WS 2009/2010
- Reading group website for SS 2009
If you have any questions, please do not hesitate to contact Prof. Dr. Malte Helmert.