International Planning Competition 2018
Classical Tracks

This is the website for the classical (sequential, deterministic) track of the IPC 2018. This is the 9th IPC containing classical tracks making it the oldest part of IPC. In addition to the classical tracks, the IPC also has temporal and probabilistic tracks. You can find information about them on ipc2018.bitbucket.io.

Mailing List: https://groups.google.com/forum/#!forum/ipc2018

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 five classical tracks: optimal, bounded-cost, satisficing, agile, and multi-core. The tracks differ in the amount of resources available and in the scoring method. The tracks focus on coverage (optimal and cost-bounded), plan quality (satisficing, multi-core), and solving time (agile). We encourage participants to enter their planner in all tracks.

Optimal Track

  • single CPU core
  • 8Gb memory limit
  • 30min time limit
  • Plans must be optimal
  • The score of a planner is the number of solved tasks
  • If a suboptimal or 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.

Bounded-Cost Track

  • single CPU core
  • 8Gb memory limit
  • 30min time limit
  • Plans must have a cost not greater than a given bound
  • The score of a planner is the number of solved tasks
  • If an invalid plan or a plan exceeding the cost bound is returned, all tasks in the domain are counted as unsolved.
  • If that happens in more than one domain, the entry is disqualified.

Satisficing 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.

Agile Track

  • single CPU core
  • 8Gb memory limit
  • 5min time limit
  • The cost of the discovered plan is ignored, only the CPU time to discover a plan is counted.
  • The score of a planner on a solved task is 1 if the task was solved within 1 second and 0 if the task was not solved within the resource limits. If the task was solved in T seconds (1 ≤ T ≤ 300) then its score is 1 - log(T)/log(300). 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.

Multi-Core Track

  • 32 CPU cores (four Octa-Core Intel Xeon E5-4640 CPUs)
  • 1TB memory limit
  • 10min 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.

PDDL Fragment

IPC 2018 will use a subset of PDDL 3.1, as done in IPC 2011 and IPC 2014. As in previous classical tracks planners must support the subset of the language involving STRIPS, action costs, negative preconditions, and conditional effects (possibly in combination with forall, as done in IPC 2014). We will consider providing alternative domain definitions using more advanced ADL features for planners supporting them.

Registration

Potential participants are requested to subscribe to the mailing list and send us an email expressing interest (ipc-2018-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

Contact us: ipc-2018-organizers@googlegroups.com

Note: Tomáš organizes the multi-core track and will take part in the other classical tracks. To avoid a conflict of interest, Álvaro and Florian will handle everything concerning domains and only make them available for the multi-core track after the planner submission deadline.