List of Accepted Papers

Full Technical Papers

• Alexandre Albore, Miquel Ramirez and Hector Geffner
  Effective Heuristics and Belief Tracking for Planning with Incomplete Information
• Maliheh Aramon Bajestani and J. Christopher Beck
  Scheduling an Aircraft Repair Shop
• Christer Bäckström and Peter Jonsson
  Limits for Compact Representations of Plans
• Amanda Coles and Andrew Coles
  LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
• Amanda Coles, Andrew Coles, Allan Clark and Stephen Gilmore
  Cost-Sensitive Concurrent Planning under Duration Uncertainty for Service-Level Agreements
• Stephen Cresswell and Peter Gregory
  Generalised Domain Model Acquisition from Action Traces
• Minh Do, Kazumichi Okajima, Serdar Uckun, Fumio Hasegawa, Yukihiro Kawano, Koji Tanaka, Lara Crawford, Ying Zhang and Aki Ohashi
  Online Planning for a Material Control System for Liquid Crystal Display Manufacturing
• Alan Fern and Paul Lewis
  Ensemble Monte-Carlo Planning: An Empirical Study
• José E. Flórez, Álvaro Torralba Arias de Reyna, Javier García, Carlos Linares López, Ángel García-Olaya and Daniel Borrajo
  Planning Multi-Modal Transportation Problems
• Maria Fox, Derek Long and Daniele Magazzeni
  Automatic Construction of Efficient Multiple Battery Usage Policies
  (best paper)
• Emili Hernandez, Marc Carreras and Pere Ridao
  A Path Planning Algorithm for an AUV Guided with Homotopy Classes
• Jesse Hoey and Marek Grzes
  Distributed Control of Situated Assistance in Large Domains with Many Tasks
• Jörg Hoffmann
  Where Ignoring Delete Lists Works, Part II: Causal Graphs
• Richard Hoshino and Ken-ichi Kawarabayashi
  The Multi-Round Balanced Traveling Tournament Problem
• Anders Jonsson and Michael Rovatsos
  Scaling Up Multiagent Planning: A Best-Response Approach
• Erez Karpas, Michael Katz and Shaul Markovitch
  When Optimal is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings
• Andrey Kolobov, Mausam, Daniel S. Weld and Hector Geffner
  Heuristic Search for Generalized Stochastic Shortest Path MDPs
• Jonas Kvarnström
  Planning for Loosely Coupled Agents using Partial Order Forward-Chaining
• Boris Lesner and Bruno Zanuttini
  Efficient Policy Construction for MDPs Represented in Probabilistic PDDL
• Nir Lipovetzky and Hector Geffner
  Searching for Plans with Carefully Designed Probes
• Michael D. Moffitt and Gernot E. Günther
  Scalable Scheduling for Hardware-Accelerated Functional Verification
• Léon Planken, Mathijs de Weerdt and Roman van der Krogt
  Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
  (honorable mention for best student paper)
• Aldo Porco, Alejandro Machado and Blai Bonet
  Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS
• Julie Porteous, Jonathan Teutenberg, David Pizzi and Marc Cavazza
  Visual Programming of Plan Dynamics Using Constraints and Landmarks
• Pascal Poupart, Kee-Eung Kim and Dongho Kim
  Closing the Gap: Improved Bounds on Optimal POMDP Solutions
• Raghuram Ramanujan and Bart Selman
  Trade-Offs in Sampling-Based Adversarial Planning
  (honorable mention for best student paper)
• Jussi Rintanen
  Heuristics for Planning with SAT and Expressive Action Definitions
• Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König and Benoit Darties
  Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph
• Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein and Tianjiao Zhang
  Directed Search for Generalized Plans Using Classical Planners
• Roni Stern, Rami Puzis and Ariel Felner
  Potential Search: A Bounded-Cost Search Algorithm
• Damian Sulewski, Stefan Edelkamp and Peter Kissmann
  Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU
• Jordan T. Thayer, Austin Dionne and Wheeler Ruml
  Learning Inadmissible Heuristics during Search
• Son Thanh To, Tran Cao Son and Enrico Pontelli
  Contingent Planning as AND/OR Forward Search with Disjunctive Representation
• Javier Velez, Garrett Hemann, Albert S. Huang, Ingmar Posner and Nicholas Roy
  Planning to Perceive: Exploiting Mobility For Robust Object Detection
  (best student paper)
• Christopher Weber and Daniel Bryce
  Planning and Acting in Incomplete Domains
• Paul Weng
  Markov Decision Processes with Ordinal Rewards: Reference Point-Based Preferences
• Rong Zhou and Eric A. Hansen
  Dynamic State-Space Partitioning in External-Memory Graph Search
• Hankz Hankui Zhuo, Qiang Yang, Rong Pan and Lei Li
  Cross-Domain Action-Model Acquisition for Planning Via Web Search

Short Papers

• Debdeep Banerjee and Patrik Haslum
  Partial-Order Support-Link Scheduling
• Blai Bonet
  Abstraction Heuristics Extended with Counting Abstractions
• Blai Bonet and Julio Castillo
  A Complete Algorithm for Generating Landmarks
• Avitan Gefen and Ronen I. Brafman
  The Minimal Seed Set Problem
• Alfonso E. Gerevini, Fabio Patrizi and Alessandro Saetti
  An Effective Approach to Realizing Planning Programs
• Carlos Hernández and Jorge A. Baier
  Fast Subgoaling for Pathfinding Via Real-Time Search
• Thomas Keller and Patrick Eyerich
  A Polynomial All Outcome Determinization for Probabilistic Planning
• Chris Mansley, Ari Weinstein and Michael L. Littman
  Sample-Based Planning for Continuous Action Markov Decision Processes
• Gian Diego Tipaldi and Kai O. Arras
  Planning Problems for Social Robots