loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.206.185.68

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Afzalov, A.; Lotfi, A.; Inden, B. and Aydin, M. (2021). Multiple Pursuers TrailMax Algorithm for Dynamic Environments. In Proceedings of the 13th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-484-8; ISSN 2184-433X, SciTePress, pages 437-443. DOI: 10.5220/0010392404370443

@conference{icaart21,
author={Azizkhon Afzalov. and Ahmad Lotfi. and Benjamin Inden. and Mehmet Emin Aydin.},
title={Multiple Pursuers TrailMax Algorithm for Dynamic Environments},
booktitle={Proceedings of the 13th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2021},
pages={437-443},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010392404370443},
isbn={978-989-758-484-8},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 13th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Multiple Pursuers TrailMax Algorithm for Dynamic Environments
SN - 978-989-758-484-8
IS - 2184-433X
AU - Afzalov, A.
AU - Lotfi, A.
AU - Inden, B.
AU - Aydin, M.
PY - 2021
SP - 437
EP - 443
DO - 10.5220/0010392404370443
PB - SciTePress