HSDIP

Heuristics and search algorithms are the two key components of heuristic search, one of the main approaches to many variations of domain-independent planning, including classical planning, temporal planning, planning under uncertainty and adversarial planning. This workshop seeks to understand the underlying principles of current heuristics and search methods, their limitations, ways for overcoming those limitations, as well as the synergy between heuristics and search.

Topics

Examples of typical topics for submissions to this workshop are:

• automatic derivation of heuristic estimators for domain-independent planning
• formal results showing equivalence or dominance between heuristics
• novel heuristic methods dealing with planning with numeric variables and effects, partial observability and non-deterministic action effects
• heuristic estimators for domain-independent planning via procedures or suitably defined encodings of declarative descriptions of planning tasks into Satisfiability or Optimisation
• novel search techniques for domain-independent planning that explicitly aim at exploiting effectively the properties of existing heuristics
• empirical observations of synergies between heuristics and search in domain-independent planning
• challenging domains for existing combinations of heuristics and search algorithms
• applications of machine learning in heuristic search, e.g., learning heuristics, adaptive search strategies, or heuristic selection
• interesting algorithmic optimizations for the calculation of a heuristic or the execution of a search

The HSDIP workshop has always been welcoming of multidisciplinary work, for example, drawing inspiration from operations research (like row and column generation algorithms), convex optimization (like gradient optimization for hybrid planning), constraint programming, or satisfiability.

The workshop is meant to be an open and inclusive forum, and we encourage papers that report on work in progress or that do not fit the mold of a typical conference paper. Non-trivial negative results are welcome to the workshop, but we expect the authors to argue for the significance of the presented results.

Schedule

Submissions

Please format submissions in AAAI style (see Author Kit) and keep them to at most 9 pages including references. Authors considering submitting to the workshop papers rejected from the main conference, please ensure you do your utmost to address the comments given by ICAPS reviewers. Please do not submit papers that are already accepted for the main conference to the workshop.

Submissions will be made through OpenReview: OpenReview

The workshop will be virtual. For each accepted paper, a 15 minutes video presentation has to be submitted which will be shown during the workshop and will be published on the HSDIP YouTube Channel. At least one author of every accepted paper has to attend the workshop in order to answer questions.

Accepted Papers

• A Comparison of Abstraction Heuristics for Rubik's Cube
  Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert
• New Complexity Results for Structurally Restricted Numeric Planning
  Alexander Shleyfman, Daniel Gnad, Peter Jonsson
• Mechanically Proving Guarantees of Generalized Heuristics: First Results and Ongoing Work
  Mohammad Abdulaziz, Florian Pommerening, Augusto B. Corrêa
• Additive Pattern Databases for Decoupled Search
  Silvan Sievers, Daniel Gnad, Alvaro Torralba
• Symmetry Detection and Breaking in Cost-Optimal Numeric Planning
  Alexander Shleyfman, Ryo Kuroiwa, Chris Beck
• Trading Monotonicity for Cost in Beam Search
  Sofia Lemons, Robert Holte, Carlos Linares López, Wheeler Ruml
• A Formal Model of Concurrent Planning and Execution with Action Costs
  Ava Bensoussan, Solomon Eyal Shimony, Shahaf S. Shperberg, Wheeler Ruml
• A Study of the Power of Heuristic-based Pruning via SAT Planning
  Christopher Johnson, Pascal Tobias Bercher, Charles Gretton
• On Producing Shortest Cost-Optimal Plans
  Michael Katz, Gabriele Röger, Malte Helmert
• Optimal Planning as Constraint Optimization
  Enrico Giunchiglia, Armando Taccchella

Important Dates

• Paper submission deadline: April 7, 2022 (UTC-12 timezone)
• Open discussion phase: April 25-28, 2022 (UTC-12 timezone)
• Notification: April 29, 2022
• Camera-ready paper submission: June 3, 2022
• Video submission: June 13, 2022
• Workshop: June 16, 2022

Organising Committee (Contact)

• Liat Cohen, University of Basel, Switzerland
• Patrick Ferber, University of Basel, Switzerland and Saarland University, Germany
• Daniel Fiser, Czech Technical University, Czech Republic and Saarland University, Germany
• Michael Katz, IBM T.J. Watson Research Center, NY, USA
• Nir Lipovetzky, University of Melbourne, Australia
• Christian Muise, Queen's University, Canada