Description:The idea for this domain came up from the Miconic domain of IPC2, however the domain has been designed from scratch. The scenario is the following: There is a building with N + 1 floors, numbered from 0 to N. The building can be separated in blocks of size M + 1, where M divides N. Adjacent blocks have a common floor. For example, suppose N = 12 and M = 4, then we have 13 floors in total (ranging from 0 to 12), which form 3 blocks of 5 floors each, being 0 to 4, 4 to 8, and 8 to 12. The building has K fast (accelerating) elevators that stop only in floors that are multiples of M / 2 (so M has to be an even number). Each fast elevator has a capacity of X persons. Furthermore, within each block, there are L slow elevators, that stop at every floor of the block. Each slow elevator has a capacity of Y persons (usually Y < X). There are costs associated with each elevator starting/stopping and moving. In particular, fast (accelerating) elevators have negligible cost of starting/stopping but have significant cost while moving. On the other hand, slow (constant speed) elevators have significant cost when starting/stopping and negligible cost while moving. Traveling times between floors are given for any type of elevator, taking into account the constant speed of the slow elevators and the constant acceleration of the fast elevators. There are several passengers, for which their current location (i.e., the floor they are on) and their destination are given. The planning problem is to find a plan that moves the passengers to their destinations while it maximizes some criterion.
Categories:
Sequential
Multi-Core
Optimal
Satisficing
Temporal
Language:PDDL
@misc{planlib:prob002,
title = {{PLANLib} Problem 002: Elevator},
author = {Unknown},
editor = {Espasa, Joan},
booktitle = {{PLANLib}: A library of Planning Problems},
howpublished = {\url{https://github.com/potassco/pddl-instances/tree/master/ipc-2011/domains/elevator-sequential-satisficing}}
}
Variations:
Sequential & Satisficing:The idea for this domain came up from the Miconic domain of IPC2, however the domain has been designed from scratch. The scenario is the following: There is a building with N + 1 floors, numbered from 0 to N. The building can be separated in blocks of size M + 1, where M divides N. Adjacent blocks have a common floor. For example, suppose N = 12 and M = 4, then we have 13 floors in total (ranging from 0 to 12), which form 3 blocks of 5 floors each, being 0 to 4, 4 to 8, and 8 to 12. The building has K fast (accelerating) elevators that stop only in floors that are multiples of M / 2 (so M has to be an even number). Each fast elevator has a capacity of X persons. Furthermore, within each block, there are L slow elevators, that stop at every floor of the block. Each slow elevator has a capacity of Y persons (usually Y < X). There are costs associated with each elevator starting/stopping and moving. In particular, fast (accelerating) elevators have negligible cost of starting/stopping but have significant cost while moving. On the other hand, slow (constant speed) elevators have significant cost when starting/stopping and negligible cost while moving. Traveling times between floors are given for any type of elevator, taking into account the constant speed of the slow elevators and the constant acceleration of the fast elevators. There are several passengers, for which their current location (i.e., the floor they are on) and their destination are given. The planning problem is to find a plan that moves the passengers to their destinations while it maximizes some criterion.
Sequential & Optimal:The idea for this domain came up from the Miconic domain of IPC2, however the domain has been designed from scratch. The scenario is the following: There is a building with N + 1 floors, numbered from 0 to N. The building can be separated in blocks of size M + 1, where M divides N. Adjacent blocks have a common floor. For example, suppose N = 12 and M = 4, then we have 13 floors in total (ranging from 0 to 12), which form 3 blocks of 5 floors each, being 0 to 4, 4 to 8, and 8 to 12. The building has K fast (accelerating) elevators that stop only in floors that are multiples of M / 2 (so M has to be an even number). Each fast elevator has a capacity of X persons. Furthermore, within each block, there are L slow elevators, that stop at every floor of the block. Each slow elevator has a capacity of Y persons (usually Y < X). There are costs associated with each elevator starting/stopping and moving. In particular, fast (accelerating) elevators have negligible cost of starting/stopping but have significant cost while moving. On the other hand, slow (constant speed) elevators have significant cost when starting/stopping and negligible cost while moving. Traveling times between floors are given for any type of elevator, taking into account the constant speed of the slow elevators and the constant acceleration of the fast elevators. There are several passengers, for which their current location (i.e., the floor they are on) and their destination are given. The planning problem is to find a plan that moves the passengers to their destinations while it maximizes some criterion.
Sequential & Multicore:The idea for this domain came up from the Miconic domain of IPC2, however the domain has been designed from scratch. The scenario is the following: There is a building with N + 1 floors, numbered from 0 to N. The building can be separated in blocks of size M + 1, where M divides N. Adjacent blocks have a common floor. For example, suppose N = 12 and M = 4, then we have 13 floors in total (ranging from 0 to 12), which form 3 blocks of 5 floors each, being 0 to 4, 4 to 8, and 8 to 12. The building has K fast (accelerating) elevators that stop only in floors that are multiples of M / 2 (so M has to be an even number). Each fast elevator has a capacity of X persons. Furthermore, within each block, there are L slow elevators, that stop at every floor of the block. Each slow elevator has a capacity of Y persons (usually Y < X). There are costs associated with each elevator starting/stopping and moving. In particular, fast (accelerating) elevators have negligible cost of starting/stopping but have significant cost while moving. On the other hand, slow (constant speed) elevators have significant cost when starting/stopping and negligible cost while moving. Traveling times between floors are given for any type of elevator, taking into account the constant speed of the slow elevators and the constant acceleration of the fast elevators. There are several passengers, for which their current location (i.e., the floor they are on) and their destination are given. The planning problem is to find a plan that moves the passengers to their destinations while it maximizes some criterion.
Sequential & Temporal:The idea for this domain came up from the Miconic domain of IPC2, however the domain has been designed from scratch. The scenario is the following: There is a building with N + 1 floors, numbered from 0 to N. The building can be separated in blocks of size M + 1, where M divides N. Adjacent blocks have a common floor. For example, suppose N = 12 and M = 4, then we have 13 floors in total (ranging from 0 to 12), which form 3 blocks of 5 floors each, being 0 to 4, 4 to 8, and 8 to 12. The building has K fast (accelerating) elevators that stop only in floors that are multiples of M / 2 (so M has to be an even number). Each fast elevator has a capacity of X persons. Furthermore, within each block, there are L slow elevators, that stop at every floor of the block. Each slow elevator has a capacity of Y persons (usually Y < X). There are costs associated with each elevator starting/stopping and moving. In particular, fast (accelerating) elevators have negligible cost of starting/stopping but have significant cost while moving. On the other hand, slow (constant speed) elevators have significant cost when starting/stopping and negligible cost while moving. Traveling times between floors are given for any type of elevator, taking into account the constant speed of the slow elevators and the constant acceleration of the fast elevators. There are several passengers, for which their current location (i.e., the floor they are on) and their destination are given. The planning problem is to find a plan that moves the passengers to their destinations while it maximizes some criterion.