Pursuit and Evasion in Polygonal Environments - A Mixed Integer Linear Programming Approach.

Abstract: This report addresses improvements to an already existent model of a Pursuit-and-Evasion problem. The model is formulated using Mixed Integer Linear Programming (MILP). The computation time of the original model is first thoroughly examined by solving for increasingly large areas, and with a varying number of pursuers. Some improvements to the model are suggested for shortening the computation time. Finally, a new model is suggested with the aims of being more realistic and to address an issue in the original model that meant that pursuers must not share tiles (i.e they must stay separated at all times).