In this problem we are the head of a delivery agency and try to deliver the packages in the shortest time possible. Our clients are operating in a deterministic manner.
The environment is a rectangular grid with passable and non passable points for drone passage.Moreover, there are packages lying in different locations around the grid. The packages can be picked up by drones and delivered to clients.Clients can move on a pre-determined and known path, and each client has a list of required packages. The goal is the deliver to most packages possible.
- ex1.py - implements the specific problem, the soultion would be applied here.
- check.py - the file that includes some wrappers and inputs
- search.py - a file that has implementations of different search algorithms (including GBFS, A* and many more)
- utils.py - the file that contains some utility functions.
1.Open the terminal
2.Clone the project by:
$ git clone https://github.com/elaysason/Deterministic-Drone-Problem.git
3.Run the check.py file by:
$ python3 check.py