Planning and Search - Reading Group

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.

Papers

Date Paper Suggested by:
11.08.2017 - 11h00 Generalized Best-First Search Strategies and the Optimality of A* (sections 1 to 3)
Rina Dechter and Judea Pearl, JACM 32.3, 1985. 		André G. Pereira
02.08.2017 - 16h00 The Fast Downward Planning System (sections 6 to 8)
Malte Helmert, JAIR 26, 2006. 		-
26.07.2017 - 16h00 The Fast Downward Planning System (section 5)
Malte Helmert, JAIR 26, 2006. 		-
21.07.2017 - 16h00 No meeting this week.
14.07.2017 - 11h00 The Fast Downward Planning System (sections 1 to 4)
Malte Helmert, JAIR 26, 2006. 		-
07.07.2017 - 11h00 Getting the Most Out of Pattern Databases for Classical Planning
Florian Pommerening, Gabriele Röger and Malte Helmert, IJCAI-13, 2013. 		André G. Pereira
30.06.2017 - 11h00 LP-based Heuristics for Cost-optimal Planning
Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet, ICAPS-14, 2014. 		Augusto B. Corrêa
23.06.2017 - 11h00 An Admissible Heuristic for SAS+ Planning Obtained from the State Equation
Blai Bonet, IJCAI-13, 2013. 		Augusto B. Corrêa
16.06.2017 - 11h00 Understanding the Search Behaviour of Greedy Best-First Search
Manuel Heusner, Thomas Keller and Malte Helmert, SoCS-17, 2017. 		Augusto B. Corrêa
09.06.2017 - 11h00 The Two-edged Nature of Diverse Action Costs
Gaojian Fan, Martin Mueller and Robert Holte, ICAPS-17, 2017. 		Augusto B. Corrêa
02.06.2017 - 11h00 Sound and Complete Landmarks for And/Or Graphs
Emil Keyder, Silvia Richter and Malte Helmert. In Proc. ECAI-10, 2010. 		Alex Gliesch
26.05.2017 - 11h00 Cost-Optimal Planning with Landmarks
Erez Karpas and Carmel Domshlak. In Proc. IJCAI-09, 2009. 		André G. Pereira
19.05.2017 - 11h00 Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
Malte Helmert and Carmel Domshlak. In Proc. ICAPS-09, 2009. 		Marcus Ritt
12.05.2017 - 11h00 The FF planning system: Fast plan generation through heuristic search (chapters 1 to 6)
Jörg Hoffmann and Bernhard Nebel. In JAIR 14:253-302, 2001. 		Marcus Ritt
05.05.2017 - 11h00 Correlation Complexity of Classical Planning Domains
Jendrik Seipp, Florian Pommerening, Gabriele Röger and Malte Helmert. In Proc. IJCAI-16, 2016. 		Augusto B. Corrêa
28.04.2017 - 11h00 Effective Heuristics for Suboptimal Best-First Search
Christopher Wilt and Wheeler Ruml. In JAIR 57:273-306, 2016		 André G. Pereira
20.04.2017 - 11h00 Best-First Width Search: Exploration and Exploitation in Classical Planning
N. Lipovetzky and H. Geffner. In Proc. AAAI-17, 2/2017.		 Marcus Ritt
13.04.2017 - 14h30 Width and Serialization of Classical Planning Problems
N. Lipovetzky and H. Geffner. In Proc. ECAI-12, 8/2012.		 Marcus Ritt

Queue

Heuristic Search:
  • 2005 - Frontier Search
  • 2005 - Finding optimal solutions to the graph partitioning
  • 2007 - Analyzing the Performance of Pattern Database Heuristics
  • 2008 - Duality in permutation state spaces and the dual search algorithm
  • 2011 - Searching for Plans with Carefully Designed Probes
  • 2011 - Learning heuristic functions for large state spaces
  • 2011 - Inconsistent Heuristics in Theory and Practice
  • 2012 - Predicting optimal solution costs with bidirectional stratified sampling
  • 2012 - A Theoretical Framework for Studying Random Walk Planning
  • 2014 - Type-based Exploration with Multiple Search Queues for Satisficing Planning
  • 2014 - Adding Local Exploration to Greedy Best-First Search in Satisficing Planning
  • 2015 - Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games

    • Planning:
  • 2000 - Admissible Heuristics for Optimal Planning
  • 2001 - On the extraction, ordering, and usage of landmarks in planning
  • 2001 - Planning as heuristic search
  • 2004 - A Planning Heuristic Based on Causal Graph Analysis
  • 2004 - Ordered landmarks in planning
  • 2005 - New Admissible Heuristics for Domain-Independent Planning
  • 2006 - Admissible Heuristics for Automated Planning (Ph.D. Thesis)
  • 2006 - Solving Planning Tasks in Theory and Practice (Ph.D. Thesis)
  • 2006 - The Fast Downward Planning System
  • 2007 - Flexible Abstraction Heuristics for Optimal Sequential Planning
  • 2008 - Additive-Disjunctive Heuristics for Optimal Planning
  • 2008 - Landmarks Revisited
  • 2008 - Optimal Additive Composition of Abstraction-based Admissible Heuristics
  • 2008 - Structural Patterns Heuristics via Fork Decomposition
  • 2009 - Concise Finite-Domain Representations for PDDL Planning Task
  • 2009 - Cost-Optimal Planning with Landmarks
  • 2009 - Landmarks Critical Paths and Abstractions Whats the Difference Anyway?
  • 2009 - Structural-Pattern Databases
  • 2010 - Implicit Abstraction Heuristics
  • 2010 - Sound and Complete Landmarks for And/Or Graphs
  • 2010 - Strengthening Landmark Heuristics via Hitting Sets
  • 2010 - When Abstractions Met Landmarks
  • 2011 - Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning
  • 2011 - Everything You Always Wanted to Know About Planning
  • 2012 - Cartesian Abstraction (M.Sc. Thesis)
  • 2012 - Landmark-enhanced abstraction heuristics
  • 2013 - Counterexample-Guided Cartesian Abstraction Refinement
  • 2014 - Diverse and Additive Cartesian Abstraction Heuristics

    • Machine Learning and Search:
  • 2004 - Learning Domain-Specific Control Knowledge from Random Walks
  • 2008 - Learning Control Knowledge for Forward Search Planning
  • 2008 - Learning from Multiple Heuristics
  • 2008 - Learning Heuristic Functions Through Approximate Linear Programming
  • 2010 - Bootstrap Learning of Heuristics (M.Sc. Thesis)
  • 2011 - Learning heuristic functions for large state spaces
  • 2011 - Learning Inadmissible Heuristics During Search
  • 2013 - Planning and Learning (ICAPS Workshop Holte 2013.)
  • 2015 - Learning Heuristic Functions in Classical Planning (M.Sc. Thesis)
  • 2015 - Predicting optimal solution costs with bidirectional stratified sampling in regular search

    • Our Publications