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 at all levels may feel free to participate, but should be aware that only PhD students enrolled in Basel can obtain ECTS points in 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 Zoom
Salomé Eriksson and Malte Helmert.
Certified Unsolvability for SAT Planning with Property Directed Reachability.
In Proc. ICAPS 2020. (PDF)
Jendrik Seipp
in Zoom
Miquel Ramírez and Hector Geffner.
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners.
In Proc. AAAI 2010. (PDF)
Jendrik Seipp
in Zoom
David Speck, Florian Geißer, Robert Mattmüller.
When Perfect is not Good Enough: On the Search Behaviour of Symbolic Heuristic Search.
In Proc. ICAPS 2020. (PDF)
Jendrik Seipp
in Basel
Tom Bylander.
A Linear Programming Heuristic for Optimal Planning.
In Proc. AAAI/IAAI 1997, pp. 694-699. (PDF)
Florian Pommerening
in Freiburg
Bernhard Nebel.
On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs.
In Proc. ICAPS 2020.
Malte Helmert
2020-03-05 No meeting (Basler Fasnacht)
in Freiburg
Oriol Vinyals et al..
Grandmaster level in StarCraft II using multi-agent reinforcement learning.
Nature 575:350-354, 2019.
Malte Helmert
in Basel
Donald B. Johnson.
A note on Dijkstra's shortest path algorithm.
Journal of the ACM 20(3):385-388, 1973.
Florian Pommerening
in Freiburg
Vidal Alcázar, Pat Riddle, Mike Barley.
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search.
In Proc. AAAI 2020. (PDF)
Gabriele Röger
in Basel
Alberto Martelli.
On the Complexity of Admissible Search Algorithms.
Artificial Intelligence 8:1-13, 1977.
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.