W5. Constraint Satisfaction Techniques for Planning and
Scheduling Problems (COPLAS, Joint CP/ICAPS 2007 workshop)
The areas of AI planning and scheduling have seen important advances
thanks to the constraint satisfaction techniques. Now, many important
real-world problems require dealing with efficient constraint
techniques for planning, scheduling and resource allocation to
competing goal activities over time in the presence of complex
state-dependent constraints. Therefore, solutions to these problems
must integrate resource allocation and plan synthesis capabilities.
Basically, we need to manage complex problems where planning,
scheduling and constraint satisfaction must be interrelated, which
entail a great potential of application.
workshop therefore aims at providing a platform for meeting and
exchanging ideas and novel works in the field of AI planning,
scheduling, constraint satisfaction techniques, and many other common
areas that exist among them. In fact, most of the received works are
based on combined approaches of constraint satisfaction for planning,
scheduling and mixing planning and scheduling. The workshop will be
held in September, 2007 in Providence (USA) as a joint workshop for
both International Conference on Principles and Practice of Constraint
Programming (CP'2007) and International Conference on Automated
Planning & Scheduling (ICAPS'07).
the submissions were reviewed by two anonymous referees from the
program committee, who decided to accept 11 papers for oral
presentation in the workshop. The papers provide a good mix of
constraint satisfaction techniques for planning, scheduling, related
topics and their applications to real-world problems. We hope that the
ideas and approaches presented in the papers and presentations will
lead to a valuable discussion and will inspire future research and
developments in all the workshop participants.
- Miguel A. Salido
- Antonio Garrido
- Roman Bartak