Uni-Logo

Reading Group on Planning and Search

Organizer: Dr. Robert Mattmüller

Time and Place

Time: Tuesday 16: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
02.10.2012 Felipe Trevizan and Manuela Veloso.
Short-Sighted Stochastic Shortest Path Problems.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). (PDF)
Johannes Aldinger
09.10.2012 Blai Bonet and Hector Geffner.
Action Selection for MDPs: Anytime AO* Versus UCT.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012). (PDF)
Dr. Patrick Eyerich
16.10.2012 Guy Gueta, Cormac Flanagan, Eran Yahav and Mooly Sagiv.
Cartesian Partial-Order Reduction.
In Proceedings of the 14th International SPIN Workshop (SPIN 2007), pp. 95-112, 2007. (PDF)
Prof. Dr. Malte Helmert
23.10.2012 Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Jonathan Schaeffer and Robert C. Holte.
Partial-Expansion A* with Selective Node Generation.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), pp. 471-477, 2012. (PDF)
Prof. Dr. Malte Helmert
30.10.2012 Jürgen Eckerle.
Chapters 4 and 5 of: Heuristische Suche unter Speicherbeschränkungen.
Ph.D. thesis, Albert-Ludwigs-Universität Freiburg, 1997.
Prof. Dr. Malte Helmert
06.11.2012 Stuart J. Russell.
Efficient Memory-Bounded Search Methods.
In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 1992), pp. 1-5, 1992. (PDF)
Prof. Dr. Malte Helmert
13.11.2012 Lei Zhang and Fahiem Bacchus.
MAXSAT Heuristics for Cost Optimal Planning.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), 2012. (PDF)
Florian Pommerening
20.11.2012 Blai Bonet and Malte Helmert.
Strengthening Landmark Heuristics via Hitting Sets.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 329-334, 2010. (PDF)
Prof. Dr. Malte Helmert
27.11.2012 Ariel Felner, Richard E. Korf and Sarit Hanan.
Additive Pattern Database Heuristics.
Journal of Artificial Intelligence Research, 22:279-318, 2004. (PDF)
Dr. Gabriele Röger
04.12.2012 Adnan Darwiche.
SDD: A New Canonical Representation of Propositional Knowledge Bases.
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 819-826, 2011. (PDF)
Prof. Dr. Malte Helmert
11.12.2012 Andrey Kolobov, Mausam, Dan Weld.
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 1108-1114, AAAI Press 2010. (PDF)
Prof. Dr. Malte Helmert
18.12.2012 Amanda Coles, Andrew Coles, Maria Fox, Derek Long.
Forward-Chaining Partial-Order Planning.
In Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 42-49, AAAI Press 2010. (PDF)
Dr. Patrick Eyerich
08.01.2013 Héctor Palacios, Hector Geffner.
From Conformant into Classical Planning: Efficient Translations that May Be Complete Too.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 264-271, AAAI Press 2007. (PDF)
Moritz Göbelbecker
15.01.2013 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 1-5. (PDF)
Prof. Dr. Malte Helmert
22.01.2013 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 6-8. (PDF)
Prof. Dr. Malte Helmert
05.02.2013 Jacques Desrosiers and Marco E. Lübbecke.
A Primer in Column Generation.
In Column Generation, pp. 1-32, Springer, 2005. (PDF)
Prof. Dr. Malte Helmert
12.02.2013 Peter Auer and Nicolo Cesa-Bianchi and Paul Fischer.
Finite-time Analysis of the Multiarmed Bandit Problem.
In Journal of Machine Learning, 47:235-256, 2002. (PDF)
Dr. Thomas Keller
19.02.2013 Ronen I. Brafman and Carmel Domshlak.
Factored Planning: How, When, and When Not.
In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), AAAI Press 2006. (PDF)
Dr. Gabriele Röger
26.02.2013 Patrik Haslum and Hector Geffner.
Admissible Heuristics for Optimal Planning.
In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS 2000), AAAI Press 2000. (PS)
Dr. Thomas Keller
05.03.2013 Emil Keyder and Hector Geffner.
Heuristics for Planning with Action Costs Revisited.
In ECAI 2008 - 18th European Conference on Artificial Intelligence, IOS Press. (PDF)
Dr. Thomas Keller
12.03.2013 Emil Keyder and Hector Geffner.
Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics.
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1734-1739, 2009. (PDF)
Prof. Dr. Malte Helmert
19.03.2013 David C. Uthus, Patricia J. Riddle and Hans W. Guesgen.
Solving the traveling tournament problem with iterative-deepening A*.
Journal of Scheduling 15(5):601-614, 2012. (PDF)
Prof. Dr. Malte Helmert
26.03.2013 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Preface and Chapter 1 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Prof. Dr. Malte Helmert

Further Information

If you have any questions, please do not hesitate to contact Dr. Robert Mattmüller.