ICAPS 2007:
Providence,
Rhode Island,
USA
Mark S. Boddy, Maria Fox, Sylvie Thiébaux (Eds.):
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS 2007, Providence, Rhode Island, USA, September 22-26, 2007.
AAAI 2007, ISBN 978-1-57735-344-7 
- Yasmina Abdeddaïm, Eugene Asarin, Matthieu Gallien, Félix Ingrand, Charles Lesire, Mihaela Sighireanu:
Planning Robust Temporal Plans: A Comparison Between CBTP and TGA Approaches.
2-9
- Douglas Aberdeen, Olivier Buffet:
Concurrent Probabilistic Temporal Planning with Policy-Gradients.
10-17
- Raghav Aras, Alain Dutech, François Charpillet:
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps.
18-25
- Jorge A. Baier, Christian Fritz, Sheila A. McIlraith:
Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.
26-33
- J. Benton, Menkes van den Briel, Subbarao Kambhampati:
A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems.
34-41
- Olivier Buffet, Douglas Aberdeen:
FF + FPG: Guiding a Policy-Gradient Planner.
42-48
- Vadim Bulitko, Yngvi Björnsson, Mitja Lustrek, Jonathan Schaeffer, Sverrir Sigmundarson:
Dynamic Control in Path-Planning with Real-Time Heuristic Search.
49-56
- Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella:
An Innovative Product for Space Mission Planning: An A Posteriori Evaluation.
57-64
- Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chris Ventura:
Online Planning for Resource Production in Real-Time Strategy Games.
65-72
- Hubie Chen, Omer Giménez:
Act Local, Think Global: Width Notions for Tractable Planning.
73-80
- Andrew Coles, Maria Fox, Derek Long, Amanda Smith:
Planning with Respect to an Existing Schedule of Events.
81-88
- Andrew Coles, Maria Fox, Amanda Smith:
A New Local-Search Algorithm for Forward-Chaining Planning.
89-96
- Andrew Coles, Maria Fox, Amanda Smith:
Online Identification of Useful Macro-Actions for Planning.
97-104
- William Cushing, Daniel S. Weld, Subbarao Kambhampati, Mausam, Kartik Talamadupula:
Evaluating Temporal Planning Domains.
105-112
- Peng Dai, Eric A. Hansen:
Prioritizing Bellman Backups without a Priority Queue.
113-119
- Anders Dohn, Esben Kolind, Jens Clausen:
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints.
120-127
- Stefan Edelkamp, Shahid Jabbar, Blai Bonet:
External Memory Value Iteration.
128-135
- Jeremy Frank, Paul H. Morris:
Bounding the Resource Availability of Activities with Linear Resource Impact.
136-143
- Christian Fritz, Sheila A. McIlraith:
Monitoring Plan Optimality During Execution.
144-151
- Omer Giménez, Anders Jonsson:
On the Hardness of Planning Problems with Simple Causal Graphs.
152-159
- Mark E. Giuliano, Reiko Rager, Nazma Ferdous:
Towards a Heuristic for Scheduling the James Webb Space Telescope.
160-167
- Charles Gretton:
Gradient-Based Relational Reinforcement Learning of Temporally Extended Policies.
168-175
- Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Flexible Abstraction Heuristics for Optimal Sequential Planning.
176-183
- David W. Hildum, Stephen F. Smith:
Constructing Conflict-Free Schedules in Space and Time.
184-191
- Yuxiao Hu:
Temporally-Expressive Planning as Constraint Satisfaction Problems.
192-199
- Michael Katz, Carmel Domshlak:
Structural Patterns of Tractable Sequentially-Optimal Planning.
200-207
- Hoong Chuin Lau, Thomas Ou, Fei Xiao:
Robust Local Search and Its Application to Generating Robust Schedules.
208-215
- Benjamin Lussier, Matthieu Gallien, Jérémie Guiochet, Félix Ingrand, Marc-Olivier Killijian, David Powell:
Planning with Diversified Models for Fault-Tolerant Robots.
216-223
- Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns, Kimberly Ferguson, Chang Wang:
Learning to Plan Using Harmonic Analysis of Diffusion Models.
224-231
- Bhaskara Marthi, Stuart J. Russell, Jason Wolfe:
Angelic Semantics for High-Level Actions.
232-239
- Vitaly Mirkis, Carmel Domshlak:
Cost-Sharing Approximations for h+.
240-247
- Armin Müller, Alexandra Kirsch, Michael Beetz:
Transformational Planning for Everyday Activity.
248-255
- Muhammad Abdul Hakim Newton, John Levine, Maria Fox, Derek Long:
Learning Macro-Actions for Arbitrary Planners and Domains.
256-263
- Héctor Palacios, Hector Geffner:
From Conformant into Classical Planning: Efficient Translations that May Be Complete Too.
264-271
- Ioannis Refanidis:
Managing Personal Tasks with Time Constraints and Preferences.
272-279
- Jussi Rintanen:
Complexity of Concurrent Temporal Planning.
280-287
- Scott Sanner, Craig Boutilier:
Approximate Solution Techniques for Factored First-Order MDPs.
288-295
- Julie A. Shah, John Stedl, Brian C. Williams, Paul Robertson:
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans.
296-303
- Trey Smith, David R. Thompson, David Wettergreen:
Generating Exponentially Smaller POMDP Models Using Conditionally Irrelevant Variable Abstraction.
304-311
- Matthew J. Streeter, Stephen F. Smith:
Using Decision Procedures Efficiently for Optimization.
312-319
- Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling.
320-327
- Adriaan ter Mors, Jonne Zutt, Cees Witteveen:
Context-Aware Logistic Routing and Scheduling.
328-335
- Tiago Stegun Vaquero, Victor Romero, Flavio Tonidandel, José Reinaldo Silva:
itSIMPLE 2.0: An Integrated Tool for Designing Planning Domains.
336-343
- Jia-Hong Wu, Robert Givan:
Discovering Relational Domain Features for Probabilistic Planning.
344-351
- Sung Wook Yoon, Alan Fern, Robert Givan:
FF-Replan: A Baseline for Probabilistic Planning.
352-
Last update Mon May 21 02:21:11 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
