Heuristics and Search for Domain Independent Planning (HSDIP)
Download the Online Proceedings
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.
Topics of Interest
Examples of typical topics of interest for 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
Accepted Papers
- Stochastic Shortest Path MDPs with Dead Ends
Andrey Kolobov, Mausam and Daniel Weld - Domain-Independent Relaxation Heuristics for Probabilistic Planning with Dead-ends
Florent Teichteil-Königsbuch, Vincent Vidal and Guillaume Infantes - Preferring Properly: Increasing Coverage while Maintaining Quality in Anytime Temporal Planning
Patrick Eyerich - Probabilistically Reusing Plans in Deterministic Planning
Daniel Borrajo and Manuela Veloso - Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction
Stefan Edelkamp, Peter Kissmann and Álvaro Torralba - Deeply Preferred Operators: Lazy Search Meets Lookahead
Roei Bahumi, Erez Karpas and Carmel Domshlak - Introducing a new lifted Heuristic based on Lifted Relaxed Planning Graphs [video]
Bram Ridder and Maria Fox - Width and Serialization of Classical Planning Problems
Nir Lipovetzky and Hector Geffner - Multi-Agent A* for Parallel and Distributed Systems
Raz Nissim and Ronen Brafman - Making Reasonable Assumptions to Plan with Incomplete Information
Sammy Davis-Mendelow, Jorge Baier and Sheila Mcilraith - Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning
Michael Katz and Emil Keyder
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 |
Daniel Borrajo and Manuela Veloso Probabilistically Reusing Plans in Deterministic Planning | Sven Koenig |
| 12:00-12:30 |
Stefan Edelkamp, Peter Kissmann and Álvaro Torralba Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction | Malte Helmert |
| 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 |
Submission
Please format submissions in AAAI style and keep them to at most 9 pages. 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: http://www.easychair.org/conferences/?conf=hsdip2012.
We have two different submission deadlines, with two different notification dates:- March 1st, 2012 (acceptance notification by March 16th, 2012)
- April 1st, 2012 (acceptance notification by April 16th, 2012)
If you want to guarantee that you are notified of acceptance before the early registration deadline, with ample time to make travel arrangements, please submit before the early registration deadline.
As a general rule, we will not write detailed reviews for each submission, but only make a decision to accept/reject with a short explanation. We encourage potential authors to seek independent reviews of their papers on their own, before submission. If you are submitting a paper and would like us to write a detailed review, please let a member of the organizing committee know, although we will only be able to accommodate a small number of such requests.
Workshop Format
The workshop will be one day. The format will follow the HDIP tradition, with presentations followed by ample time for questions and (often lively) discussions.Organizing Committee
- Patrik Haslum, ANU
- Malte Helmert, University of Basel
- Erez Karpas, Technion
- Carlos Linares Lopez, Universidad Carlos III de Madrid
- Gabriele Röger, University of Basel
- Jordan Thayer, UNH
- Rong Zhou, PARC
- Sven Koenig, USC