International Planning Competition 2018
Temporal Tracks

This is the website for the temporal tracks of the IPC 2018. This is the 7th IPC containing classical tracks, since the specification of PDDL 2.1 in 2002. In addition to the temporal tracks, the IPC also has classical and probabilistic tracks. You can find information about them on ipc2018.bitbucket.io.

Mailing List: https://groups.google.com/d/forum/ipc2018-temporal

Preliminary Schedule

Event Date
Call for domains / expression of interest June 22, 2017
Domain submission deadline November, 2017
Demo problems provided November, 2017
Initial planner submission January 14, 2018
Feature stop (final planner submission) January 31, 2018
Planner Abstract submission deadline April, 2018
Contest run April - May, 2018
Results announced June, 2018
Result analysis deadline July, 2018

Tracks

There are two temporal tracks: 'satisficing' and 'on board'. The tracks differ in the amount of resources available. The evaluation criterion is plan quality within the time available. We encourage participants to enter their planner in both tracks.

Satisficing Planning Track

  • single CPU core
  • 8Gb memory limit
  • 30min time limit
  • Multiple plans can be returned, the one with the lowest cost is counted.
  • The score of a planner on a solved task is the ratio C/C* where C is the cost of the cheapest discovered plan and C* is the cost of a reference plan. The score on an unsolved task is 0. The score of a planner is the sum of its scores for all tasks.
  • If an invalid plan is returned, all tasks in the domain are counted as unsolved.
  • If that happens in more than one domain, the entry is disqualified.

On-Board Planning Track

  • designed as an analogue for on-board planning, for use where the resources available are much less than on a desktop computer; the time limit is chosen to mock up 30 minutes on low-power hardware
  • single CPU core
  • 1Gb memory limit
  • 2min time limit
  • Multiple plans can be returned, the one with the lowest cost is counted.
  • Scoring as in the satisficing track.
  • If an invalid plan is returned, all tasks in the domain are counted as unsolved.
  • If that happens in more than one domain, the entry is disqualified.

PDDL Fragment

IPC 2018 will use a subset of PDDL 2.2, as in previous years. Planners must support the subset of the language involving STRIPS, durative actions and action costs. Some domains will additionally require Timed Initial Literals, and numeric state variables. We will consider providing alternative domain definitions where practical.

Registration

Potential participants are requested to subscribe to the mailing list and send us an email expressing interest (ipc2018-temporal-organizers@googlegroups.com). Information on submitting the planner will be provided on the mailing list and the homepage later on.

As in previous editions, the competitors must submit the source code of their planners that will be run by the organizers on the actual competition domains/problems, unknown to the competitors until this time. This way no fine-tuning of the planners will be possible. All competitors must submit an abstract (max. 300 words) and a 4-page paper describing their planners. After the competition we encourage the participants to analyze the results of their planner and submit an extended version of their abstract. An important requirement for IPC 2018 competitors is to give the organizers the right to post their paper and the source code of their planners on the official IPC 2018 web site.

Calls for Participation and Domains

Please forward the following calls to all interested parties.

Organizers

  • Andrew Coles (King's College London)
  • Amanda Coles (King's College London)
  • Moises Martinez (King's College London)
  • Panagiotis Sidiropoulos (King's College London)

Contact us: ipc2018-temporal-organizers@googlegroups.com