This library contains three types of PDDL files:
-
Domain file (xxx.pddl), in which the models including control primitives (CPs) are defined.
-
Problem file (xxx_prob.pddl), in which the problems including initial state and goal are defined.
-
Plan file (xxx_prob.plan) corresponding to the problem, in which the result of each problem is saved.
The library contains nine PDDL domain files, with the exception of the xPPU.pddl domain file which corresponds to each of the three problem files and their solution files, the remaining domains and problems correspond individually.
PDDL Extention in vs-code needs to be installed.
Two planners are used:
Which planner is used to calculate each strategy is marked in the corresponding domain file.
The eight domains in this library, excluding xPPU.pddl, can be divided into four application scenarios, which are stored in the following four folders. xPPU.pddl is a collection of these application scenarios.
Use Case 1: three components stack, crane, and stamp and three workpieces WP1 (metal), WP2 (white) and WP3 (black) are considered. Initially, all three workpieces are stored in the stack, and the target state is that they are stamped according to the requirements and transported to the conveyer.
runs in LGP-td
include the transport CP Location-oriented Modelling
runs in Optic
include the tranport CP Carrier-oriented Modelling
The plans of Use Case 1 listed out in the paper is generated by this domain.
In this domain there are two T-positioned conveyors, on each of which there is a workpiece, and the goal is to exchange the positions of the two workpieces.
runs in both planners
include the tranport CP Mapping-oriented Modelling
Use Case 2: the crane cannot place the workpiece correctly due to jitter during turning, thereby a recovery form a placement failure is needed.
runs in both planners
Use Case 3: this application scenario is for the transport of workpieces on conveyor belts, consisting of two transfer belts in a T-position, and two or three workpieces. The starting position and the target position are arbitrary.
runs in LPG-td
Two workpieces are located on a single conveyor belt with a limited number of reachable positions.
runs in both planners
The starting positions of the two workpieces are located on two conveyor belts, but the reachable positions are limited
runs in Optic
The three workpieces are located on two conveyors, the start positions are located at any stand point and the arrival position is located at any discrete point. The two conveyors are not independent.
runs in Optic
The two conveyor belts are independent of each other, based on recover_2_third.pddl.
The strategy of Use Case 3 in the paper is generated by this domain.
Modelling xPPU, the domain is a collection of the three aforementioned Auto_new.pddl, recovery_1.pddl and recovery_2_forth.pddl domains, containing problem files for the three Use cases.
with three problems and their plans, runs in Optic