Skip to content

An AI numeric and temporal planning problem, solved with durative actions.

Notifications You must be signed in to change notification settings

aliy98/AI-numeric-temporal-planning

Repository files navigation

AI_numeric_temporal_planning

In the considered warehouse, there are two robots that move crates around. The crates are to be loaded on the conveyor belt by an additional robot (as in the picture below). The idea is that when the warehouse receives new orders, the corresponding crates to be moved are communicated to the robots, that take them to a loading bay where a dedicated robot can put them on the conveyor belt. Usually, one robot is enough to move light crates in the warehouse. However, in the presence of heavy (>50kg) crates, two robots are required.

Usage

For numerc and temporal planning we can use LPG planner. After cloning this repository make sure the planner file is executable:

chmod +x lpg

then you can find the solution for each problem by using a single line command, for example to solve the problem 1 you should run this:

./lpg -o warehouse.pddl -f warehouse-prob1.pddl -n 1

About

An AI numeric and temporal planning problem, solved with durative actions.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published