Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling
Edited by Shlomo Zilberstein, Jana Koehler, and Sven Koenig
Whistler, British Columbia, Canada June 3–7, 2004. Published by The AAAI Press, Menlo Park, California. This proceedings is also available in book format.
Please Note: Abstracts are linked to individual titles, and will appear in a separate browser window. Full-text versions of the papers are linked to the abstract text. Access to full text may be restricted to AAAI members. PDF file sizes may be large!
Contents
Preface / ix
Shlomo Zilberstein, Jana Koehler, and Sven Koenig
ICAPS 2004 Organizing Committee / xi
ICAPS 2004 Program Committee / xi
ICAPS 2004 Sponsoring Organizations / xiv
Cognitive Robotics (Joint ICAPS/KR Session)
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing / 2
Ronald P. A. Petrick and Fahiem Bacchus
Knowledge of Other Agents and Communicative Actions in the Fluent Calculus* / 12
Yves Martin, Iman Narasamdya, and Michael Thielscher
Precondition Control and the Progression Algorithm* / 23
Alfredo Gabaldon
A Preference-Based Interpretation of Other Agents’ Actions* / 33
Jérôme Lang
Knowledge in Planning (Joint ICAPS/KR Session)
From Hybrid Systems to Universal Plans via Domain Compilation / 44
Anthony Barrett
Planning Graphs and Knowledge Compilation* / 52
Héctor Geffner
Domain-Specific Preferences for Causal Reasoning and Planning* / 63
James P. Delgrande, Torsten Schaub, and Hans Tompits
Learning Probabilistic Relational Planning Rules / 73
Hanna M. Pasula, Luke S. Zettlemoyer, and Leslie Pack Kaelbling
Search in Planning and Scheduling (Joint ICAPS/KR Session)
An Improved Integer Local Search for Complex Scheduling Problems / 83
Weixiong Zhang and Xiaotao Zhang
Breadth-First Heuristic Search / 92
Rong Zhou and Eric A. Hansen
Phase Transitions in Classical Planning: An Experimental Study* / 101
Jussi Rintanen
A Polynomial Time Algorithm for Constructing k-Maintainable Policies / 111
Chitta Baral and Thomas Eiter
Search in Planning and Scheduling
Multiple Pattern Databases / 122
Robert C. Holte, Jack Newton, Ariel Felner, Ram Meshulam, and David Furcy
A Linear Search Strategy using Bounds / 132
Sharlee Climer and Weixiong Zhang
Optimal Rectangle Packing: New Results / 142
Richard E. Korf
A Lookahead Strategy for Heuristic Search Planning / 150
Vincent Vidal
Classical Planning
A Planning Heuristic Based on Causal Graph Analysis / 161
Malte Helmert
An Empirical Analysis of Some Heuristic Features for Local Search in LPG / 171
Alfonso Gerevini, Alessandro Saetti, and Ivan Serina
Using Component Abstraction for Automatic Generation of Macro-Actions / 181
Adi Botea, Martin Müller, and Jonathan Schaeffer
Learning Domain-Specific Control Knowledge from Random Walks / 191
Alan Fern, SungWook Yoon, and Robert Givan
Scheduling
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling / 200
Laurent Michel and Pascal Van Hentenryck
Generating Robust Schedules through Temporal Flexibility / 209
Nicola Policella, Stephen F. Smith, Amedeo Cesta, and Angelo Oddi
The Value of Consensus in Online Stochastic Scheduling / 219
Russell Bent and Pascal Van Hentenryck
Trading Places: How to Schedule More in a
Multi-Resource Oversubscribed Scheduling Problem / 227
Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, and Mark Roberts
Task Swapping for Schedule Improvement: A Broader Analysis / 235
Laurence A. Kramer and Stephen F. Smith
Price Prediction Strategies for Market-Based Scheduling / 244
Jeffrey K. MacKie-Mason, Anna Osepayshvili, Daniel M. Reeves, and Michael P. Wellman
Two-Job Shop Scheduling Problems with Availability Constraints / 253
Riad Aggoune
Incremental Maximum Flows for Fast Envelope Computation / 260
Nicola Muscettola
Model Checking and Plan Recognition
Planning with Extended Goals and Partial Observability / 270
Piergiorgio Bertoli and Marco Pistore
Guiding Planner Backjumping Using Verifier Traces / 279
Robert P. Goldman, Michael J. S. Pelican, and David J. Musliner
Probabilistic Plan Recognition in Multiagent Systems / 287
Suchi Saria and Sridhar Mahadevan
Statistical Goal Parameter Recognition / 297
Nate Blaylock and James Allen
Probabilistic Planning
Heuristic Refinements of Approximate Linear Programming for
Factored Continuous-State Markov Decision Processes / 306
Branislav Kveton and Milos Hauskrecht
Optimal Resource Allocation and Policy Formulation in
Loosely-Coupled Markov Decision Processes / 315
Dmitri A. Dolgov and Edmund H. Durfee
Policy Generation for Continuous-time Stochastic Domains with Concurrency / 325
Håkan L. S. Younes and Reid G. Simmons
Nondeterministic Planning
Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in
Symbolic Non-Deterministic Planning / 335
Rune M. Jensen, Manuela M. Veloso, and Randal E. Bryant
Complexity of Planning with Partial Observability / 345
Jussi Rintanen
Conformant Planning via Heuristic Forward Search:
A New Approach / 355
Ronen I. Brafman and Jörg Hoffmann
Heuristic Guidance Measures for Conformant Planning / 365
Daniel Bryce and Subbarao Kambhampati
Planning and Scheduling Applications
Plays as Effective Multiagent Plans Enabling Opponent-Adaptive Play Selection / 376
Michael Bowling, Brett Browning, and Manuela Veloso
Distributed Feedback Control for Decision Making on Supply Chains / 384
Christopher Kiekintveld, Michael P. Wellman, Satinder Singh, Joshua Estelle,
Yevgeniy Vorobeychik, Vishal Soni, and Matthew Rudary
Choosing Objectives in Over-Subscription Planning / 393
David E. Smith
Decision-Theoretic Military Operations Planning / 402
Douglas Aberdeen, Sylvie Thiébaux, and Lin Zhang
Index / 413
* Denotes a KR Conference Paper