ICAPS 2011: Freiburg, Germany

• Preface.
  
• Organizing Committee.
  
• Program Committee.
  

Full Technical Papers

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

Short Papers

• Debdeep Banerjee, Patrik Haslum:
  Partial-Order Support-Link Scheduling.
  
• Blai Bonet:
  Abstraction Heuristics Extended with Counting Abstractions.
  
• Blai Bonet, Julio Castillo:
  A Complete Algorithm for Generating Landmarks.
  
• Avitan Gefen, Ronen I. Brafman:
  The Minimal Seed Set Problem.
  
• Alfonso Gerevini, Fabio Patrizi, Alessandro Saetti:
  An Effective Approach to Realizing Planning Programs.
  
• Carlos Hernández, Jorge A. Baier:
  Fast Subgoaling for Pathfinding via Real-Time Search.
  
• Thomas Keller, Patrick Eyerich:
  A Polynomial All Outcome Determinization for Probabilistic Planning.
  
• Christopher R. Mansley, Ari Weinstein, Michael L. Littman:
  Sample-Based Planning for Continuous Action Markov Decision Processes.
  
• Gian Diego Tipaldi, Kai Oliver Arras:
  Planning Problems for Social Robots.
  

Last update Sat May 18 18:05:22 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page