[FrontPage] [TitleIndex] [WordIndex

1. Competition domains

1.1. Barman

In this domain there is a robot barman that manipulates drink dispensers, glasses and a shaker. The goal is to find a plan of the robot's actions that serves a desired set of drinks.

1.2. Blocksworld

The 4-operator version of the classic Blocksworld. This domain consists of a set of blocks, a table and a robot hand. The blocks can be on top of other blocks or on the table; a block that has nothing on it is clear; and the robot hand can hold one block or be empty. The goal is to find a plan to move from one configuration of blocks to another.

1.3. Depots

This domain is a combination of a transportation domain and the Blocksworld domain. The transportation element of the task is to move crates from one depot to another using trucks. The blocksworld element arises due to the need to stack and unstack crates, with the amount of space on the 'table' being limited by the number of pallets at each location. Hoists server the function of the robot arm, doubling as the mechanism by which crates are loaded/unloaded onto/from trucks. The goal is to find a plan where crates are stacked appropriately at their destinations.

1.4. Gripper

In this domain there are a number of robots, with two gripper hands, and a set of rooms containing balls. The goal is to find a plan to transport balls from a given room to another.

1.5. Rover

A collection of rovers with different sets of equipment navigate a planet surface. The goal is to have performed a number of science gathering operations - soil/rock sample analyses, and taking pictures of different objectives - and to have communicated the results of these back to a lander.

1.6. Parking

This domain involves parking cars on a street with N curb locations, and where cars can be double-parked but not triple-parked. The goal is to find a plan to move from one configuration of parked cars to another configuration, by driving cars from one curb location to another. The problems in the competition contain 2*(N-1) cars, which allows one free curb space and guarantees solvability.

1.7. Satellite

In this domain there is a set of satellites equipped with different instruments, which can operate in different modes. The goal is to acquire desired images, dividing the observation tasks between the satellites, based on the capabilities of their instruments.

1.8. Spanner

A worker is in a shed, containing a number of spanners, and at a gate some distance away there are a number of nuts that must be tightened. Crucially, once the worker has left the shed they cannot return. Also, the spanners are fragile, so once used to tighten a nut they break, and then cannot be used to tighten another. The goal is planning to pick-up the spanners and tighten the nuts. This is an interesting domain for learning, as it has a directed search space, and is challenging for planners employing an 'ignore delete lists' relaxation.

1.9. TPP

This domain is a simplification of the Traveling Purchase Problem, a generalization of the Traveling Salesman Problem. The goal is to select a subset of markets from which a given set of goods can be obtained, whilst optimizing the routing.


2. Examples of competition domains

These domains follow the competition format. Please validate your learner and planner programs in these domains before submitting them.


3. Call for competition domains

If you would like to design a domain for the competition please contact Sergio Jiménez Celorrio with the following information:

While not necessary, it is also desirable for the domains to be related to real applications. Only one entry per participating team will be allowed. The organizers will consider all submissions and select the highest quality subset to be included. The organizers are aware that participants that submit a domain that is used have some advantage with respect to performance on that domain. We view this as a good incentive for teams to submit high quality proposals.


2013-10-05 02:21