Reading Group on Planning and Search
Organizer: Dr. Johannes Aldinger
Note
Reading group takes place on wednesday from August, 13 2014.
Time and Place
Time: Tuesday 15:20 from Aug 13: Wednesday 16: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 (Bernoullistrasse 16, Raum 404). The train leaves at 1:15 pm. If you are interested to join us please apply to Dr. Johannes Aldinger. The reading group dates in Basel until the end of 2014 are: 06.05.2014, 20.05.2014, 17.06.2014, 05.08.2014, 17.09.2014, 15.10.2014, 19.11.2014, 17.12.2014.
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 |
---|---|---|
01.04.2014 |
Blai Bonet and Menkes van den Briel. Flow-based Heuristics for Optimal Planning: Landmarks and Merges. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear. (PDF) |
Dr. Johannes Aldinger |
08.04.2014 |
Simone Santini. We Are Sorry to Inform You.... Computer 38(12):126-128, 2005. Leslie Lamport. Euclid Writes an Algorithm: A Fairytale. In Festschrift celebrating the 60th birthday of Manfred Broy, 2011. (PDF) |
Prof. Dr. Malte Helmert |
15.04.2014 |
Fan Xie, Martin Müller, Robert Holte and Tatsuya Imai. Type-based Exploration with Multiple Search Queues for Satisficing Planning. In Proceedings of the Twenty-Eigth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF) |
Jendrik Seipp |
22.04.2014 | no meeting (Easter break) | |
29.04.2014 |
Fan Xie, Martin Müller and Robert Holte. Adding Local Exploration to Greedy Best-First Search in Satisficing Planning. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF) |
Prof. Dr. Malte Helmert |
14:30 06.05.2014 in Basel |
Richard Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer and Fan Xie. A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear. (PDF) |
Jendrik Seipp |
13.05.2014 |
Matthew Hatem and Wheeler Ruml. External Memory Best-First Search for Multiple Sequence Alignment. In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI-2013). 2013. (PDF) |
Florian Pommerening |
16:00 20.05.2014 in Basel |
Avitan Gefen and Ronen Brafman. Pruning Methods For Optimal Delete-free Planning Using Domination-Free Reachability. In Proceedings of the 5th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2013), pp. 69-77, 2013. (PDF) |
Dr. Johannes Aldinger |
27.05.2014 |
Lei Zhang, Chong-Jun Wang and Jun-Yuan Xie. Cost optimal planning with LP-based multi-valued landmark heuristic. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2014), 2014. (PDF) |
Florian Pommerening |
03.06.2014 |
Martin Suda. Property Directed Reachability for Automated Planning. Journal of Artificial Intelligence Research, 2014. To appear. |
Prof. Dr. Malte Helmert |
10.06.2014 |
Hector J. Levesque. On our best behaviour. Artificial Intelligence, 2014. To appear. Uri Alon. How To Choose a Good Scientific Problem. Molecular Cell 35:726-728, 2009. |
Prof. Dr. Malte Helmert |
16:00 17.06.2014 in Basel |
Joao Marques-Silva, Ines Lynce and Sharad Malik. Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability, IOS Press, 2009, 131-153. |
Salomé Simon |
24.06.2014 | no meeting (ICAPS) | |
01.07.2014 | no meeting (ICAPS) | |
08.07.2014 |
Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski and Martin Wehrle. Planning as Model Checking in Hybrid Domains. In Proceedings of the Twenty-Eigth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF) |
Dr. Johannes Aldinger |
15.07.2014 |
Gaojian Fan, Martin Müller and Robert Holte. Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions. In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), 2014, to appear. (PDF) |
Silvan Sievers |
22.07.2014 |
Vitaly Mirkis and Carmel Domshlak. Landmarks in Oversubscription Planning. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), 2014, to appear. (PDF) |
Dr. Gabriele Röger |
29.07.2014 |
Tatsuya Imai and Alex Fukunaga. A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning. In Proceedings of the 6th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2014), pp. 71-79, 2014. (PDF) |
Florian Pommerening |
16:00 05.08.2014 in Basel |
J. Hoffmann, P. Kissmann, and A. Torralba. `Distance'? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic, August 2010. (PDF) |
Silvan Sievers |
16:15 13.08.2014 new date: wednesday |
Mehdi Samadi, Maryam Siabani, Ariel Felner and Robert Holte. Compressing Pattern Databases with Learning. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI'08), Patras, Greece, 2008. (PDF) |
Jendrik Seipp |
27.08.2014 |
Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, and Maxim Likhachev. Multi-Heuristic A*. In Proceedings of Robotics: Science and Systems (RSS 2014), 2014. (PDF) |
Dr. Gabriele Röger |
03.09.2014 |
Jussi Rintanen and Charles Orgill Gretton. Computing Upper Bounds on Lengths of Transition Sequences. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2013), 2013. (PDF) |
Jendrik Seipp |
10.09.2014 |
Christopher Wilt and Wheeler Ruml. Speedy versus Greedy Search. In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), 2014. (PDF) |
Prof. Dr. Malte Helmert |
17.09.2014 in Basel |
John Slaney. Set-theoretic duality: A fundamental feature of combinatorial optimisation. Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), pp. 843-848, 2014. (PDF) |
Dr. Gabriele Röger |
24.09.2014 |
Christer Bäckström. Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs. Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), pp. 33-38, 2014. (PDF) |
Prof. Dr. Malte Helmert |
Paper Pool
-
Carlos Ansótegui, Maria Luisa Bonet and Jordi Levy.
A New Algorithm for Weighted Partial MaxSAT.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 3-8, AAAI Press 2010. (PDF) -
Ching-Tsun Chou and Doron Peled.
Formal Verification of a Partial-Order Reduction Technique for Model Checking.
Journal of Automated Reasoning, 23(3-4):265-298, 1999. (PDF) -
Knot Pipatsrisawat and Adnan Darwiche.
Top-Down Algorithms for Constructing Stuctured DNNF: Theoretical and Practical Implications.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 3-8, IOS Press 2010. (PDF)
Further Information
- Reading group website for WS 2013/2014
- Reading group website for SS 2013
- Reading group website for WS 2012/2013
- Reading group website for SS 2012
- Reading group website for WS 2011/2012
- Reading group website for SS 2011
- Reading group website for WS 2010/2011
- Reading group website for SS 2010
- Reading group website for WS 2009/2010
- Reading group website for SS 2009
If you have any questions, please do not hesitate to contact Dr. Johannes Aldinger.