This is the website for the numeric tracks of the IPC 2026
Please forward the following calls to all interested parties.
| Event | Date |
|---|---|
| Domain submission deadline | March 31, 2026 |
| Planner submission deadline | May 15, 2026 |
| Planner abstract submission deadline | |
| Contest run | May - June, 2026 |
| Results announced | June / July 2026 |
Similarly to the Numeric IPC 2023 (https://ipc2023-numeric.github.io), we will use a subset of PDDL 2.1, considering two fragments:
Preconditions and goals are arbitrary propositional formulas. That is, they include quantifiers, negative preconditions, disjunctive preconditions and any number of numeric predicates. Terms can either be literals as in classical planning, or numeric terms of the form f(X){ >=,>, =} 0 where f(X) is a linear expressions. Each domain of the competition will be either a SNP or a LNP (LNP is more expressive than SNP).
Moreover, actions will have an associated state-independent non-negative cost, so optimal plans are those where the sum of action costs is minimal.
We require that a planner is registered through a team. For this, you need to send an email with a subject containing “[Registration for Numeric Tracks]” to either f.percassi@hud.ac.uk or luigibonassi@robots.ox.ac.uk, and include the other address in CC. The email must contain:
names of participants, email contacts, track (agile/satisficing/optimal), and at least one GitHub account. Based on that, we will create a private repository under the ipc2026-numeric organisation and grant all participants write access. Participants will be able to upload their planners and commit changes to the repository as needed until the planner submission deadline.
Competitors must submit the source code of their planners. The organisers will run the planners on the competition domains and problems, which will remain unknown to competitors until the evaluation phase. This prevents any fine-tuning of planners to the final benchmark set. Planner repositories will be hosted by the organisers on GitHub under the ipc2026-numeric organisation. These repositories will remain private until the end of the competition, after which they will be made public. Once the competition is concluded, we plan to make all planners, domains, and related data available from a single location.
——– Submission of multiple planner configurations ——– You are allowed to submit multiple configurations of your planner. However, to keep things balanced and avoid giving an advantage based on the number of configurations, we decided to limit the number of planner configurations to 2 per track, independently of the supported fragment of numeric planning. We remind you that LNP configurations will be run on the entire benchmark set, while SNP configurations will be evaluated only on SNP domains.
In addition, you may submit multiple planner configurations only if they differ in a substantively meaningful way. For example, the same overall search method / heuristic with minor parameter tuning cannot be used for separate configurations.
We are aware that the distinction between a genuine variant and a minor modification may be blurred. If you are unsure about what may count as a substantial difference, feel free to send us an email with a brief description of what you intend to submit, and we will be happy to advise.
——– Execution environment ——– We require participants to provide self-contained code, with scripts for installation and running. Each run script should specify which track the planner should be included in and the supported numeric fragment. An example of how to structure your repository and which scripts to include can be found here: https://github.com/ipc2026-numeric/baseline. We decided to adopt Apptainer to run all the planners. Therefore, we kindly ask you to include an Apptainer recipe for compiling / installing your planner. Then, your run scripts should simply call the executable produced by building the recipe. The planner must be executable through a script that takes exactly three input parameters, in the following order: the domain file, the problem file, and the name of the file where the last solution found will be saved. The output plan must follow the standard IPC solution format, consisting of a list of actions separated by a new line.
After the planner submission deadline, we will test all planners on the final benchmark. If we find any bugs, such as failures or crashes, we will give the participants a chance to fix them. We will provide all the necessary information to debug the issue (such as the logs produced by the planner and the PDDL files that we believe caused the issue) and allow the team to push a fix for the bug within a certain time frame. We will verify that the changes are strictly limited to resolving the bug, with no additional features introduced or parameters modified.