ICAPS-11
| Preface | |
| Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert |
| Organizing Committee | |
| Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert |
| Program Committee | |
| Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert |
Full Technical Papers
| Effective Heuristics and Belief Tracking for Planning with Incomplete Information | |
| Alexandre Albore, Miquel Ramírez, Hector Geffner |
| Scheduling an Aircraft Repair Shop | |
| Maliheh Aramon Bajestani, J. Christopher Beck |
| Limits for Compact Representation of Plans | |
| Christer Backstrom, Peter Jonsson |
| LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences | |
| Amanda Coles, Andrew Coles |
| Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level Agreements | |
| Andrew Ian Coles, Amanda Jane Coles, Allan Clark, Stephen Gilmore |
| Generalised Domain Model Acquisition from Action Traces | |
| Stephen Cresswell, Peter Gregory |
| Online Planning for a Material Control System for Liquid Crystal Display Manufacturing | |
| Minh Do, Kazumichi Okajima, Serdar Uckun, Fumio Hasegawa, Yukihiro Kawano, Koji Tanaka, Lara Crawford, Ying Zhang, Aki Ohashi |
| Ensemble Monte-Carlo Planning: An Empirical Study | |
| Alan Fern, Paul Lewis |
| Planning Multi-Modal Transportation Problems | |
| José E. Flórez, Álvaro Torralba Arias de Reyna, Javier García, Carlos Linares López, Ángel García-Olaya, Daniel Borrajo |
| Automatic Construction of Efficient Multiple Battery Usage Policies | |
| Maria Fox, Derek Long, Daniele Magazzeni |
| A Path Planning Algorithm for an AUV Guided with Homotopy Classes | |
| Emili Hernandez, Marc Carreras, Pere Ridao |
| Distributed Control of Situated Assistance in Large Domains with Many Tasks | |
| Jesse Hoey, Marek Grzes |
| Where Ignoring Delete Lists Works, Part II: Causal Graphs | |
| Joerg Hoffmann |
| The Multi-Round Balanced Traveling Tournament Problem | |
| Richard Hoshino, Ken-ichi Kawarabayashi |
| Scaling Up Multiagent Planning: A Best-Response Approach | |
| Anders Jonsson, Michael Rovatsos |
| When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings | |
| Erez Karpas, Michael Katz, Shaul Markovitch |
| Heuristic Search for Generalized Stochastic Shortest Path MDPs | |
| Andrey Kolobov, Mausam Mausam, Daniel S. Weld, Hector Geffner |
| Planning for Loosely Coupled Agents Using Partial Order Forward-Chaining | |
| Jonas Kvarnström |
| Efficient Policy Construction for MDPs Represented in Probabilistic PDDL | |
| Boris Lesner, Bruno Zanuttini |
| Searching for Plans with Carefully Designed Probes | |
| Nir Lipovetzky, Hector Geffner |
| Scalable Scheduling for Hardware-Accelerated Functional Verification | |
| Michael D. Moffitt, Gernot E. Günther |
| Computing All-Pairs Shortest Paths by Leveraging Low Treewidth | |
| Léon R. Planken, Mathijs M. de Weerdt, Roman P.J. van der Krogt |
| Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS | |
| Aldo Porco, Alejandro Machado, Blai Bonet |
| Visual Programming of Plan Dynamics Using Constraints and Landmarks | |
| Julie Porteous, Jonathan Teutenberg, David Pizzi, Marc Cavazza |
| Closing the Gap: Improved Bounds on Optimal POMDP Solutions | |
| Pascal Poupart, Kee-Eung Kim, Dongho Kim |
| Trade-Offs in Sampling-Based Adversarial Planning | |
| Raghuram Ramanujan, Bart Selman |
| Heuristics for Planning with SAT and Expressive Action Definitions | |
| Jussi Rintanen |
| Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph | |
| Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoit Darties |
| Directed Search for Generalized Plans Using Classical Planners | |
| Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang |
| Potential Search: A Bounded-Cost Search Algorithm | |
| Roni Tzvi Stern, Rami Puzis, Ariel Felner |
| Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU | |
| Damian Sulewski, Stefan Edelkamp, Peter Kissmann |
| Learning Inadmissible Heuristics During Search | |
| Jordan Tyler Thayer, Austin Dionne, Wheeler Ruml |
| Contingent Planning as AND/OR Forward Search with Disjunctive Representation | |
| Son Thanh To, Tran Cao Son, Enrico Pontelli |
| Planning to Perceive: Exploiting Mobility for Robust Object Detection | |
| Javier Velez, Garrett Hemann, Albert S. Huang, Ingmar Posner, Nicholas Roy |
| Planning and Acting in Incomplete Domains | |
| Christopher Weber, Daniel Bryce |
| Markov Decision Processes with Ordinal Rewards: Reference Point-Based Preferences | |
| Paul Weng |
| Dynamic State-Space Partitioning in External-Memory Graph Search | |
| Rong Zhou, Eric A. Hansen |
| Cross-Domain Action-Model Acquisition for Planning via Web Search | |
| Hankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li |
Short Papers
| Partial-Order Support-Link Scheduling | |
| Debdeep Banerjee, Patrik Haslum |
| Abstraction Heuristics Extended with Counting Abstractions | |
| Blai Bonet |
| A Complete Algorithm for Generating Landmarks | |
| Blai Bonet, Julio Castillo |
| The Minimal Seed Set Problem | |
| Avitan Gefen, Ronen I. Brafman |
| An Effective Approach to Realizing Planning Programs | |
| Alfonso Gerevini, Fabio Patrizi, Alessandro Saetti |
| Fast Subgoaling for Pathfinding via Real-Time Search | |
| Carlos Hernandez, Jorge A. Baier |
| A Polynomial All Outcome Determinization for Probabilistic Planning | |
| Thomas Keller, Patrick Eyerich |
| Sample-Based Planning for Continuous Action Markov Decision Processes | |
| Chris Mansley, Ari Weinstein, Michael Littman |
| Planning Problems for Social Robots | |
| Gian Diego Tipaldi, Kai Oliver Arras |