Differential game with slow pursuers on the 1-skeleton graph of the dodecahedron

Abstract

This work is devoted to study pursuit problems involving multiple pursuers and a single evader, all moving on the 1-skeleton graph of the dodecahedron. Solutions to the pursuit problems are provided, where the maximum speeds of the pursuers are less than the maximum speed of the evader. Conditions for the maximum speeds of the pursuers are obtained and a strategy for the pursuers to capture the evader is presented.