Reading Group on Planning and Search
Organizer: Dr. Johannes Aldinger
Note
Reading group takes place on Wednesday from September 2, 2015.
Time and Place
Time: Thursday, 15:15
Place: Room 052 00-016 (meeting room of the
Foundations of Artificial Intelligence and Software Engineering groups)
The reading group takes place in Basel once a month (Spiegelgasse 5, Raum 04.001). We share a train ticket to get there. If you are interested to join us please contact Dr. Johannes Aldinger.
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.04.2015 | no meeting | |
| 16:15 09.04.2015 in Basel |
Fan Xie, Martin Müller and Robert Holte. Understanding and Improving Local Exploration for GBFS. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). to appear. (PDF) |
Dr. Gabriele Röger |
| 16.04.2015 |
Peter E. Hart, Nils J. Nilsson and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions of Systems Science and Cybernetics 4(2):100-107, 1968. Peter E. Hart, Nils J. Nilsson and Bertram Raphael. Correction To "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". ACM SIGART Bulletin 37:28-29, 1972. |
Prof. Dr. Malte Helmert |
| 23.04.2015 |
Vidal Alcázar and Álvaro Torralba. A Reminder about the Importance of Computing and Exploiting Invariants in Planning. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF) |
Jendrik Seipp |
| 30.04.2015 |
Daniel Gnad and Jörg Hoffmann. Beating LM-cut with h^max (Sometimes): Fork-Decoupled State Space Search. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF) |
Dr. Gabriele Röger |
| 07.05.2015 |
Toby O. Davies, Adrian R. Pearce, Peter J. Stuckey and Nir Lipovetzky. Sequencing Operator Counts. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF) |
Prof. Dr. Malte Helmert |
| 14.05.2015 | no meeting | |
| 13:30 21.05.2015 |
Jussi Rintanen. Planning as satisfiability: Heuristics. Artificial Intelligence 193 (2012): 45-86. (PDF) |
Florian Pommerening |
| 28.05.2015 |
Sam Bayless, Noah Bayless, Holger H. Hoos and Alan J. Hu. SAT Modulo Monotonic Theories. In Proc. AAAI 2015. (PDF) |
Prof. Dr. Malte Helmert |
| 04.06.2015 in Basel |
Venkatraman Narayanan, Sandip Aine, Maxim Likhachev. Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics. In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF) |
Dr. Gabriele Röger |
| 11.06.2015 | no meeting (ICAPS) | |
| 18.06.2015 |
Mauro Vallati, Frank Hutter, Lukáš Chrpa and Thomas L. McCluskey. On the Effective Configuration of Planning Domain Models. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF) |
Dr. Frank Hutter |
| 25.06.2015 |
Christopher Wilt and Wheeler Ruml. Building a Heuristic for Greedy Search. In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF) |
Prof. Dr. Malte Helmert |
| 16:30 02.07.2015 in Basel |
Tomáš Balyo and Roman Bartak. No One SATPlan Encoding To Rule Them All. In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF) |
Salomé Simon |
| 09.07.2015 |
Florian Geißer, Thomas Keller and Robert Mattmüller. Delete Relaxations for Planning with State-Dependent Action Costs. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF) |
Dr. Florian Geißer |
| 16.07.2015 |
Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski and Roland Wessäly. On Cut-Based Inequalities for Capacitated Network Design Polyhedra. Networks 57(2):141-156, 2011. |
Prof. Dr. Malte Helmert |
| 23.07.2015 |
Álvaro Torralba and Jörg Hoffmann. Simulation-Based Admissible Dominance Pruning. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF) |
Dr. Gabriele Röger |
| 30.07.2015 |
Álvaro Torralba and Peter Kissmann. Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink. Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS 2015). (PDF) |
Silvan Sievers |
| 06.08.2015 |
Álvaro Torralba. Chapter 2 of Symbolic Search and Abstraction Heuristics for Cost-Optimal Planning. Universidad Carlos III de Madrid, PhD dissertation, June 2015. |
Silvan Sievers |
| 13.08.2015 |
Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, Vol. C-35, No. 8 (1986). |
Dr. Gabriele Röger |
| 20.08.2015 |
Daniel Gnad, Jörg Hoffmann and Carmel Domshlak. From Fork Decoupling to Star-Topology Decoupling. TechReport. (PDF) |
Martin Wehrle |
| 27.08.2015 |
Nir Lipovetzky, Miquel Ramirez and Hector Geffner. Classical Planning with Simulators: Results on the Atari Video Games. Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF) |
Dr. Florian Geißer |
| 02.09.2015 |
Nir Lipovetzky, Hector Geffner. Width and Serialization of Classical Planning Problems. Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). (PDF) |
Dr. Johannes Aldinger |
| 16:30 09.09.2015 in Basel |
Doron Nussbaum, Alper Yörükçü. Moving Target Search with Subgoal Graphs. Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015). (PDF) |
Salomé Simon |
| 16.09.2015 |
Robert Geisberger, Peter Sanders, Dominik Schultes and Daniel Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. 7th Workshop on Experimental Algorithms (WEA 2008), Springer LNCS 5038, pp. 319-333. (PDF) |
Dr. Florian Geißer |
| 23.09.2015 |
Florian Pommerening and Malte Helmert. A Normal Form for Classical Planning Tasks. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). (PDF) |
Dr. Florian Geißer |
| 30.09.2015 |
André G. Pereira, Marcus Ritt and Luciana S. Buriol. Optimal Sokoban solving using pattern databases with specific domain knowledge. Artificial Intelligence 227:52-70, 2015. |
Prof. Dr. Malte Helmert |
Further Information
- Reading group website for WS 2014/2015
- Reading group website for SS 2014
- Reading group website for WS 2013/2014
- Reading group website for SS 2013
- Reading group website for WS 2012/2013
If you have any questions, please do not hesitate to contact Dr. Johannes Aldinger.