Problem List by category: Multi-Core

ID	Name	Categories	Language	Author	Description	Source
001	Barman	Sequential Multi-Core Satisficing Optimal	PDDL	Sergio Jimenez Celorrio	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. In this domain deletes of actions encode relevant knowledge given that robot hands can only grasp one object at ...	View Source
002	Elevator	Sequential Multi-Core Optimal Satisficing Temporal	PDDL	Unknown	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 block...	View Source

Problem List by category: Optimal

ID	Name	Categories	Language	Author	Description	Source
001	Barman	Sequential Multi-Core Satisficing Optimal	PDDL	Sergio Jimenez Celorrio	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. In this domain deletes of actions encode relevant knowledge given that robot hands can only grasp one object at ...	View Source
002	Elevator	Sequential Multi-Core Optimal Satisficing Temporal	PDDL	Unknown	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 block...	View Source

Problem List by category: Satisficing

ID	Name	Categories	Language	Author	Description	Source
001	Barman	Sequential Multi-Core Satisficing Optimal	PDDL	Sergio Jimenez Celorrio	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. In this domain deletes of actions encode relevant knowledge given that robot hands can only grasp one object at ...	View Source
002	Elevator	Sequential Multi-Core Optimal Satisficing Temporal	PDDL	Unknown	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 block...	View Source
003	Match Cellar	Temporal Satisficing	PDDL	Bharat Ranjan Kavuluri	Domain is inspired by a paper by Long and Fox. The main feature of this domain is that a lighted match is concurrently required to fix a fuse.	View Source

Problem List by category: Sequential

ID	Name	Categories	Language	Author	Description	Source
001	Barman	Sequential Multi-Core Satisficing Optimal	PDDL	Sergio Jimenez Celorrio	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. In this domain deletes of actions encode relevant knowledge given that robot hands can only grasp one object at ...	View Source
002	Elevator	Sequential Multi-Core Optimal Satisficing Temporal	PDDL	Unknown	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 block...	View Source

Problem List by category: Temporal

ID	Name	Categories	Language	Author	Description	Source
002	Elevator	Sequential Multi-Core Optimal Satisficing Temporal	PDDL	Unknown	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 block...	View Source
003	Match Cellar	Temporal Satisficing	PDDL	Bharat Ranjan Kavuluri	Domain is inspired by a paper by Long and Fox. The main feature of this domain is that a lighted match is concurrently required to fix a fuse.	View Source