Computer Science, INF, UFRGS
If you are interested in joining the reading group, please contact Prof. Marcus Ritt or Prof. André G. Pereira. They will inform you about the location and the background needed for the participation.
| Date | Paper | Presenter |
|---|---|---|
| Dec 09, 2022, 14h, Meet | Chrestien et al., A Differentiable Loss Function for Learning Heuristics in A*, arXiv 2022. | Pedro P. Minini |
| Nov 25, 2022, 14h, Meet | Domshlak et al., Optimal Search with Inadmissible Heuristics, ICAPS 2012. | André Grahl |
| Oct 14, 2022, 14h, Meet | Oki et al., Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search, NeurIPS 2023. | Marcus Ritt |
| Sep 23, 2022, 14h, Meet | Muise et al., Planning for a Single Agent in a Multi-Agent Environment Using FOND, IJCAI 2016. | Frederico |
| Jul 22, 2022, 14h, Hybrid | Pearce et al., Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning, arXiv 2022. | André Grahl |
| Jul 15, 2022, 14h, Hybrid | Katz. et al., Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators, arXiv 2022. | Rafael V. Bettker |
| Jun 01, 2022, 14h, Hybrid | Geffner. et al., Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits, ICAPS 2022. | Pedro P. Minini |
| Dec 03, 2021, 14h, Zoom | Bylander T., The Computational Complexity of Propositional STRIPS Planning (Sections 1 to 3), AIJ 1994. | Rafael V. Bettker |
| Nov 19, 2021, 14h, Zoom | Helmert et al., Saturated Post-hoc Optimization for Classical Planning, AAAI 2021. | André Grahl |
| Nov 5, 2021, 14h, Zoom | Trevizan et al., Occupation measure heuristics for probabilistic planning, ICAPS, 2017. | Frederico |
| Oct 22, 2021, 14h, Zoom | Jumper et al., Highly accurate protein structure prediction with AlphaFold, Nature, 2021. (Blog page.) | Pedro P. Minini |
| Jun 4, 2021, 14h, Zoom | Orseau et al., Single-Agent Policy Tree Search With Guarantees, NeurIPS 2018. | Rafael V. Bettker |
| May 21, 2021, 14h, Zoom | Holler et al., A Generic Method to Guide HTN Progression Search with Classical Heuristics, ICAPS 2018. | André Grahl |
| May 7, 2021, 14h, Zoom | Nair et al., Solving Mixed Integer Programs Using Neural Networks, arXiv 2020. | Gabriel Langeloh |
| Apr 23, 2021, 14h, Zoom | Battaglia et al., Relational Inductive Biases, Deep Learning, and Graph Networks, arXiv 2018. | Alex Gliesch |
| Apr 9, 2021, 14h, Zoom | Shen et al., Learning Domain-Independent Planning Heuristics with Hypergraph Networks, ICAPS 2020. | André Grahl |
| Dec 18, 2020, 14h, Zoom | Santos et al., An LP-Based Approach for Goal Recognition as Planning, AAAI 2021. | Luísa |
| Dec 4, 2020, 14h, Zoom | Feng et al., A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances, NeurIPS 2020. | André Grahl |
| Nov 20, 2020, 14h, Zoom | Badia et al., Agent57: Outperforming the Atari Human Benchmark, ICML 2020. | Marcus Ritt |
| Oct 23, 2020, 14h, Zoom | Bandres et al., Planning with Pixels in (Almost) Real Time, AAAI 2018. | André Grahl |
| Oct 9, 2020, 14h, Zoom | Chen et al., Revisiting Suboptimal Search, SoCS 2019. | Frederico |
| Sep 25, 2020, 14h, Zoom | Cohen et al., Fat-and Heavy-Tailed Behavior in Satisficing Planning, AAAI 2018. | Marcus Ritt |
| Sep 11, 2020, 14h, Zoom | Ferber et al., Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space, ECAI 2020. | Daniel |
| Aug 28, 2020, 14h, Zoom | Imai et al., A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning, ECAI 2014. | André Grahl |
| Aug 14, 2020, 14h, Zoom | Francès et al, Generalized Potential Heuristics for Classical Planning, IJCAI 2019. | Frederico |
| Jul 31, 2020, 14h, Zoom | Steinmetz et al., LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning, IJCAI 2018. | André Grahl |
| Jul 17, 2020, 14h, Zoom | Huang et al., A Novel Transition Based Encoding Scheme for Planning as Satisfiability, AAAI 2010. | Marcus Ritt |
| Jul 6, 2020, 14h, Zoom | Goldenberg et al., A* Variants for Optimal Multi-Agent Pathfinding, 2012. | André Grahl |
| Jun 19, 2020, 14h, Zoom | Lam et al., Branch-and-Cut-and-Price for Multi-Agent Pathfinding, IJCAI, 2019. | Marcus Ritt |
| Jun 5, 2020, 14h, Zoom | Sharon et al., Conflict-Based Search For Optimal Multi-Agent Path Finding, AAAI 2012. | André Grahl |
¹Deadline is two months after last time it received votes or was proposed.