Complete Proceedings

Table of Contents

---

Long Papers

September 12

• D. Vrakas, I. Vlahavas, Combining Progression and Regression in State-Space Heuristic Planning, pp. 1-12. [BibTeX] [pdf]
• S. Edelkamp, Planning with Pattern Databases, pp. 13-24. [BibTeX] [pdf]
• I. Razgon, R.I. Brafman, A Forward Search Planning Algorithm with a Goal Ordering Heuristic, pp. 25-36. [BibTeX] [pdf]
• J. Porteous, L. Sebastia, J. Hoffmann, On the Extraction, Ordering, and Usage of Landmarks in Planning, pp. 37-48. [BibTeX] [pdf]
• W. Hatzack, B. Nebel, The Operational Traffic Control Problem: Computational Complexity and Solutions, pp. 49-60. [BibTeX] [pdf]
• J-P. Watson, J. C. Beck, A. E. Howe, L. D. Whitley, Toward an Understanding of Local Search Cost in Job-Shop Scheduling, pp. 61-72. [BibTeX] [pdf]
• D. Camacho, D. Borrajo, J. M. Molina, R. Aler, Flexible Integration of Planning and Information Gathering, pp. 73-84. [BibTeX] [pdf]
• S. Thiebaux, M-O. Cordier, Supply restoration in power distribution systems -- a benchmark for planning under uncertainty, pp. 85-96. [BibTeX] [pdf]
• B. Engelhardt et al., The DATA-CHASER and Citizen Explorer Benchmark Problem Sets, pp. 97-108. [BibTeX] [pdf]

September 13

• M. B. Do, S. Kambhampati, Sapa: A Domain-Independent Heuristic Metric Temporal Planner, pp. 109-120. [BibTeX] [pdf]
• P. Haslum, H. Geffner, Heuristic Planning with Time and Resources, pp. 121-132. [BibTeX] [pdf]
• K. L. Myers et al., Integrating Planning and Scheduling through Adaptation of Resource Intensity Estimates, pp. 133-144. [BibTeX] [pdf]
• B. Clement, A. C. Barrett, G. R. Rabideau, E. H. Durfee, Using Abstraction in Planning and Scheduling, pp. 145-156. [BibTeX] [pdf]
• S. Biundo, B. Schattenberg, From Abstract Crisis to Concrete Relief. A Preliminary Report on Combining State Abstraction and HTN Planning, pp. 157-168. [BibTeX] [pdf]
• L. Castillo, J. Fdez-Olivares, A. González, On the Adequacy of Hierarchical Planning Characteristics for Real-World Problem Solving, pp. 169-180. [BibTeX] [pdf]
• A. J. Davenport, C. Gefflot, J. C. Beck, Slack-based Techniques for Robust Schedules, pp. 181-192. [BibTeX] [pdf]
• B. Drabble, N. Haq, Dynamic Schedule Management: Lessons from the Air Campaign Planning Domain, pp. 193-204. [BibTeX] [pdf]
• P. Laborie, Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results, pp. 205-216. [BibTeX] [pdf]
• R. Trinquart, M. Ghallab, An Extended Functional Representation in Temporal Planning: Towards Continuous Change, pp. 217-228. [BibTeX] [pdf]
• A. Oddi, Constraint-Based Strategies for the Disjunctive Temporal Problem: Some New Results, pp. 229-240. [BibTeX] [pdf]

September 14

• C. Castellini, E. Giunchiglia, A. Tacchella, Improvements to SAT-Based Conformant Planning, pp. 241-252. [BibTeX] [pdf]
• M. Pistore, R. Bettin, P. Traverso, Symbolic Techniques for Planning with Extended Goals in Non-Deterministic Domains, pp. 253-264. [BibTeX] [pdf]
• R. M. Jensen, M. M. Veloso, M. H. Bowling, OBDD-Based Optimistic and Strong Cyclic Adversarial Planning, pp. 265-276. [BibTeX] [pdf]
• C. Domshlak, Y. Dinitz, Multi-Agent Off-Line Coordination: Structure and Complexity, pp. 277-288. [BibTeX] [pdf]
• Z. Feng, E. A. Hansen, Approximate Planning for Factored POMDPs, pp. 289-300. [BibTeX] [pdf]
• W. Zhang, N. L. Zhang, Solving Informative Partially Observable Markov Decision Processes, pp. 301-312. [BibTeX] [pdf]
• Y. Dimopoulos, Improved Integer Programming Models and Heuristic Search for AI Planning, pp. 313-324. [BibTeX] [pdf]
• J. Hoffmann, B. Nebel, RIFO Revisited: Detecting Relaxed Irrelevance, pp. 325-336. [BibTeX] [pdf]
• M. Shanahan, Using Reactive Rules to Guide a Forward-Chaining Planner, pp. 337-348. [BibTeX] [pdf]
• M. Helmert, On the Complexity of Planning in Trasportation Domains, pp. 349-360. [BibTeX] [pdf]

Short Papers

• J. Argelich et al., Generating hard Satisfiable Scheduling Instances, pp. 361-366. [BibTeX] [pdf]
• M. Beetz, T. Belker, Learning Robot Action Plans for Controlling Continuous, Percept-driven Behavior, pp. 367-372. [BibTeX] [pdf]
• D. S. Bernstein, S. Zilberstein, Reinforcement Learning for Weakly-Coupled MDPs and an Application to Planetary Rover Control, pp. 373-378. [BibTeX] [pdf]
• P. Bertoli, A. Cimatti, M. Roveri, Conditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space, pp. 379-384. [BibTeX] [pdf]
• J. Farquhar, C. Harris, Beyond Plan Length: Heuristic Search Planning for Maximum Reward Problems, pp. 385-390. [BibTeX] [pdf]
• D. Furcy, S. Koenig, Combining Two Fast-Learning Real-Time Search Algorithms Yields Even Faster Learning, pp. 391-396. [BibTeX] [pdf]
• A. Garrido, E. Onaindía, F. Barber, Time-Optimal Planning in Temporal Problems, pp. 397-402. [BibTeX] [pdf]
• A. Meier, C. P. Gomes, E. Melis, Randomization and Restarts in Proof Planning, pp. 403-408. [BibTeX] [pdf]
• K. Subramani, Modeling Clairvoyance and Constraints in Real-time Schedule, pp. 409-416. [BibTeX] [pdf]
• I. Tsamadinos, M. E. Pollack, P. Ganchev, Flexible Dispach of Disjunctive Plans, pp. 417-422. [BibTeX] [pdf]
• C. H. Westerberg, J. Levine, Optimising Plans using Genetic Programming, pp. 423-428. [BibTeX] [pdf]

Demo Papers

• S. Chien et al., A Demostration of Robust Planning, Scheduling and Execution for the Techsat-21 Autonomous Sciencecraft Constellation, pp. 429-432. [BibTeX] [pdf]
• A. Gerevini, L. Schubert, DISCOPLAN: an Efficient On-line System for Computing Planning Domain Invariants, pp. 433-436. [BibTeX] [pdf]
• K. L. Myers, P. A. Jarvis, T. J. Lee, CODA: Coordinating Human Planners, pp. 437-440. [BibTeX] [pdf]
• R. Sherwood et al., An Integrated Planning and Scheduling Prototype for Automated Mars Rover Command Generation, pp. 441-444. [BibTeX] [pdf]
• R. M. Simpson et al., GIPO: An Integrated Graphical Tool to Support Knowledge Engineering in AI Planning, pp. 445-448. [BibTeX] [pdf]