Reading Group on Planning and Search
Organizer: Dr. Robert Mattmüller
Time and Place
Time: Tuesday 14:00h
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 |
|---|---|---|
| 05.04.2012 |
Patrik Haslum. Incremental Lower Bounds for Additive Cost Planning Problems. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear. (PDF) |
Dr. Robert Mattmüller |
| 12.04.2012 |
Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Counterexample-guided Planning. In Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence (UAI 2005), pp. 104-111. (PDF) |
Dr. Robert Mattmüller |
| 19.04.2012 |
Ryan Luna and Kostas E. Bekris. Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 294-300, 2011. (PDF) Ryan Luna and Kostas E. Bekris. Efficient and complete centralized multi-robot path planning. In Proceedings of the 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2011), pp. 3268-3275, 2011. (PDF) |
Prof. Dr. Malte Helmert |
| 26.04.2012 |
Richard M. Wilson. Graph Puzzles, Homotopy, and the Alternating Group. Journal of Combinatorial Theory, Series B, 16:86-96, 1974. (PDF) |
Prof. Dr. Malte Helmert |
| 03.05.2012 |
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessandro Saetti and Nathaniel Waisbrot. Combining Domain-Independent Planning and HTN Planning: The Duet Planner. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 573-577, IOS Press 2008. (PDF) |
Dr. Robert Mattmüller |
| 10.05.2012 |
Patrik Haslum. Narrative Planning: Compilations to Classical Planning. Journal of Artificial Intelligence Research, 2012. Accepted for publication. (PDF) Mark O. Riedl and R. Michael Young. Narrative Planning: Balancing Plot and Character. Journal of Artificial Intelligence Research 39:217-268, 2010. (PDF) |
Prof. Dr. Malte Helmert |
| 17.05.2012 | no meeting (Ascension Day) | |
| 24.05.2012 |
Niklas Eén and Niklas Sörensson. An Extensible SAT-solver. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), 2003 (extended version). (PDF) |
Prof. Dr. Malte Helmert |
| 31.05.2012 |
Martin Davis, George Logemann and Donald Loveland. A Machine Program for Theorem-Proving. Communications of the ACM 5(7):394-397, 1962. (PDF) |
Prof. Dr. Malte Helmert |
| 07.06.2010 | no meeting (Corpus Christi) | |
| 14.06.2012 |
Neil Burch and Robert Holte. Automatic Move Pruning Revisited. In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), 2012. (PDF) Raz Nissim, Udi Apsel and Ronen Brafman. Tunneling and Decomposition-Based State Reduction for Optimal Planning. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), 2012. (PDF) |
Prof. Dr. Malte Helmert |
| 21.06.2012 |
Peter Gregory, Derek Long, Maria Fox, J. Christopher Beck. Planning Modulo Theories: Extending the Planning Paradigm. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (to appear). (PDF) |
Dr. Gabriele Röger |
| 28.06.2011 | no meeting (ICAPS 2012) | |
| 05.07.2012 |
Agostino Dovier, Carla Piazza and Alberto Policriti. An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science 311:221-256, 2004. (PDF) |
Prof. Dr. Malte Helmert |
| 12.07.2012 |
Erez Karpas and Carmel Domshlak. Optimal Search with Inadmissible Heuristics. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling. (PDF) |
Dr. Thomas Keller |
| 19.07.2012 |
Avitan Gefen and Ronen I. Brafman. Pruning Methods for Optimal Delete-Free Planning. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling. (PDF) |
Martin Wehrle |
| 26.07.2012 |
Emil Keyder, Silvia Richter, and Malte Helmert. Sound and Complete Landmarks for And/Or Graphs. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 335-340, IOS Press 2010. (PDF) |
Dr. Robert Mattmüller |
| 02.08.2012 |
Jordan Thayer, Roni Stern, and Levi Lelis. Are We There Yet? -- Estimating Search Progress. In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), AAAI Press 2012. (PDF) |
Dr. Robert Mattmüller |
| 09.08.2012 |
Ethan Burns, Matthew Hatem, Michael J. Leighton and Wheeler Ruml. Implementing Fast Heuristic Search Code. In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), pp. 25-32, AAAI Press 2012. (PDF) |
Prof. Dr. Malte Helmert |
| 16.08.2012 |
Blai Bonet. Deterministic POMDPs Revisited. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI 2009), pp. 59-66, 2009. (PDF) |
Dr. Gabriele Röger |
| 23.08.2012 |
Hootan Nakhost and Martin Müller. A Theoretical Framework for Studying Random Walk Planning. In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), pp. 57-64, AAAI Press 2012. (PDF) |
Prof. Dr. Malte Helmert |
| 30.08.2012 | no meeting (ECAI 2012) | |
| 06.09.2012 |
Levi H. S. Lelis, Sandra Zilles and Robert C. Holte. Fast and Accurate Predictions of IDA*'s Performance. In Proceedings of the Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), pp. 514-520, AAAI Press 2012. (PDF) |
Prof. Dr. Malte Helmert |
| 13.09.2012 |
Hermann Kaindl and Gerhard Kainz. Bidirectional Heuristic Search Reconsidered. Journal of Artificial Intelligence Research (JAIR) 7:283-317, 1997. (PDF) |
Prof. Dr. Malte Helmert |
| 18.09.2012 |
Giovanni Manzini. BIDA*: an improved perimeter search algorithm. Artificial Intelligence 75:347-360, 1995. (PDF) |
Prof. Dr. Malte Helmert |
| 25.09.2012 |
Karem A. Sakallah and João Marques-Silva. Anatomy and Empirical Evaluation of Modern SAT Solvers. Bulletin of the EATCS 103:96-121, 2011. (PDF) |
Prof. Dr. Malte Helmert |
Further Information
- Reading group website for WS 2011/2012
- 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 Dr. Robert Mattmüller.