This web interface allows you to solve instances of the Automated Warehouse Scenario, a logistics-inspired planning problem modeled using Answer Set Programming (ASP).
In this problem, autonomous robots must pick up product shelves and deliver them to picking stations in a grid-based warehouse. The challenge is to find an efficient plan — a sequence of robot actions (like move, pickup, deliver) — that fulfills all customer orders while minimizing the total number of time steps (makespan).
Each instance is encoded as a .asp file (Answer Set Program). When you click a button below, the server
uses the Clingo solver to compute the optimal sequence of actions under hard constraints like:
no robot collisions, valid shelf handling, and correct delivery conditions.
// Result will appear here
The output is a set of atoms (facts) representing a valid solution:
move(robot1, 1, 2, 3) – At time step 1, robot1 moves to position (2, 3).pickup(robot1, shelf5) – Robot picks up shelf5 at its location.deliver(robot1, station2) – Robot delivers shelf5 to station2.shelf_at(shelf5, 2, 3) – Shelf5 is initially at position (2, 3).goal(station2, shelf5) – Shelf5 needs to be delivered to station2.
These steps together form a valid plan. If you see No answer sets found, there is no valid solution
for that scenario.