The assignment of the planning task

Author: Radek Mařík
Edit: Tibor Strašrybka

Upload two files in a single ZIP archive:

  1. A file domain.pddl with a specification of the planning domain.
  2. A file problem.pddl with a specification of the planning problem.

The following planning domain is shared by all assignments:

  1. The goal is to transport cargo/people between different places and towns by cars and airplanes.
  2. Vehicles can be loaded with only a single package/person.
  3. Aircrafts can be also loaded with only a single package/person.
  4. An aircraft can fly only from one airport to another airport.
  5. A vehicle can go between selected airports and towns along given roads.
  6. The airports are only in Boston, New York, Las Vegas, Paris and Prague.
  7. Air connections are only between Boston and New York, New York and Las Vegas, New York and Paris, New York and Prague, Paris and Prague.
  8. Roads connect only Prague and Pilsen, Prague and Liberec, Liberec and Kladno, New York and Stamford, New York and Trenton, Lakewood and Trenton, Boston and Newton, Boston and Weymouth, Newton and Weymouth, Las Vegas and Flagstaff, Las Vegas and Henderson, Flagstaff and Prescott, Paris and Vernon, Vernon and Dreux, Paris and Etampes, Etampes and Fontainebleau.
  9. Put vehicles into towns so that none of the vehicles is initially in a town with an airport and there are at most two vehicles in the neighborhood of each airport.

Variants of planning problems

The variant is assigned by the number in the students list in timetable https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B152/public/cz/paralelky/C12/81/par12813504.101.html.

1. variant

2. variant

3. variant

4. variant

5. variant

6. variant

7. variant

8. variant

9. variant

10. variant

11. variant

12. variant

13. variant

14. variant

15. variant

16. variant

17. variant

18. variant

19. variant

20. variant

21. variant

22. variant

23. variant

24. variant

25. variant

26. variant

27. variant