Search
The problem is to find a 'day plan' for a set of people in a city (or state, or some other geographical location). Each person has somewhere to live, where he or she starts and must end, moreover, each person has a workplace where he or she has to work. Some people may be related, i.e. a family.
The city is represented as a set of locations of interest and a multimodal graph connecting some of the locations by various modes of transport (e.g. walk, car, taxi, underground,..). There are particular vehicles providing the transport.
Each vehicle must have a driver to operate. Not all people can board all vehicles, for example a car is owned by a single family and other people cannot board it, a child cannot board a taxi (at least on its own). Being a driver of a taxi or public transport counts as a work (with no particular workplace).
There are multiple levels of complexity of the problem. The basic level is the minimal mandatory level in order to pass the assignment, for solving each of the higher levels you will receive additional points.
= mandatory
name-surname_uloha1.zip |- report.pdf |- simple | |- domain.pddl | |- p01.pddl | |- p02.pddl | |- planner1 | |- p01.log | |- p01.solution | |- … | |- … |- costs | |- domain.pddl | |- p01.pddl | |- p02.pddl | |- planner1 | |- p01.log | |- p01.solution | |- … | |- … |- temporal | |- domain.pddl | |- p01.pddl | |- p02.pddl | |- planner1 | |- p01.log | |- p01.solution | |- … | |- … |- extended | |- domain.pddl | |- p01.pddl | |- p02.pddl | |- planner1 | |- p01.log | |- p01.solution | |- … | |- …
(path A B)
(path B A)
(increase (total-cost) (* (distance ?f ?t) (cost-per-km)))