Home

Welcome to the ConstrainedPlanningToolbox wiki!

1. Create a problem instance

In the first step a planning problem with constraints is defined based on an application domain. Such a planning problem is formalized as a problem instance.

Output: problem instance

2. Compute a solution

In the second step a planning algorithm can be used to obtain a solution for a given problem instance.

Input: problem instance

Output: solution

3. Evaluate the solution

The solution computed by a planning algorithm can be evaluated using a simulator, which keeps track of several statistics regarding the performance of the solution in the given domain.

Input: solution

Output: performance statistics

Reading guide

More detailed information about the specific steps can be found on the following pages:

• Domains and problem instances
• Algorithms
• Solutions
• Simulation

In order to get started with the toolbox, we recommend to read these pages carefully. After that, it is time to start testing based on the examples provided.