Reading Group on Planning and Search
Organizer: Prof. Dr. Malte Helmert
Note
Starting from the beginning of the summer term (April 1st), please refer to the SS 2012 reading group page.
Time and Place
Time: Thursday 14:00-15: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 |
|---|---|---|
| 04.10.2011 | no meeting (KI conference) | |
| 11.10.2011 |
Karthekeyan Chandrasekaran, Richard Karp, Erick Moreno-Centeno and Santosh Vempala. Algorithms for Implicit Hitting Set Problems. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 614-629. (PDF) |
Prof. Dr. Malte Helmert |
| 19.10.2011 25.10.2011 |
Alfonso Gerevini, Alessandro Saetti and Ivan Serina. An Approach to Efficient Planning with Numerical Fluents and Multi-Criteria Plan Quality. In Artificial Intelligence, 172(8-9):899-944, 2008. (PDF) |
Prof. Dr. Malte Helmert |
| 02.11.2011 |
Carla P. Gomes, Bart Selman, Nuno Crato and Henry Kautz. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. In Journal of Automated Reasoning 24: 67-100, 2000. (PDF) Carla P. Gomes, Bart Selman and Henry Kautz. Boosting Combinatorial Search Through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 431-437, 1998. (PDF) |
Prof. Dr. Malte Helmert |
| 08.11.2011 |
Nir Lipovetzky and Hector Geffner. Searching for Plans with Carefully Designed Probes. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011), pp. 154-161, 2011. (PDF) |
Moritz Göbelbecker |
| 15.11.2011 |
Nir Pochter, Aviv Zohar and Jeffrey S. Rosenschein. Exploiting Problem Symmetries in State-Based Planners. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 1004-1009, AAAI Press 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 22.11.2011 |
Tommi Junttila and Petteri Kaski. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX 2007). (PDF) |
Dr. Robert Mattmüller |
| 29.11.2011 |
Doron Peled. All from One, One for All: on Model Checking Using Representatives. In Proceedings of the 5th International Conference on Computer Aided Verification (CAV 1993), pp. 409-423. (PDF) |
Prof. Dr. Malte Helmert |
| 06.12.2011 |
Jaco Geldenhuys, Henri Hansen and Antti Valmari. Exploring the Scope for Partial Order Reduction . In Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis (ATVA 2009), pp. 39-53. (PDF) |
Prof. Dr. Malte Helmert |
| 13.12.2011 | no meeting (ICAPS deadline) | |
| 20.12.2011 |
Antti Valmari and Henri Hansen. Can Stubborn Sets Be Optimal?. In Proceedings of the 31st International Conference on Applications and Theory of Petri Nets (PETRI NETS 2010), pp. 43-62. (PDF) |
Prof. Dr. Malte Helmert |
| 27.12.2011 | no meeting (Christmas break) | |
| 03.01.2012 | no meeting (Christmas break) | |
| 11.01.2012 |
Larry A. Taylor and Richard E. Korf. Pruning Duplicate Nodes in Depth-First Search. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI 1993), pp. 756-761, 1993. (PDF) Larry A. Taylor. Pruning Duplicate Nodes in Depth-First Search. Technical Report CSD-920049, University of California, Los Angeles, USA, 1992. (PDF) Neil Burch and Robert C. Holte. Automatic Move Pruning in General Single-Player Games. In Proceedings of the Fourth International Symposium on Combinatorial Search (SoCS 2011), pp. 31-38, 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 18.01.2012 |
Blai Bonet and Héctor Geffner. Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and its application to MDPs. In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS 2006), pp. 42-51. (PDF) |
Prof. Dr. Malte Helmert |
| 24.01.2012 16.02.2012 |
Andrew Barto, Steven Bradtke and Satinder Singh. Learning to act using real-time dynamic programming. In Artificial Intelligence, Volume 76, Issues 1–2, pp. 35-74, 1995. (PDF) |
Dr. Thomas Keller |
| 23.02.2012 |
Blai Bonet and Héctor Geffner. Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS 2003), pp. 12-31. (PDF) |
Dr. Thomas Keller |
| 01.03.2012 |
H. Brendan Mcmahan and Maxim Likhachev and Geoffrey J. Gordon. Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), pp. 569-576. (PDF) |
Dr. Thomas Keller |
| 08.03.2012 |
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini, Subbarao Kambhampati, Minh Binh Do, Ivan Serina. Domain Independent Approaches for Finding Diverse Plans. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2016-2022. (PDF) |
Dr. Gabriele Röger |
| 15.03.2012 |
Reuven Bar-Yehuda. One for the Price of Two: A Unified Approach for Approximating Covering Problems. In Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 1998), pp. 49-62. (PDF) |
Prof. Dr. Malte Helmert |
| 22.03.2012 |
Emil Keyder, Jörg Hoffmann and Patrik Haslum. Semi-Relaxed Plan Heuristics. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear. (PDF) |
Prof. Dr. Malte Helmert |
| 29.03.2012 |
Patrik Haslum, John Slaney and Sylvie Thiébaux. Minimal Landmarks for Optimal Delete-Free Planning. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear. (PDF) |
Prof. Dr. Malte Helmert |
Further Information
- Reading group website for SS 2011
- Reading group website for WS 2010/2011
- 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.