Authors:
Azizkhon Afzalov
1
;
Ahmad Lotfi
1
;
Benjamin Inden
2
and
Mehmet Emin Aydin
3
Affiliations:
1
School of Science and Technology, Clifton Campus, Nottingham Trent University, England NG11 8NS, U.K.
;
2
Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany
;
3
University of the West of England, Coldharbour Ln, Bristol BS16 1QY, U.K.
Keyword(s):
Multiple Targets, Multi-agent Path Planning, Path Finding, Search Algorithm.
Abstract:
Multi-agent multi-target search problems, where the targets are capable of movement, require sophisticated algorithms for near-optimal performance. While there are several algorithms for agent control, comparatively less attention has been paid to near-optimal target behaviours. Here, a state-of-the-art algorithm for targets to avoid a single agent called TrailMax has been adapted to work within a multiple agents and multiple targets framework. The aim of the presented algorithm is to make the targets avoid capture as long as possible, if possible until timeout. Empirical analysis is performed on grid-based gaming benchmarks. The results suggest that Multiple Pursuers TrailMax reduces the agent success rate by up to 15% as compared to several previously used target control algorithms and increases the time until capture in successful runs.