HSDIP 2022 : 2022 Workshop on Heuristics and Search for Domain-independent Planning

HSDIP
2022 Workshop on Heuristics and Search for Domain-independent Planning

An ICAPS'22 Workshop
Singapore Management University, Singapore
June 2022

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.
Submissions

Please format submissions in AAAI style (see instructions in the Author Kit at https://www.aaai.org/Publications/Templates/AuthorKit22.zip) 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: Link to be announced
Important Dates

Paper submission deadline: March 24, 2022 (UTC-12 timezone)
Open discussion phase: April 14-21, 2022 (UTC-12 timezone)
Notification: April 28, 2022
Camera-ready paper submission: June 10, 2022

Organising Committee

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