Jerusalem, Israel
June 7-11, 2015
25th International Conference on Automated Planning and Scheduling

Research Workshop of the Israel Science Foundation

Heuristics and Search for Domain-independent Planning (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.


The full HSDIP proceedings are available as a pdf file.


The workshop will be held on June 8, 2015 in Room C.

Session I
09:00-09:30 Álvaro Torralba and Joerg Hoffmann
Simulation-Based Admissible Dominance Pruning
09:30-10:00 Johannes Aldinger, Robert Mattmüller and Moritz Göbelbecker
Complexity Issues of Interval Relaxed Numeric Planning
10:00-10:30 Coffee Break
Session II
10:30-11:00 Patricia Riddle, Mike Barley, Santiago Franco and Jordan Douglas
Analysys of Bagged Representations in PDDL
11:00-11:30 Ron Alford, Pascal Bercher and David Aha
Tight Bounds for HTN planning with Task Insertion
11:30-12:00 Sarah Keren, Avigdor Gal and Erez Karpas
Goal Recognition Design With Non-Observable Actions
12:00-13:55 Lunch Break
Session III
13:55-14:25 Nir Lipovetzky, Miguel Ramírez and Hector Geffner.
Classical Planning with Simulators: Results on the Atari Video Games
14:25-14:55 Yolanda E-Martín, Maria D. R-Moreno and David Smith
A Heuristic Estimator based on Cost Interaction
14:55-15:25 Alberto Camacho, Christian Muise, Akshay Ganeshen and Sheila McIlraith
From FOND to Probabilistic Planning: Guiding search for quality policies
15:25-16:00 Coffee Break
Session IV: SoCS papers
16:00-16:30 Salomé Simon and Gabriele Röger
Finding and Exploiting LTL Trajectory Constraints in Classical Planning
16:30-17:00 Daniel Gnad and Joerg Hoffmann
Red-Black Planning: A New Tractability Analysis and Heuristic Function
17:00-17:30 Daniel Gnad, Joerg Hoffmann and Carmel Domshlak
From Fork Decoupling to Star-Topology Decoupling
17:30-17:45Closing Remarks

Call for papers

Topics and Objectives

State-space search guided by heuristics, automatically derived from the problem representation, has been one of the most popular, and arguably one of the most successful, approaches to domain-independent planning in the last decade. While there has been significant developments in the design of planning heuristics, such that there are now many different kinds of heuristics, and some theories of how they relate to each other have begun to emerge, there is also a growing realization that the search algorithm plays an equally important role in the approach. Recent work has highlighted some of the weaknesses of some search algorithms, but also the rich opportunities for exploiting synergies between the heuristic calculation and the search to improve both, drawing on the fact that domain-independent planning offers a declarative description of the state space (not just a "black box" successor function).

The workshop on Heuristics and Search for Domain-Independent Planning (HSDIP) is the seventh workshop in a series that started with the "Heuristics for Domain-Independent Planning" (HDIP) workshops at ICAPS 2007. At ICAPS 2012, the workshop was changed to its current name and scope to explicitly encourage work on search for domain-independent planning.

Examples of typical topics for submissions to this workshop are:

  • automatic derivation of heuristic estimators for domain-independent planning
  • search techniques for domain-independent planning
  • synergy between heuristics and search in domain-independent planning
  • challenging domains for heuristic search planning


Please format submissions in AAAI style (see instructions at 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 should be made through EasyChair:

Deadline and Dates

  • Submission deadline: February 20, 2015 EXTENDED March 6, 2015
  • Notification: March 20, 2015
  • Workshop date: June 8th, 2015

Every submission will be reviewed by two members of the organizing committee according to the usual criteria such as relevance to the workshop, significance of the contribution, and technical quality. The review process will be single-blind: the authors' identity will be known to the reviewers, but not vice versa.

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.

At least one author of each accepted paper must attend the workshop in order to present the paper. Authors must register for the ICAPS main conference in order to attend the workshop. There will be no separate workshop-only registration.