The project was done with 3 colleagues (Claudio Giovanni, Marsano Matilde and Vassallo Christian). My responsibility was the implementation of the above mentioned algorithm.
The goal of the project was to build a multithreaded program in C. This simulates a mobile robot (“robber”) that is supposed to find a way through an unknown environment (binary maze), while avoiding hostile agents for a certain amount of time. There are 2 types of hostile agents - “policeman” and “ninja”. The former moves in a pseudo-random fashion through the map, while the latter is actively searching for the “robber”.
My responsibility within the project was to develop the algorithm employed by the "robber", "policeman" and "ninja".
The algorithm is based on a potential field approach. The “robber” is repulsed by the hostile agents, and attracted to a specific position on the map. Conversely, the “ninja” is attracted by the “robber” and tries to catch it.