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

Time: Thursday, 16:15
Place: Online. The link to the Zoom meeting can be found on the reading group Discord server.

Discord Server

The papers covered by the reading group are announced on the reading group Discord server. To protect against spam, we do not provide links here. To obtain access, please contact one of the members of the Artificial Intelligence research group.

Schedule

Date Topic Contact
2024-10-17 Shohin Mukherjee, Sandip Aine, Maxim Likhachev.
ePA*SE: Edge-Based Parallel A* for Slow Evaluations.
In Proceedings of the Fifteenth International Symposium on Combinatorial Search (SoCS 2022), 2022. (paper)
David Speck
2024-10-10 Endre Erős, Martin Dahl, Petter Falkman, Kristofer Bengtsson.
Towards Compositional Automated Planning.
25th IEEE International Conference on Emerging Technologies and Factory Automation, (ETFA 2020), 2020. (paper)
Tanja Schindler
2024-10-03 Alexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski.
Temporal Planning as Refinement-Based Model Checking.
In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019. (paper)
Tanja Schindler
2024-09-19 Alexander Hoen, Andy Oertel, Ambros Gleixner, Jakob Nordström.
Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs.
21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024), 2024. (PDF)
Simon Dold
2024-09-12 Nils Froleyks, Tomáš Balyo, Dominik Schreiber.
PASAR — Planning as Satisfiability with Abstraction Refinement.
In Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019), 2019. (paper)
Tanja Schindler
2024-08-08 Rostislav Horcík and Gustav Sír.
Expressiveness of Graph Neural Networks in Planning Domains.
In Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024. (paper)
Augusto B. Corrêa

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.