Atibaia, São Paulo, Brazil
June 25-29, 2012

List of Accepted Papers

Full Technical Papers

  • Incremental Lower Bounds for Additive Cost Planning Problems
    Patrik Haslum

  • Short-Sighted Stochastic Shortest Path Problems
    Felipe Trevizan and Manuela Veloso

  • MDD Propagation for Disjunctive Scheduling
    Andre A. Cire and Willen-Jan Van Hoeve

  • Automated Planning for Liner Shipping Fleet Repositioning
    Kevin Tierney, Rune M. Jensen, Christian Kroer, Adam Britt, Andrew Coles and Amanda Coles

  • Route Planning for Bicycles – Exact Constrained Shortest Paths made Practical via Contraction Hierarchy
    Sabine Storandt

  • Planning Modulo Theories: Extending the Planning Paradigm
    Peter Gregory, Derek Long, Maria Fox and Chris Beck

  • Optimal Search with Inadmissible Heuristics
    Erez Karpas and Carmel Domshlak

  • CP and MIP Methods for Ship Scheduling with Time-Varying Draft
    Elena Kelareva, Philip Kilby, Sylvie Thiebaux, Mark Wallace and Sebastian Brand

  • Making Hybrid Plans More Clear to Human Users – A Formal Approach for Generating Sound Explanations
    Batian Seegebarth, Felix Muller, Bernd Schattenberg and Susanne Biundo

  • About Partial Order Reduction in Planning and Computer Aided Verification
    Martin Wehrle and Malte Helmert

  • Tractable Monotone Temporal Planning
    Martin C. Cooper, Frederic Maris and Pierre Regnier

  • Semi-Relaxed Plan Heuristics
    Emil Keyder, Joerg Hoffmann and Patrik Haslum
    (Best Paper)

  • Plan-based Policy Learning for Autonomous Feature Tracking
    Maria Fox, Derek Long and Daniele Magazzeni

  • How to Relax a Bisimulation?
    Michael Katz, Joerg Hoffmann and Malte Helmert

  • Pruning Methods for Optimal Delete-Free Planning
    Avitan Gefen and Ronen Brafman

  • Long-run Stability in Dynamic Scheduling
    Daria Terekhov, Tony T. Tran, Douglas G. Down and Chris Beck

  • Faster Bounded-Cost Search Using Inadmissible Estimates
    Jordan Thayer, Roni Stern, Ariel Felner and Wheeler Ruml

  • Predicting Optimal Solution Cost with Bidirectional Stratified Sampling
    Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles and Robert Holte

  • The Application of Automated Planning to Machine Tool Calibration
    Simon Parkinson, A. Longstaff, A. Crampton and Peter Gregory

  • On Computing Conformant Plans Using Classical Planners: A Generate-And-Complete Approach
    Khoi Nguyen, Vien Tran, Son Tran and Enrico Pontelli
    (Best Student Paper)

  • Using AI Planning to Enhance E-learning Processes
    Antonio Garrido, Lluvia Morales and Ivan Serina

  • Fast Incremental Policy Compilation from Plans in Hybrid Probabilistic Domains
    Florent Teichteil-Königsbuch

  • Resource-Constrained Planning: A Monte-Carlo Random Walk Approach
    Hootan Nakhost, Joerg Hoffmann and Martin Mueller

  • Probabilistic Planning Based on UCT
    Thomas Keller and Patrick Eyerich

  • Improved Non-deterministic Planning by Exploiting State Relevance
    Christian Muise, Chris Beck and Sheila Mcilraith

  • Planning via Random Walk-Driven Local Search
    Fan Xie, Hootan Nakhost and Martin Muller

  • A Novel Approach to Blocking Job Shop through Iterative Improvement Algorithms
    Angelo Oddi, Riccardo Rasconi, Amedeo Cesta and Stephen F. Smith

  • Incremental ARA*: An Anytime Incremental Search Algorithm for Moving Target Search
    Xiaoxun Sun, William Yeoh, Tansel Uras and Sven Koenig

  • Risk-Variant Policy Switching to Exceed Reward Thresholds
    Breelyn Kane and Reid Simmons

  • Tackling Finite-Horizon MDPs with Large Branching Factors
    Andrey Kolobov, Peng Dai, Mausam and Daniel Weld

  • Schedule-Driven Coordination for Real-Time Traffic Network Control
    Xiao-Feng Xie, Stephen F. Smith and Gregory J. Barlow

  • Sampling-Based Coverage Path Planning for Inspection of Complex Structures
    Brendan Englot and Franz Hover

  • Incremental Trajectory Optimization for Real-time Replanning in Dynamic Environments
    Chonhyon Park, Jia Pan and Dinesh Manocha

Short Papers

  • Anticipatory On-line Planning
    Ethan Burns, J. Benton, Wheeler Ruml, Minh Do and Sungwook Yoon

  • Learning Portfolios of Automatically Configured Planners
    Jendrik Seipp, Manuel Braun, Johannes Garimort and Malte Helmert

  • Optimal Planning for Delete-free Tasks with Incremental LM-cut
    Florian Pommerening and Malte Helmert

  • On Modeling the Tactical Planning of Oil Pipeline Networks
    Daniel F. Ferber

  • Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search
    Carmel Domshlak, Michael Katz and Alexander Shleyfman

  • Minimal Landmarks for Optimal Delete-Relaxed Planning
    Patrik Haslum, John Slaney and Sylvie Thiebaux

  • Optimizing Plans through Analysis of Action Dependencies and Independencies
    Lukas Chrpa, Thomas Lee Mccluskey and Hugh Osborne

  • Optimally Relaxing Partial-Order Plans with MaxSAT
    Christian Muise, Sheila Mcilraith and Chris Beck

Special Track on Continuous Planning

  • Temporal Planning with Preferences and Time-Dependent Continuous Costs
    J. Benton, Amanda Coles and Andrew Coles
    (Best Student Paper - Special Track)

  • Integrating Vehicle Routing and Motion Planning
    Scott Kiesel, Ethan Burns, Christopher Wilt and Wheeler Ruml

  • Bandit-Based Planning and Learning in Continuous-Action Markov Decision Processes
    Ari Weinstein and Michael Littman

  • A Planning Based Framework for Controlling Hybrid Systems
    Johannes Lohr, Patrick Eyerich, Thomas Keller and Bernhard Nebel