ICAPS 2012 Presentations

Session Ia: Temporal Planning and Scheduling

Tractable Monotone Temporal Planning (N.A.)
M. C. Cooper, F. Maris and P. Regnier

MDD Propagation for Disjunctive Scheduling  (< 1 Mb)
A. A. Cire and W. Van Hoeve

Long-run Stability in Dynamic Scheduling   (< 1 Mb)
D. Terekhov, T. T. Tran, D. G. Down
and J. C. Beck

Iterative Improvement Algorithms for the Blocking Job Shop  (8.8 Mb)
A. Oddi, R. Rasconi, A. Cesta and S. F. Smith

Session Ib: Combining Heuristics and Search for Optimal Planning

About Partial Order Reduction in Planning and Computer Aided Verification  (<1Mb)
M. Wehrle and M. Helmert

Pruning Methods for Optimal Delete-Free Planning (< 1 Mb)
A. Gefen and R. Brafman

Optimal Planning for Delete-free Tasks with Incremental LM-cut (< 1 Mb)
F. Pommerening and M. Helmert

Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search (2 Mb)
C. Domshlak, M. Katz and A. Shleyfman

Session IIa: Special Track on Continuous Planning

A Planning Based Framework for Controlling Hybrid Systems  (1.8 Mb)
J. Lohr, P. Eyerich, T. Keller and B. Nebel

Bandit-Based Planning and Learning in Continuous-Action
Markov Decision Processes  (< 1 Mb)
A. Weinstein and M. Littman

Integrating Vehicle Routing and Motion Planning  (< 1 Mb)
S. Kiesel, E. Burns, C. Wilt and W. Ruml

Session IIb: Admissible Heuristics in Optimal Planning

Incremental Lower Bounds for Additive Cost Planning Problems  (< 1 Mb)
P. Haslum

How to Relax a Bisimulation?  (< 1 Mb)
M. Katz, J. Hoffmann and M. Helmert

Minimal Landmarks for Optimal Delete-Relaxed Planning (< 1 Mb)
P. Haslum, J. Slaney and S. Thiébaux

Session IIIa: Robot Path Planning

Incremental ARA*: An Anytime Incremental Search Algorithm for
Moving Target Search  (1.7 Mb)
X. Sun, W. Yeoh, T. Uras and S. Koenig

Sampling-Based Coverage Path Planning for Inspection of Complex Structures  (10.7 Mb)
B. Englot and F. Hover

ITOMP: Incremental Trajectory Optimization for Real-time Replanning in
Dynamic Environments  (3.1 Mb)
C. Park, J. Pan and D. Manocha

Session IIIb: Enhancing Descriptions and I mproving Plans

Planning Modulo Theories: Extending the Planning Paradigm  ( 1 Mb)
P. Gregory, D. Long, M. Fox and J. C. Beck

Optimizing Plans through Analysis of Action Dependencies and Independencies (< 1 Mb)
L. Chrpa, T. L. McCluskey and H. Osborne

Optimally Relaxing Partial-Order Plans with MaxSAT  (2.2 Mb)
C. Muise, S. McIlraith and J. C. Beck

Session IVa: Planning and Scheduling in the Real World

Making Hybrid Plans More Clear to Human Users – A Formal Approach for Generating
Sound Explanations (< 1 Mb)
B. Seegebarth, F. Muller, B. Schattenberg and S. Biundo

The Application of Automated Planning to Machine Tool Calibration (2.4 Mb)
S. Parkinson, A. Longstaff, A. Crampton and P. Gregory

Using AI Planning to Enhance E-learning Processes  (2 Mb)
A. Garrido, L. Morales and I. Serina

On Modeling the Tactical Planning of Oil Pipeline Networks (< 1 Mb)
D. F. Ferber

Session IVb: Learning and Local Search in Planning
 

Plan-based Policy Learning for Autonomous Feature Tracking (1.1 Mb)
M. Fox, D. Long and D. Magazzeni

Resource-Constrained Planning: A Monte-Carlo Random Walk Approach (2.4 Mb)
H. Nakhost, J. Hoffmann and M. Mueller

Planning via Random Walk-Driven Local Search (< 1 Mb)
F. Xie, H. Nakhost and M. Mueller

Learning Portfolios of Automatically Configured Planners  (< 1 Mb)
J. Seipp, M. Braun, J. Garimort and M. Helmert

Session V: Best Papers

Temporal Planning with Preferences and Time-Dependent Continuous Costs  (1 Mb)
(Best Student Paper - Special Track)
J. Benton, A. Coles and A. Coles

On Computing Conformant Plans Using Classical Planners:
A Generate-And-Complete Approach  (< 1 Mb)
(Best Student Paper)
K. Nguyen, V. Tran, S. Tran and E. Pontelli

Semi-Relaxed Plan Heuristics (< 1 Mb)
(Best Paper)
E. Keyder, J. Hoffmann and P. Haslum

Session VIa: Probabilistic and Non-Deterministic Planning I

Risk-Variant Policy Switching to Exceed Reward Thresholds (1.8 Mb)
B. Kane and R. Simmons

Fast Incremental Policy Compilation from Plans in Hybrid Probabilistic Domains  (1.7 Mb)
F. Teichteil-Königsbuch

Improved Non-deterministic Planning by Exploiting State Relevance  (7.6 Mb)
C. Muise, J. C. Beck and S. McIlraith

Anticipatory On-line Planning   (< 1 Mb)
E. Burns, J. Benton, W. Ruml, M. Do and S. Yoon

Session VIb: P&S for Shipping and Transportation

Automated Planning for Liner Shipping Fleet Repositioning (2.3 Mb)
K. Tierney, A. Coles A. Coles, C. Kroer, A. Britt, R. M. Jensen

CP and MIP Methods for Ship Scheduling with Time-Varying Draft  (1.2 Mb)
E. Kelareva, P. Kilby, S. Thiébaux,
M. Wallace and S. Brand

Schedule-Driven Coordination for Real-Time Traffic Network Control  (2.1 Mb)
X. Xie, S. F. Smith and G. J. Barlow

Route Planning for Bicycles – Exact Constrained Shortest Paths made Practical via
Contraction Hierarchy  (2.5 Mb)
S. Storandt

Session VIIa:  Probabilistic and Non-Deterministic Planning II

Short-Sighted Stochastic Shortest Path Problems  (1 Mb)
F. Trevizan and M. Veloso

Probabilistic Planning Based on UCT (< 1 Mb)
T. Keller and P. Eyerich

Tackling Finite-Horizon MDPs with Large Branching Factors (< 1 Mb)
A. Kolobov, P. Dai, Mausam and D. Weld

Session VIIb: Heuristic Search

Optimal Search with Inadmissible Heuristics (< 1 Mb)
E. Karpas and C. Domshlak

Faster Bounded-Cost Search Using Inadmissible Estimates (< 1 Mb)
J. Thayer, R. Stern, A. Felner and W. Ruml

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (3.2 Mb)
L. Lelis, R. Stern, A. Felner, S. Zilles and R. Holte