Reading Group on Planning and Search

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.

Past Suggestions

• Behnke et al., Delete- and Ordering-Relaxation Heuristics for HTN Planning, IJCAI 2020.
• Lindauer et al., Learning Heuristic Selection with Dynamic Algorithm Configuration, ICAPS 2021.
• Sturtevant et al., Iterative-deepening Bidirectional Heuristic Search with Restricted Memory, ICAPS 2021.
• Biundo et al., Finding Optimal Solutions in HTN Planning – A SAT-based Approach, IJCAI 2019.
• Orseau et al., Policy-Guided Heuristic Search with Guarantees, AAAI 2021.
• Agostinelli et al., A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks, pre-print.
• Shoham et al., The FESS Algorithm: A Feature Based Approach to Single-Agent Search, COC 2020.
• Hatem et al., Bounded Suboptimal Heuristic Search in Linear Space, SoCS 2013.
• Hatem et al., Bounded Suboptimal Search in Linear Space: New Results, SoCS 2014.
• Kuroiwa Fukunaga, Front-to-Front Heuristic Search for Satisficing Classical Planning, IJCAI 2020.
• Fan, et al., Additive Merge-and-Shrink Heuristics for Diverse Action Costs IJCAI 2017.
• Helmert,. A Planning Heuristic Based on Causal Graph Analysis, ICAPS 2004.
• Hunag, et al., An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization, AAAI 2009.
• Fickert, A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search, ICAPS 2020.
• Fiser et al, Strengthening Potential Heuristics with Mutexes and Disambiguations , ICAPS 2020.
• Helmert, et al., Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning, AAAI 2017.
• Seipp, Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning, IJCAI 2019.
• Helmert, et al., Iterative Budgeted Exponential Search, IJCAI 2019.
• Pommerening, et al., Optimal Planning for Delete-free Tasks with Incremental LM-cut, ICAPS 2012.
• Bonet, et al., Higher-Dimensional Potential Heuristics for Optimal Classical Planning, AAAI 2017.
• Segovia-Aguas et al., Hierarchical Finite State Controllers for Generalized Planning, IJCAI 2016.

More

Here’s a link to the old reading group.