ICAPS 04 Logo 14Th International Conference on Automated Planning & Scheduling

Whistler, British Columbia, Canada, June 3-7 2004
Welcome to ICAPS 2004
Registration Quicklink
Accommodation Quicklink
Author Instructions Quicklink
Program Quicklink
At a Glance
Program Details
Accepted Papers
About the Venue

Accepted Papers

ICAPS 2004 Camera Ready Paper Submission Instuctions

Best Paper Award: Conformant Planning via Heuristic Forward Search: A New Approach
      Ronen Brafman, Joerg Hoffmann

Best Paper Runner Up: Multiple Pattern Databases
      Robert C. Holte, Jack Newton, Ariel Felner, Ram Meshulam, David Furcy

Best Student Paper Award: A Planning Heuristic Based on Causal Graph Analysis
      Malte Helmert

Best Student Paper Award: Breadth-First Heuristic Search
      Eric Hansen, Rong Zhou

Best Student Paper Runner Up: Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
      Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, Mark Roberts

A Lookahead Strategy for Heuristic Search Planning
      Vincent Vidal

Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
      Laurent Michel, Pascal Van Hentenryck

The Value of Consensus in Online Stochastic Scheduling
      Russell Bent, Pascal Van Hentenryck

Using Component Abstraction for Automatic Generation of Macro-actions
      Adi Botea, Martin Mueller, Jonathan Schaeffer

Optimal Rectangle Packing: New Results
      Richard Korf

From Hybrid Systems to Universal Plans via Domain Compilation
      Anthony Barrett

Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning
      Rune M. Jensen, Manuela M. Veloso, Randal E. Bryant

Complexity of Planning with Partial Observability
      Jussi Rintanen

Planning with Extended Goals and Partial Observability
      Piergiorgio Bertoli, Marco Pistore

Policy Generation for Continuous-time Stochastic Domains with Concurrency
      Hakan L. S. Younes, Reid G. Simmons

Heuristic Guidance Measures for Conformant Planning
      Daniel Bryce, Subbarao Kambhampati

An Improved Integer Local Search for Complex Scheduling Problems
      Weixiong Zhang, Xiaotao Zhang

Generating Robust Schedules through Temporal Flexibility
      Nicola Policella, Stephen F. Smith, Amedeo Cesta, Angelo Oddi

Learning Probabilistic Relational Planning Rules
      Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack Kaelbling

Guiding Planner Backjumping Using Verifier Traces
      Robert P. Goldman, Michael J. S. Pelican, David J. Musliner

Learning Domain-Specific Control Knowledge from Random Walks
      Alan Fern, SungWook Yoon, Robert Givan

A Polynomial time algorithm for constructing k-maintainable policies
      Chitta Baral, Thomas Eiter

Decision-Theoretic Military Operations Planning
      Douglas Aberdeen, Sylvie Thiebaux, Lin Zhang

Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing
      Ronald P. Petrick, Fahiem Bacchus

Plays as Effective Multiagent Plans Enabling Opponent-Adaptive Play Selection
      Michael Bowling , Brett Browning , Manuela Veloso

Distributed Feedback Control for Decision Making on Supply Chains
      Christopher Kiekintveld, Michael P. Wellman, Satinder Singh, Joshua Estelle, Yevgeniy Vorobeychik, Vishal Soni, Matthew Rudary

A Linear Search Strategy using Bounds
      Sharlee Climer, Weixiong Zhang

An Empirical Analysis of Some Heuristic Features for Local Search in LPG
      Alfonso Gerevini, Alessandro Saetti, Ivan Serina

Choosing Objectives in Over-Subscription Planning
      David Smith

Probabilistic Plan Recognition in Multiagent Systems
      Suchi Saria, Sridhar Mahadevan

Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
      Dmitri Dolgov, Edmund Durfee

Task Swapping for Schedule Improvement: A Broader Analysis
      Laurence Kramer, Stephen Smith

Incremental Maximum Flows for Fast Envelope Computation
      Nicola Muscettola

Price Prediction Strategies for Market-Based Scheduling
      Jeffrey MacKie-Mason, Anna Osepayshvili, Daniel Reeves, Michael Wellman

Statistical Goal Parameter Recognition
      Nate Blaylock, James Allen

Two-job Shop Scheduling Problems with Availability Constraints
      Riad Aggoune

Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
      Branislav Kveton, Milos Hauskrecht

If you have any difficulty with the paper submission software, please contact icaps04@cs.drexel.edu.
Last modified: Tue Jun 15 08:59:22 Eastern Daylight Time 2004