Adaptive Constraint-Based Agents in Artificial Environments

[EVALUATION]   [The Logistics Domain]   [Enhancing the Problem Domain]

[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]

The Logistics Domain

(Related publication: [PUBLink])

There are lots of example domains in the planning area. For our evaluation, variations of the `Logistics Domain' are chosen because these are highly relevant to computer games. In many strategy and simulation games, resources such as gold, wood, stones or troops must be transported by different types of vehicles.

The Logistics Domain specifies the problem of transporting packages between locations (see the figure below). Transportation within a city can be done by a truck. But a truck cannot leave its city. Transportation between locations in different cities must thus be done by airplane. An airplane can only serve one specific location of a city (the airport). A truck and an airplane have actions to load a package, drive/fly to a specific location and unload a package. A problem specification includes a set of locations with information about a location's city and whether the location is an airport, the initial positions of all existing trucks, airports and packages, and the target positions for (not necessarily all) packages.


[EVALUATION]   [The Logistics Domain]   [Enhancing the Problem Domain]

For questions, comments or suggestions, please contact us.

Last update:
May 20, 2001 by Alexander Nareyek