Contents Papers

advertisement
Contents
Preface / ix
Jussi Rintanen, Bernhard Nebel, Chris Beck, and Eric Hansen
Organizing Committee / xi
Program Committee / xiii
Papers
The Compression Power of Symbolic Pattern Databases / 2
Marcel Ball, Robert C. Holte
A Probabilistic Planner for the Combat Power Management Problem / 12
Abder Rezak Benaskeur, Froduald Kabanza, Eric Beaudry, Mathieu Beaudoin
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression / 20
Abdeslam Boularias, Brahim Chaib-draa
From One to Many: Planning for Loosely Coupled Multi-Agent Systems / 28
Ronen I. Brafman, Carmel Domshlak
Causal Graphs and Structurally Restricted Planning / 36
Hubie Chen, Omer Giménez
Additive-Disjunctive Heuristics for Optimal Planning / 44
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
A Hybrid Relaxed Planning Graph—LP Heuristic for Numeric Planning Domains / 52
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
Learning Relational Decision Trees for Guiding Heuristic Planning / 60
Tomás de la Rosa, Sergio Jiménez, Daniel Borrajo
Planning for Modular Printers: Beyond Productivity / 68
Minh B. Do, Wheeler Ruml, Rong Zhou
Scheduling Meetings at Trade Events with Complex Preferences / 76
Andreas Ernst, Gaurav Singh, René Weiskircher
Generating Robust Schedules Subject to Resource and Duration Uncertainties / 83
Na Fu, Hoong Chuin Lau, Fei Xiao
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting / 91
Christopher W. Geib, John Maraist, Robert P. Goldman
In Search of the Tractability Boundary of Planning Problems / 99
Omer Giménez, Anders Jonsson
v
Multi-Objective Evolutionary Algorithms for Scheduling the James Webb Space Telescope / 107
Mark E. Giuliano, Mark D. Johnston
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times / 116
Miguel A. González, Camino R. Vela, Ramiro Varela
A New Local Search for the Job Shop Problem with Uncertain Durations / 124
Inés González-Rodríguez, Camino R. Vela, Jorge Puente, Ramiro Varela
A New Approach to Tractable Planning / 132
Patrik Haslum
Unifying the Causal Graph and Additive Heuristics / 140
Malte Helmert, Héctor Geffner
Rank-Dependent Probability Weighting in Sequential Decision Problems under Uncertainty / 148
Gildas Jeantet, Olivier Spanjaard
Stochastic Planning with First Order Decision Diagrams / 156
Saket Joshi, Roni Khardon
Planning 3D Task Demonstrations of a Teleoperated Space Robot Arm / 164
Froduald Kabanza, Khaled Belghith, Philipe Bellefeuille, Benjamin Auder, Leo Hartman
Optimal Additive Composition of Abstraction-based Admissible Heuristics / 174
Michael Katz, Carmel Domshlak
Structural Patterns Heuristics via Fork Decomposition / 182
Michael Katz, Carmel Domshlak
Using Classical Planners to Solve Nondeterministic Planning Problems / 190
Ugur Kuter, Dana Nau, Elnatan Reisner, Robert P. Goldman
A Temporal Logic-Based Planning and Execution Monitoring System / 198
Jonas Kvarnström, Fredrik Heintz, Patrick Doherty
Generative Planning for Hybrid Systems Based on Flow Tubes / 206
Hui X. Li, Brian C. Williams
Criticality Metrics for Distributed Plan and Schedule Management / 214
Rajiv T. Maheswaran, Pedro Szekely
Angelic Hierarchical Planning: Optimal and Online Algorithms / 222
Bhaskara Marthi, Stuart Russell, Jason Wolfe
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem / 232
Blaine Nelson, T. K. Satish Kumar
Bounded-Parameter Partially Observable Markov Decision Processes / 240
Yaodong Ni, Zhi-Qiang Liu
Learning Heuristic Functions through Approximate Linear Programming / 248
Marek Petrik, Shlomo Zilberstein
P3C: A New Algorithm for the Simple Temporal Problem / 256
Léon Planken, Mathijs de Weerdt, Roman van der Krogt
vi
Filtering for a Continuous Multi-Resources cumulative Constraint with
Resource Consumption and Production / 264
Emmanuel Poder, Nicolas Beldiceanu
Using Constraint Networks on Timelines to Model and
Solve Planning and Scheduling Problems / 272
Cédric Pralet, Gérard Verfaillie
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions / 280
Katrina Ray, Matthew L. Ginsberg
What Makes Planners Predictable? / 288
Mark Roberts, Adele E. Howe, Brandon Wilson, Marie desJardins
A Compact and Efficient SAT Encoding for Planning / 296
Nathan Robinson, Charles Gretton, Duc-Nghia Pham, Abdul Sattar
Realizing Multiple Autonomous Agents through Scheduling of Shared Devices / 304
Sebastian Sardina, Giuseppe De Giacomo
Effective Information Value Calculation for
Interruption Management in Multi-Agent Scheduling / 313
David Sarne, Barbara J. Grosz, Peter Owotoki
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental
Compilation / 322
Julie A. Shah, Brian C. Williams
Efficient ADD Operations for Point-Based Algorithms / 330
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solomon E. Shimony
Multiagent Planning Under Uncertainty with Stochastic Communication Delays / 338
Matthijs T. J. Spaan, Frans A. Oliehoek, Nikos Vlassis
HiPPo: Hierarchical POMDPs for Planning Information
Processing and Sensing Actions on a Robot / 346
Mohan Sridharan, Jeremy Wyatt, Richard Dearden
Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search / 355
Jordan T. Thayer, Wheeler Ruml
Linear Relaxation Techniques for Task Management in Uncertain Settings / 363
Pradeep Varakantham, Stephen F. Smith
Decentralized Online Scheduling of Combination-Appointments in Hospitals / 372
Ivan Vermeulen, Sander Bohte, Sylvia Elkhuizen, Piet Bakker, Han La Poutré
Fast and Memory-Efficient Multi-Agent Pathfinding / 380
Ko-Hsin Cindy Wang, Adi Botea
Useless Actions Are Useful / 388
Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski
Stochastic Enforced Hill-Climbing / 396
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
vii
An Online Learning Method for Improving Over-Subscription Planning / 404
Sungwook Yoon, J. Benton, Subbarao Kambhampati
Fast Planning for Dynamic Preferences / 412
Brian D. Ziebart, Anind K. Dey, J. Andrew Bagnell
Index / 420
viii
Download