In many planning applications it is not possible to wait a significant amount of time for having a plan to use; satisficing plans are required as soon as possible and, eventually, they will be refined. The goal of this track is to find a satisficing solution as soon as possible, given a very short amount of CPU time available. The domains and problems for this subtrack will be obtained from real-world applications of planning techniques. The aim of the agile track is to "simulate" the use of planning techniques in a real environment.
- Core features: STRIPS, action costs, negative preconditions, conditional effects
- Optional features: ADL, derived predicates
- Objective function: minimize CPU time
Core features are those that will appear in some (if not all) of the domains. So, in order for a planner to have chances to win this track of the competition, all the core features must be supported. However, there will exist some domains that do not require all the core features.
Optional features concern alternative but equivalent versions of each domain. These features will be used only in cases they facilitate domain modelling. When several alternative versions of a domain are supported by a planner, it is scored on the version on which it performs best.