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