ICAPS 2006:
Cumbria,
UK
Derek Long, Stephen F. Smith, Daniel Borrajo, Lee McCluskey (Eds.):
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10, 2006.
AAAI 2006, ISBN 978-1-57735-270-9 
Applications of Planning and Scheduling
Complexity of Planning and Scheduling
- Blai Bonet:
Bounded Branching and Modalities in Non-Deterministic Planning.
42-51
- Malte Helmert:
New Complexity Results for Classical Planning Benchmarks.
52-62
Constraint Reasoning for Planning and Scheduling
- Luis A. Castillo, Juan Fernández-Olivares, Óscar García-Pérez, Francisco Palao:
Efficiently Handling Temporal Knowledge in an HTN Planner.
63-72
- Jeremy Frank, James Crawford, Lina Khatib, Ronen I. Brafman:
Tractable Optimal Competitive Scheduling.
73-82
- T. K. Satish Kumar, Stuart J. Russell:
On Some Tractable Cases of Logical Filtering.
83-92
- Michael D. Moffitt, Martha E. Pollack:
Optimal Rectangle Packing: A Meta-CSP Approach.
93-102
- Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma:
Lemma Reusing for SAT based Planning and Scheduling.
103-113
Decision-Theoretic Planning
Learning in Planning and Scheduling
Mixed-Initiative Planning and Scheduling
Plan and Schedule Execution,
Monitoring,
and Repair
Probabilistic Planning
Search for Planning and Scheduling
- J. Christopher Beck:
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling.
274-283
- Jörg Hoffmann, Carla P. Gomes, Bart Selman:
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
284-293
- Jörg Hoffmann, Ashish Sabharwal, Carmel Domshlak:
Friends or Foes? An AI Planning Perspective on Abstraction and Search.
294-303
- Rune M. Jensen, Eric A. Hansen, Simon Richards, Rong Zhou:
Memory-Efficient Symbolic Heuristic Search.
304-313
- Mark F. Rogers, Adele E. Howe, Darrell Whitley:
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems.
314-323
- Matthew J. Streeter, Stephen F. Smith:
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling.
324-333
Short Papers
- Salwani Abdullah, Edmund K. Burke:
A Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling.
334-337
- Rama Akkiraju, Biplav Srivastava, Anca-Andreea Ivan, Richard Goodwin, Tanveer Fathima Syeda-Mahmood:
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition.
338-341
- Jorge A. Baier, Sheila A. McIlraith:
Planning with Temporally Extended Goals Using Heuristic Search.
342-345
- Fabio Barbon, Paolo Traverso, Marco Pistore, Michele Trainotti:
Run-Time Monitoring of the Execution of Plans for Web Service Composition.
346-349
- Roman Barták, Ondrej Cepek:
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach.
350-353
- Piergiorgio Bertoli, Alessandro Cimatti, Marco Pistore:
Towards Strong Cyclic Planning under Partial Observability.
354-357
- Piergiorgio Bertoli, Marco Pistore, Paolo Traverso:
Automated Web Service Composition by On-the-Fly Belief Space Search.
358-361
- Daniel Burfoot, Joelle Pineau, Gregory Dudek:
RRT-Plan: A Randomized Algorithm for STRIPS Planning.
362-365
- Canan Özgen, Aysenur Birtürk:
Motion Economy and Planning.
366-369
- Minh Binh Do, Wheeler Ruml:
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing.
370-373
- Stefan Edelkamp:
On the Compilation of Plan Constraints and Preferences.
374-377
- Fernando Fernández, Manuela M. Veloso:
Reusing and Building a Policy Library.
378-381
- Robert P. Goldman:
Durative Planning in HTNs.
382-385
- Andreas Hofmann, Brian Williams:
Robust Execution of Temporally Flexible Plans for Bipedal Walking Devices.
386-389
- Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila:
Learning to Do HTN Planning.
390-393
- Guillaume Infantes, Félix Ingrand, Malik Ghallab:
Learning Behaviors Models for Robot Execution Control.
394-397
- Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak Khemani:
Planning for PDDL3 - An OCSP Based Approach.
398-401
- Sven Koenig, Maxim Likhachev:
A New Principle for Incremental Heuristic Search: Theoretical Results.
402-405
- Laurence A. Kramer, Stephen F. Smith:
Resource Contention Metrics for Oversubscribed Scheduling Problems.
406-409
- Yaxin Liu, Sven Koenig:
Probabilistic Planning with Nonlinear Utility Functions.
410-413
- Mausam, Daniel S. Weld:
Challenges for Temporal Planning with Uncertain Durations.
414-417
- Sanjeev Naguleswaran, Langford B. White, I. Fuss:
Automated Planning Using Quantum Computation.
418-421
- Bernd Schattenberg, Steffen Balzer, Susanne Biundo:
Knowledge-based Middleware as an Architecture for Planning and Scheduling Systems.
422-425
- Malcolm J. A. Strens:
Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling.
426-429
- Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules.
430-433
- Tiago Stegun Vaquero, Flavio Tonidandel, Leliane Nunes de Barros, José Reinaldo Silva:
On the Use of UML.P for Modeling a Real Application as a Planning Problem.
434-437
- Mariusz Wzorek, Patrick Doherty:
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle.
438-441
- Zhao Xing, Yixin Chen, Weixiong Zhang:
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning.
442-446
Last update Mon Feb 13 04:18:40 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
