5th European Conference on Planning

September   8 - 10,   1999

Durham, United Kingdom


The European Conferences on Planning (ECP) are a major forum for the presentation of new research in AI Planning and Scheduling. They developed from a series of European workshops and became successfully established as international meetings, held in alternate years with the AIPS conferences.

Prior to the conference, a general meeting of PLANET, the European Network of Excellence in AI Planning, will be held on September 7. This meeting is open to all attendees of ECP.

ECP-99 invites original papers from the whole spectrum of AI Planning and Scheduling research. Topics of interest include, but are not restricted to:

  • classical 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
  • multi-agent planning
  • probabilistic planning

  • planning under uncertainty
  • decision-theoretic planning
  • knowledge acquisition and domain modeling for planning and scheduling
  • reactive planning
  • applications


Papers should have a front page containing the title, the names and full addresses - including e-mail addresses and fax numbers - of all authors, key words, and a 100-200 word abstract. Papers should be written in English, in 12pt type and must not exceed 12 pages, excluding front page and references. Authors are encouraged to use LaTeX. The proceedings of ECP-99 will be published by Springer-Verlag in the LNAI series. The Springer LaTeX style file (llncs.cls) is available from the authors instruction page and may already be used for submission.
The primary means of submission will be electronic, in PostScript format. Papers should be compressed using compress or gzip, then encoded using uuencode, and e-mailed to the programme chair. If electronic submission is not possible, five hard copies should be sent to the postal address given below. All papers must reach the programme chair by May 5, 1999. Notification of acceptance or rejection will be mailed to the first or designated author on or before July 15, 1999. Accepted papers must be presented at the conference, in English by one of the authors.


Authors Instructions

The proceedings of ECP-99 will be published by Springer-Verlag in the LNAI series. Each paper is allowed 13 pages in the proceedings. Authors are encouraged to use LaTeX and the Springer style file (llncs.cls), which is available from the authors instruction page. Final versions of papers must reach the programme chair no later than August 12, 1999. Electronic sending of postscript files is most appreciated. The Pre-prints of the proceedings will be available at the conference.
For each poster a 2-page abstract will be included in a separate poster volume distributed at the conference. For these abstracts, the above formatting and mailing instructions apply also.


Programme Committee

  • Rachid Alami, LAAS-CNRS Toulouse (France)
  • Ruth Aylett, University of Salford (UK)
  • Michael Beetz, University of Bonn (Germany)
  • Susanne Biundo, University of Ulm (Germany)(programme chair)
  • Jim Blythe, Carnegie Mellon University (USA)
  • Craig Boutilier, University of British Columbia (Canada)
  • Amedeo Cesta, IP-CNR Rome (Italy)
  • Berthe Choueiry, Stanford University (USA)
  • Stephen Cranefield, University of Otago (New Zealand)
  • Brian Drabble, University of Oregon (USA),
  • Mark Drummond, Electric Time Software (USA)
  • George Ferguson, University of Rochester (USA)
  • Maria Fox, University of Durham (UK) (local arrangements chair)
  • Malik Ghallab, LAAS-CNRS Toulouse (France)
  • Robert Goldman, Honeywell SRC (USA)
  • Carla Gomes, Cornell University (USA)
  • Joachim Hertzberg, GMD St. Augustin (Germany)
  • Toru Ishida, Kyoto University (Japan)
  • Peter Jonsson, University of Linköping (Sweden)
  • Subbarao Kambhampati, Arizona State University (USA)
  • Jana Koehler, University of Freiburg (Germany)
  • Richard Korf, University of California at L.A. (USA)
  • Claude Le Pape, Bouygues (France)
  • Witold Lukaszewicz, Warsaw University (Poland)

  • Alfredo Milani, University of Perugia (Italy)
  • Dana Nau, University of Maryland (USA)
  • Anna Perini, IRST Trento (Italy)
  • Martha Pollack, University of Pittsburgh (USA)
  • Louise Pryor, Harlequin Ltd. (UK)
  • Barry Richards, Imperial College (UK)
  • Wolfgang Slany, Tech. University of Vienna (Austria)
  • Jon Spragg, BT Labs (UK)
  • Sam Steel, University of Essex (UK)
  • Patrick Taillibert, Dassault Electronique (France)
  • Sylvie Thiébaux, CSIRO (Australia)
  • Paolo Traverso, IRST Trento (Italy).


                    Programme Chair
                    Susanne Biundo
                    Department of Artificial Intelligence
                    University of Ulm
                    James-Franck-Ring, Geb. O27/449
                    D-89081 Ulm, Germany
                    e-mail: biundo@informatik.uni-ulm.de

        Local Arrangements Chair
        Maria Fox
        Department of Computer Science
        University of Durham
        South Road
        Durham DH1 3LE, UK
        e-mail: Maria.Fox@durham.ac.uk



General Meeting of PLANET

Prior to the conference, a general meeting of PLANET, the European Network of Excellence in AI Planning, will be held on September 7. PLANET is a coordinating organisation for European research, development, and technology transfer in the field of Artificial Intelligence Planning and Scheduling. Currently, PLANET has 37 nodes from 8 European countries. They represent leading universities, research centers, and industrial companies.
The meeting is devoted to general presentations of the network's activities and to focused workshops of the network's Technical Coordination Units.
The meeting will be open to all participants of ECP.


Accepted Papers

B. Nebel
What is the Expressive Power of Disjunctive Preconditions?

V. Liatsos, B. Richards
Scalability in Planning

L.D. Pyeatt, A.E. Howe
A Parallel Algorithm for POMDP Solution

P. Haslum, P. Jonsson
Some Results on the Complexity of Planning with Incomplete Information

B. Srivastava, S. Kambhampati
Scaling up Planning by Teasing out Resource Scheduling

A.E. Howe, E. Dahlman, C. Hansen, M. Scheetz, A. von Mayrhauser
Exploiting Competitive Planner Performance

G. De Giacomo, M.Y. Vardi
Automata-Theoretic Approach to Planning for Temporally Extended Goals

J. Rintanen, H. Jungholt
Numeric State Variables in Constraint-based Planning

I. Refanidis, I. Vlahavas
GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables

S. Edelkamp, M. Helmert
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length

R. Barruffi, E. Lamma, P. Mello, M. Milano
Least Commitment on Variable Binding in Presence of Incomplete Knowledge

A. Bockmayr, Y. Dimopoulos
Integer Programs and Valid Inequalities for Planning Problems

U. Scholz
Action Constraints for Planning

A.L. Blum, J.C. Langford
Probabilistic Planning in the Graphplan Framework

Y. Wang, Q. Yang, Z. Zhang
Multi-Agent Real-Time Scheduling for Call Center Automation

A. Cimatti, M. Roveri
Conformant Planning via Model Checking

A.D. Mali
Plan Merging & Plan Reuse as Satisfiability

A.D. Mali
Hierarchical Task Network Planning as Satisfiability

S. Koenig, Y. Liu
Sensor Planning with Non-Linear Utility Functions

M. Daniele, P. Traverso, M.Y. Vardi
Strong Cyclic Planning Revisited

B. Bonet, H. Geffner
Planning as Heuristic Search: New Results

E. Parker, S. Kambhampati
Making Graphplan Goal-Directed: (A Lifted Goal-directed forward-searching Graphplan)

B. Drabble
Task Decomposition Support to Reactive Scheduling

O. Despouys, F.F. Ingrand
Propice-Plan: Toward a Unified Framework for Planning and Execution

A. Armando, C. Castellini, E. Giunchiglia
SAT-Based Procedures for Temporal Reasoning

S. Cresswell, A. Smaill, J. Richardson
Deductive Synthesis of Recursive Plans in Linear Logic

A. Cesta, A. Oddi, S.F. Smith
Greedy Algorithms for the Multi-Capacitated Metric Scheduling Problem


Last update: August 12, 1999
Administrated by Susanne Biundo, University of Ulm, Germany.