Afzalov, A. ORCID: 0000-0002-1456-542X, Lotfi, A. ORCID: 0000-0002-5139-6565, Inden, B. and Aydin, M.E., 2022. A strategy-based algorithm for moving targets in an environment with multiple agents. SN Computer Science, 3 (6): 435. ISSN 2661-8907
|
Text
1591172_Lofti.pdf - Post-print Download (1MB) | Preview |
Abstract
Most studies in the field of search algorithms have only focused on pursuing agents, while comparatively less attention has been paid to target algorithms that employ strategies to evade multiple pursuing agents. In this study, a state-of-the-art target algorithm, TrailMax, has been enhanced and implemented for multiple agent pathfinding problems. The presented algorithm aims to maximise the capture time if possible until timeout. Empirical analysis is performed on grid-based gaming benchmarks, measuring the capture cost, the success of escape and statistically analysing the results. The new algorithm, Multiple Pursuers TrailMax, doubles the escaping time steps until capture when compared with existing target algorithms and increases the target’s escaping success by 13% and in some individual cases by 37%.
Item Type: | Journal article | ||||||
---|---|---|---|---|---|---|---|
Publication Title: | SN Computer Science | ||||||
Creators: | Afzalov, A., Lotfi, A., Inden, B. and Aydin, M.E. | ||||||
Publisher: | Springer Science and Business Media LLC | ||||||
Date: | 9 August 2022 | ||||||
Volume: | 3 | ||||||
Number: | 6 | ||||||
ISSN: | 2661-8907 | ||||||
Identifiers: |
|
||||||
Divisions: | Schools > School of Science and Technology | ||||||
Record created by: | Laura Ward | ||||||
Date Added: | 16 Aug 2022 08:31 | ||||||
Last Modified: | 09 Aug 2023 03:00 | ||||||
URI: | https://irep.ntu.ac.uk/id/eprint/46883 |
Actions (login required)
Edit View |
Views
Views per month over past year
Downloads
Downloads per month over past year