On Confinement of the Initial Location of an Intruder in a Multi-robot Pursuit Game

Research in multi-robot pursuit-evasion demonstrates that three pursuers are sufficient to capture an intruder in a polygonal environment. However, this result requires the confined of the initial location of the intruder within the convex hull of the locations of the pursuers. In this study, we extend this result to alleviate this convexity through the application of a set of virtual goals that are independent of the locations of the pursuers. These virtual goals are solely calculated using the location information of the intruder such that whose locations confine the intruder within their convex hull at every execution cycle. We propose two strategies to coordinate the pursuers. They are the agents votes maximization and the profile matrix permutations strategies. We consider the time, the energy expended, and the distance traveled by the pursuers as metrics to analyze the performance of these strategies in contrast to three different allocation strategies. They are the probabilistic, the leader-follower, and the prioritization coordination strategies.