ICAPS 2010: Toronto, Ontario, Canada

Full Papers

• Vidal Alcázar, Daniel Borrajo, Carlos Linares López:
  Using Backwards Generated Goals for Heuristic Planning. 2-9
  
• Eric Beaudry, Froduald Kabanza, François Michaud:
  Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks. 10-17
  
• Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal:
  An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning. 18-25
  
• James C. Boerkoel Jr., Edmund H. Durfee:
  A Comparison of Algorithms for Solving the Multiagent Simple Temporal Problem. 26-33
  
• Steve A. Chien, Daniel Tran, Gregg Rabideau, Steve R. Schaffer, Dan Mandl, Stuart Frye:
  Timeline-Based Space Operations Scheduling with External Constraints. 34-41
  
• Amanda Jane Coles, Andrew Coles, Maria Fox, Derek Long:
  Forward-Chaining Partial-Order Planning. 42-49
  
• Carmel Domshlak, Michael Katz, Sagi Lefler:
  When Abstractions Met Landmarks. 50-56
  
• Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel:
  Perfect Hashing for State Space Exploration on the GPU. 57-64
  
• Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie Thiébaux:
  Cost-Optimal Factored Planning: Promises and Pitfalls. 65-72
  
• Na Fu, Pradeep Varakantham, Hoong Chuin Lau:
  Towards Finding Robust Execution Strategies for RCPSP/max with Durational Uncertainty. 73-80
  
• Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel:
  Coming Up With Good Excuses: What to do When no Plan Can be Found. 81-88
  
• Saket Joshi, Kristian Kersting, Roni Khardon:
  Self-Taught Decision Theoretic Planning with First Order Decision Diagrams. 89-96
  
• Andrey Kolobov, Mausam, Daniel S. Weld:
  Classical Planning in MDP Heuristics: with a Little Help from Generalization. 97-104
  
• Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher:
  Pattern Database Heuristics for Fully Observable Nondeterministic Planning. 105-112
  
• Carlos Mencía, María R. Sierra, Ramiro Varela:
  Partially Informed Depth-First Search for the Job Shop Problem. 113-120
  
• Hootan Nakhost, Martin Müller:
  Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. 121-128
  
• Léon Planken, Mathijs de Weerdt, Neil Yorke-Smith:
  Incrementally Solving STNs by Enforcing Partial Path Consistency. 129-136
  
• Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml:
  The Joy of Forgetting: Faster Anytime Search via Restarting. 137-144
  
• Richard Anthony Russell, Sean Holden:
  Handling Goal Utility Dependencies in a Satisfiability Framework. 145-152
  
• Andreas Sideris, Yannis Dimopoulos:
  Constraint Propagation in Propositional Planning. 153-160
  
• Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
  Computing Applicability Conditions for Plans with Loops. 161-168
  
• Son Thanh To, Tran Cao Son, Enrico Pontelli:
  A New Approach to Conformant Planning Using CNF*. 169-176
  
• Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto:
  Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. 177-184
  
• Stefan J. Witwicki, Edmund H. Durfee:
  Influence-Based Policy Abstraction for Weakly-Coupled Dec-POMDPs. 185-192
  
• Mariusz Wzorek, Jonas Kvarnström, Patrick Doherty:
  Choosing Path Replanning Strategies for Unmanned Aircraft Systems. 193-200
  
• Yuehua Xu, Alan Fern, Sung Wook Yoon:
  Iterative Learning of Weighted Rule Sets for Greedy Search. 201-208
  
• Sung Wook Yoon, Wheeler Ruml, J. Benton, Minh Binh Do:
  Improving Determinization in Hindsight for On-line Probabilistic Planning. 209-217
  

Short Technical Papers

• Emma Brunskill:
  When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters. 218-221
  
• Giuseppe Della Penna, Benedetto Intrigila, Daniele Magazzeni, Fabio Mercorio:
  A PDDL+ Benchmark Problem: The Batch Chemical Plant. 222-225
  
• Alfonso Gerevini, Alessandro Saetti, Ivan Serina:
  Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search. 226-229
  
• Robert P. Goldman, John Maraist:
  Shopper: A System for Executing and Simulating Expressive Plans. 230-233
  
• Malte Helmert, Hauke Lasinger:
  The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. 234-237
  
• Alexander Koller, Joerg Hoffmann:
  Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF. 238-241
  
• Raghuram Ramanujan, Ashish Sabharwal, Bart Selman:
  On Adversarial Search Spaces and Sampling-Based Planning. 242-245
  
• Gabriele Röger, Malte Helmert:
  The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. 246-249
  
• Tansel Uras, Esra Erdem:
  Genome Rearrangement and Planning: Revisited. 250-253
  
• Jason Wolfe, Bhaskara Marthi, Stuart J. Russell:
  Combined Task and Motion Planning for Mobile Manipulation. 254-258
  

Challenge Papers

• J. Benton, Kartik Talamadupula, Patrick Eyerich, Robert Mattmüller, Subbarao Kambhampati:
  G-Value Plateaus: A Challenge for Planning. 259-262
  
• Nilufer Onder, Amlan Mukherjee, Pei Tang:
  Construction Management Applications: Challenges in Developing Execution Control Plans. 263-267
  

Invited Speaker Abstracts

• Holger H. Hoos:
  Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and Beyond. 268-269
  
• Daniele Nardi:
  Robotic Agents for Disaster Response Robotics. 270
  
• Moshe Y. Vardi:
  From Automated Verification to Automated Design. 271
  

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