Heuristics and Search for Domain-Independent Planning (HSDIP)

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 realisation 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) follows in the tradition of the "Heuristics for Domain-Independent Planning (HDIP)"  workshop series that was held at ICAPS 2007, 2009 and 2011. However, since the number contributions to the workshop relating to search (not just heuristics) has steadily grown, the ICAPS 2012 workshop widens the scope to explicitly encourage work on search for domain-independent planning.

 

Online Proceedings

Workshop Schedule

	Paper	Discussant
9:30-10:00	Andrey Kolobov, Mausam and Daniel Weld Stochastic Shortest Path MDPs with Dead Ends	Emil Keyder
10:00-10:30	Florent Teichteil-Königsbuch, Vincent Vidal and Guillaume Infantes Domain-Independent Relaxation Heuristics for Probabilistic Planning with Dead-ends	Mausam
10:30-11:00	Patrick Eyerich Preferring Properly: Increasing Coverage while Maintaining Quality in Anytime Temporal Planning	Jorge Baier
11:00-11:30	---- coffee break -----
11:30-12:00	Stefan Edelkamp, Peter Kissmann and Álvaro Torralba Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction	Malte Helmert
12:00-12:30	Daniel Borrajo and Manuela Veloso Probabilistically Reusing Plans in Deterministic Planning	Sven Koenig
12:30-14:00	---- lunch break ----
14:00-14:30	Roei Bahumi, Erez Karpas and Carmel Domshlak Deeply Preferred Operators: Lazy Search Meets Lookahead	Patrik Haslum
14:30-15:00	Bram Ridder and Maria Fox Introducing a new lifted Heuristic based on Lifted Relaxed Planning Graphs	Joerg Hoffmann
15:00-15:30	---- coffee break -----
15:30-16:00	Nir Lipovetzky and Hector Geffner Width and Serialization of Classical Planning Problems	Erez Karpas
16:00-16:30	Raz Nissim and Ronen Brafman Multi-Agent A* for Parallel and Distributed Systems	Wheeler Ruml
16:30-17:00	Sammy Davis-Mendelow, Jorge Baier and Sheila Mcilraith Making Reasonable Assumptions to Plan with Incomplete Information	Ronen Brafman
17:00-17:30	Michael Katz and Emil Keyder Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning	Carmel Domshlak