Welcome
Important Dates
New! Registration
Program
Call for papers
Accepted papers
Workshops
Tutorials
System Demonstrations
International Planning Competition
Doctoral Consortium
Summer School
Venue
Colocated Events
Organization
ICAPS
Sponsors
Click image to download Poster (size: A1)

List of Accepted Full Papers

(click here for Short Papers)
  • Bounded Branching and Modalities in Non-Deterministic Planning
    Blai Bonet

  • Optimal Rectangle Packing: A Meta-CSP Approach
    Michael Moffitt, Martha Pollack

  • New Complexity Results for Classical Planning Benchmarks
    Malte Helmert

  • Metatheoretic Plan Summarization and Comparison
    Karen Myers

  • Combining Knowledge Compilation and Search for Efficient Conformant Probabilistic Planning
    Jinbo Huang

  • Fast Probabilistic Planning Through Weighted Model Counting
    Carmel Domshlak, Joerg Hoffmann

  • An affectively driven planner for synthetic characters
    Ruth Aylett, Joao Dias, Ana Paiva

  • Safe LTL Assumption-Based Planning
    Alexandre Albore, Piergiorgio Bertoli

  • Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
    Daniel Bryce, Subbarao Kambhampati, David Smith

  • An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
    Chris Beck

  • Predictive Planning for Supply Chain Management
    David Pardoe, Peter Stone

  • Concurrent Probabilistic Planning in the Graphplan Framework
    Iain Little, Sylvie Thiebaux

  • Optimal Route Planning under Uncertainty
    Evdokia Nikolova, Matthew Brand, David Karger

  • Efficiently handling temporal knowledge in an HTN planner
    Luis Castillo, Juan Fdez-Olivares, Oscar Garcia-Perez, Francisco Palao Reinés

  • Plan Stability: Replanning versus Plan Repair
    Maria Fox, Alfonso Gerevini, Derek Long, Ivan Serina

  • Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
    Joerg Hoffmann, Carla Gomes, Bart Selman

  • Friends or Foes? An AI Planning Perspective on Abstraction and Search
    Joerg Hoffmann, Ashish Sabharwal, Carmel Domshlak

  • Feature Evaluation in Mixed-Initiative Systems: An Experimental Approach
    Gabriella Cortellessa, Amedeo Cesta

  • Lemma Reusing for SAT based Planning and Scheduling
    Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma

  • Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
    Matthew Streeter, Stephen Smith

  • Learning Heuristic Functions from Relaxed Plans
    Sungwook Yoon, Alan Fern, Robert Givan

  • Learning Depth-First Search
    Blai Bonet, Hector Geffner

  • Tractable Optimal Competitive Scheduling
    Jeremy Frank, James Crawford, Lina Khatib, Ronen Brafman

  • Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
    Mark Rogers, Adele Howe, Darrell Whitley

  • Goal Achievement in Partially Known, Partially Observable Domains
    Allen Chang, Eyal Amir

  • Bringing Users and Planning Technology Together. Experiences in SIADEX
    Juan Fdez-Olivares, Luis Castillo, Oscar Garcia-Perez, Francisco Palao Reinés

  • Scalable Planning for Distributed Stream Processing Systems
    Anton Riabov, Zhen Liu

  • Solving Factored MDPs with Exponential-Family Transition Models
    Branislav Kveton, Milos Hauskrecht

  • On Some Tractable Cases of Logical Filtering
    T. K. Satish Kumar, Stuart Russell

  • Explanation-Based Acquisition of Planning Operators
    Geoffrey Levine, Gerald DeJong

  • Stochastic Over-subscription Planning using Hierarchies of MDPs
    Nicolas Meuleau, Ronen Brafman, Emmanuel Benazera

  • Memory-Efficient Symbolic Heuristic Search
    Rune Jensen, Eric Hansen, Simon Richards, Rong Zhou

  • Incremental Scheduling to Maximize Quality in a Dynamic Environment
    Terry Zimmerman, Anthony Gallagher, Stephen Smith

List of Accepted Short Papers

(click here for Long Papers)
  • A Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling
    Salwani Abdullah and Edmund K. Burke

  • SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
    Rama Akkiraju, Biplav Srivastava, Anca-Andreea Ivan, Richard Goodwin, and Tanveer Syeda-Mahmood

  • Planning with Temporally Extended Goals Using Heuristic Search
    Jorge A. Baier and Sheila A. McIlraith

  • Run-Time Monitoring of the Execution of Plans for Web Service Composition
    Fabio Barbon, Paolo Traverso, Marco Pistore, and Michele Trainotti

  • Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
    Roman Barták and Ondrej Cepek

  • Towards Strong Cyclic Planning under Partial Observability
    Piergiorgio Bertoli, Alessandro Cimatti, and Marco Pistore

  • Automated Web Service Composition by On-the-Fly Belief Space Search
    Piergiorgio Bertoli, Marco Pistore, and Paolo Traverso

  • RRT-Plan: A Randomized Algorithm for STRIPS Planning
    Daniel Burfoot, Joelle Pineau, and Gregory Dudek

  • Motion Economy and Planning
    Özgen Canan and Aysenur Birtürk

  • Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing
    Minh Do and Wheeler Ruml

  • On the Compilation of Plan Constraints and Preferences
    Stefan Edelkamp

  • Reusing and Building a Policy Library
    Fernando Fernández and Manuela Veloso

  • Durative Planning in HTNs
    Robert P. Goldman

  • Robust Execution of Temporally Flexible Plans for Bipedal Walking Devices
    Andreas Hofmann and Brian Williams

  • Learning to Do HTN Planning
    Okhtay Ilghami, Dana S. Nau, and Héctor Muńoz-Avila

  • Learning Behaviors Models for Robot Execution Control
    Guillaume Infantes, Félix Ingrand, and Malik Ghallab

  • Planning for PDDL3 An OCSP Based Approach
    Bharat Ranjan Kavuluri, Naresh Babu Saladi, and Deepak Khemani

  • A New Principle for Incremental Heuristic Search: Theoretical Results
    Sven Koenig and Maxim Likhachev

  • Resource Contention Metrics for Oversubscribed Scheduling Problems
    Laurence A. Kramer and Stephen F. Smith

  • Probabilistic Planning with Nonlinear Utility Functions
    Yaxin Liu and Sven Koenig

  • Challenges for Temporal Planning with Uncertain Durations
    Mausam and Daniel S. Weld

  • Automated Planning Using Quantum Computation
    S. Naguleswaran, L. B. White, and I. Fuss

  • Knowledge-based Middleware as an Architecture for Planning and Scheduling Systems
    Bernd Schattenberg, Steffen Balzer, and Susanne Biundo

  • Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling
    Malcolm J. A. Strens

  • Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules
    Andrew M. Sutton, Adele Howe, and L. Darrell Whitley

  • On the Use of UML.P for Modeling a Real Application as a Planning Problem
    Tiago Stegun Vaquero, Flavio Tonidandel, Leliane Nunes de Barros, and José Reinaldo Silva

  • Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
    Mariusz Wzorek and Patrick Doherty

  • Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
    Zhao Xing, Yixin Chen, and Weixiong Zhang