Research Area of

Planning and Scheduling

Call for Papers

Work in the area of AI Planning and Scheduling ranges from formal and theoretical approaches to very practical and application-driven contributions and with that traditionally covers a variety of border regions of related fields.
For the ETAI, substantial papers are invited from the whole spectrum of AI Planning and Scheduling research. Topics of interest include, but are not restricted to:

classical AI planning
scheduling
planning and reasoning about actions
deductive planning
temporal planning
case-based planning
planning and complexity
plan recognition
planning and perception
planning and learning
robot planning
constraint reasoning in planning and scheduling
multi-agent planning
planning under uncertainty
decision-theoretic planning
resource management
knowledge acquisition and domain modeling for planning and scheduling
reactive planning
cognitive models and ontologies for planning and scheduling
planning and scheduling systems' user interfaces
applications

Articles submitted to the ETAI are reviewed in a 2-phase process. After submission, an article is open to public online discussion in the area's News Journal. This is intended to be similar to what occurs in the discussion periods at conferences, but it is persistent (questions and answers remain online), and it gives time for thought (both for those asking questions and for the authors who answer). Authors are expected to watch this discussion for possible feedback. After the discussion period of three months, and after the authors have had a chance to revise it, the article is reviewed for acceptance by the ETAI, using confidential peer review and journal level quality criteria. This second phase is expected to be rather short because of the preceding discussion and possible revision. During the entire reviewing process, the article is already published in a First Publication Archive, which compares to publication as a departmental tech report.

Technical details about submission and reviewing can be found here.

September 30, 1997