ICAPS 2010 Conference Proceedings Edited by Ronen Brafman, Héctor Geffner, Jörg Hoffmann, Henry Kautz Toronto, Ontario, Canada, May 12–16, 2010.
Published by The AAAI Press, Menlo Park, California. This proceedings is also available in book format
Preface / ix
Ronen Brafman, Héctor Geffner, Jörg Hoffmann, Henry Kautz
Full Papers Using Backwards Generated Goals for Heuristic Planning / 2 
Vidal Alcázar, Daniel Borrajo, Carlos Linares López Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks / 10
Eric Beaudry, Froduald Kabanza, Francois Michaud An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning / 18
Jacques Bibaï, Pierre Savéant, Marc Schoenauer, Vincent Vidal A Comparison of Algorithms for Solving the Multiagent Simple Temporal Problem / 26
James C. Boerkoel Jr., Edmund H. Durfee Timeline-Based Space Operations Scheduling with External Constraints / 34
Steve Chien, Daniel Tran, Gregg Rabideau, Steve Schaffer, Daniel Mandl, Stuart Frye Forward-Chaining Partial-Order Planning / 42
Amanda Jane Coles, Andrew Ian Coles, Maria Fox, Derek Long When Abstractions Met Landmarks / 50
Carmel Domshlak, Michael Katz, Sagi Lefler Perfect Hashing for State Space Exploration on the GPU / 57
Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel Cost-Optimal Factored Planning: Promises and Pitfalls / 65
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie Thiébaux Towards Finding Robust Execution Strategies for RCPSP/max with Durational Uncertainty / 73
Na Fu, Pradeep Varakantham, Hoong Chuin Lau Coming Up With Good Excuses: What to do When no Plan Can be Found / 81
Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel Self-Taught Decision Theoretic Planning with First Order Decision Diagrams / 89
Saket Subhash Joshi, Kristian Kersting, Roni Khardon Classical Planning in MDP Heuristics: with a Little Help from Generalization / 97
Andrey Kolobov, . Mausam, Daniel S. Weld Pattern Database Heuristics for Fully Observable Nondeterministic Planning / 105
Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher Partially Informed Depth-First Search for the Job Shop Problem / 113
Carlos Mencía, María R. Sierra, Ramiro Varela Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement / 121
Hootan Nakhost, Martin Müller Incrementally Solving STNs by Enforcing Partial Path Consistency / 129
Léon Planken, Mathijs de Weerdt, Neil Yorke-Smith The Joy of Forgetting: Faster Anytime Search via Restarting / 137
Silvia Richter, Jordan T. Thayer, Wheeler Ruml Handling Goal Utility Dependencies in a Satisfiability Framework / 145
Richard Anthony Russell, Sean Holden Constraint Propagation in Propositional Planning / 153
Andreas Sideris, Yannis Dimopoulos Computing Applicability Conditions for Plans with Loops / 161
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein A New Approach to Conformant Planning Using CNF* / 169
Son Thank To, Tran Cao Son, Enrico Pontelli Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms / 177
Richard Anthony Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto Influence-Based Policy Abstraction for Weakly-Coupled Dec-POMDPs / 185
Stefan John Witwicki, Edmund Howell Durfee Choosing Path Replanning Strategies for Unmanned Aircraft Systems / 193
Mariusz Wzorek, Jonas Kvarnström, Patrick Doherty Iterative Learning of Weighted Rule Sets for Greedy Search / 201
Yuehua Xu, Alan Fern, Sungwook Yoon Improving Determinization in Hindsight for On-line Probabilistic Planning / 209
Sungwook Yoon, Wheeler Ruml, J. Benton, Minh Do
Short Technical Papers When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters / 218
Emma Brunskill A PDDL+ Benchmark Problem: The Batch Chemical Plant / 222
Giuseppe Della Penna, Benedetto Intrigila, Daniele Magazzeni, Fabio Mercorio Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search / 226
Alfonso Gerevini, Alessandro Saetti, Ivan Serina Shopper: A System for Executing and Simulating Expressive Plans / 230
Robert P. Goldman, John Maraist The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem / 234
Malte Helmert, Hauke Lasinger Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF / 238
Alexander Koller, Joerg Hoffmann On Adversarial Search Spaces and Sampling-Based Planning / 242
Raghuram Ramanujan, Ashish Sabharwal, Bart Selman The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning / 246
Gabriele Röger, Malte Helmert Genome Rearrangement and Planning: Revisited / 250
Tansel Uras, Esra Erdem Combined Task and Motion Planning for Mobile Manipulation / 254
Jason Wolfe, Bhaskara Marthi, Stuart Russell
Challenge Papers G-Value Plateaus: A Challenge for Planning / 259
J. Benton, Kartik Talamadupula, Patrick Eyerich, Robert Mattmuller, Subbarao Kambhampati Construction Management Applications: Challenges in Developing Execution Control Plans / 263
Nilufer Onder, Amlan Mukherjee, Pei Tang
Invited Speaker Abstracts Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and Beyond / 268
Holger H. Hoos Robotic Agents for Disaster Response Robotics / 270
Daniele Nardi From Automated Verification to Automated Design / 271
Moshe Y. Vardi This page is copyrighted by AAAI. All rights reserved.
|
