Reading Group on Planning and Search

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 meeting and discuss them during the meeting.

The target audience of the reading group consists of researchers and interested guests, comparable to a post-graduate seminar. Students may feel free to participate, but should be aware that no ECTS points can be earned for the reading group.

Time and Place

The reading group is a joint event of the Artificial Intelligence research group at University of Basel and the Foundations of Artificial Intelligence research group at Albert-Ludwigs-Universität Freiburg.

Time: Thursday, 15:15 pm
Place in Basel: University of Basel, Department of Mathematics and Computer Science, Spiegelgasse 5, room 04.001
Place in Freiburg: Albert-Ludwigs-Universität Freiburg, Faculty of Engineering, Georges-Köhler-Allee 52, room 052-00-016

The reading group meetings alternate between Basel and Freiburg. Participants from Freiburg share a train ticket to get to Basel. If you are interested in joining them, please contact Robert Mattmüller. Participants from Basel travelling to Freiburg follow the usual travel reimbursement process.

Mailing List

The papers covered by the reading group are announced on the reading group mailing list. To protect against spam, we do not provide a link to the mailing list here. To obtain access, please contact one of the members of the Artificial Intelligence research group.


Date Topic Contact
in Basel
Alberto Martelli.
On the Complexity of Admissible Search Algorithms.
Artificial Intelligence 8:1-13, 1977.
Malte Helmert
in Freiburg
Michael Barley, Patricia Riddle, Carlos Linares López, Sean Dobson, Ira Pohl.
GBFHS: A Generalized Breadth-First Heuristic Search Algorithm.
In Proc. SoCS 2018, pp. 28-36. (PDF)
Gabriele Röger
in Basel
Mohammad Abdulaziz and Peter Lammich.
A Formally Verified Validator for Classical Planning Problems and Solutions.
In Proc. ICTAI 2018, pp. 474-479. (PDF)
Malte Helmert
in Freiburg
William Shen, Felipe Trevizan and Sylvie Thiébaux.
Learning Domain-Independent Planning Heuristics with Hypergraph Networks.
arXiv:1911.13101 [cs.AI]. (paper)
David Speck
in Basel
Carlos Guestrin, Daphne Koller, Ronald Parr and Shobha Venkataraman.
Efficient Solution Algorithms for Factored MDPs (Sections 6-11).
Journal of Artificial Intelligence Research 19:399-468, 2003. (PDF)
Thomas Keller
2020-01-02 No meeting
2019-12-26 No meeting (Boxing Day)
in Freiburg
Amos Beimel and Ronen I. Brafman.
Privacy Preserving Multi-Agent Planning with Provable Guarantees.
arXiv:1810.13354 [cs.AI]. (paper)
Robert Mattmüller
2019-12-12 No meeting (Fast Downward sprint)
2019-12-05 No meeting (Fast Downward sprint)
in Basel
Carlos Guestrin, Daphne Koller, Ronald Parr and Shobha Venkataraman.
Efficient Solution Algorithms for Factored MDPs (Sections 1-5).
Journal of Artificial Intelligence Research 19:399-468, 2003. (PDF)
Thomas Keller
in Freiburg
Erez Karpas and Daniele Magazzeni.
Automated Planning for Robotics.
Annual Review of Control, Robotics, and Autonomous Systems 3, 2020. (paper)
David Speck
2019-11-14 cancelled due to upcoming ICAPS deadline
in Freiburg
Fangzhen Lin and Jicheng Zhao.
On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic.
In Proc. IJCAI 2003, pp. 853-858. (PDF)

Tomi Janhunen.
Representing Normal Programs with Clauses.
In Proc. ECAI 2004, pp. 358-362. (PDF)
Malte Helmert
in Basel
Liat Cohen, Solomon Eyal Shimony and Gera Weiss.
Estimating the Probability of Meeting a Deadline in a Hierarchical Plan.
In Proc. IJCAI 2015, pp. 1551-1557. (PDF)
Malte Helmert
in Freiburg
Martin Gebser, Tomi Janhunen and Jussi Rintanen.
Answer Set Programming as SAT modulo Acyclicity.
In Proc. ECAI 2014, pp. 351-356. (PDF)
Malte Helmert
in Basel
Sven Koenig, Maxim Likhachev.
Incremental A*.
Advances in Neural Information Processing Systems 14 (NIPS 2002). (PDF)
Jendrik Seipp
in Freiburg
Stefan Edelkamp.
Challenging Human Supremacy in Skat.
In Proc. SoCS 2019, pp. 52-60. (PDF)
Silvan Sievers
in Basel
David Hilbert.
Über das Unendliche.
Mathematische Annalen 95:1(161-190), 1926.
Malte Helmert
in Basel
Forest Agostinelli, Stephen McAleer, Alexander Shmakov and Pierre Baldi.
Solving the Rubik's cube with deep reinforcement learning and search.
Nature Machine Intelligence 1:356-363, 2019.
Malte Helmert

Further Information

The papers that were read in the reading group in previous semesters can be found in the reading group archive.

If you have any questions, please do not hesitate to contact Malte Helmert.