ECP-01 encourages submissions on any topic in the planning and scheduling
domain. The papers, which should be original, innovative and of high
technical quality, may concern, not exhaustively, any of the following
topics:
- domain-independent planning
- planning and complexity
- planning and scheduling under uncertainty
- scheduling algorithms
- decision-theoretic planning and scheduling
- planning and reasoning about actions
- plan recognition
- planning and perception
- planning and learning
- knowledge engineering techniques for planning and scheduling
- planning and scheduling with complex domain models
- deductive planning
- model-theoretic approaches to planning
- constraint reasoning for planning and scheduling
- distributed and multi-agent planning and scheduling
- planning and execution
- reactive planning
- dynamic scheduling
- scalability in planning and scheduling
- mixed-initiative problem solving
- case-based planning
- robot planning
- applications of planning and scheduling
- planning, scheduling and the new information technology
|
