Akademik Veri Yönetim Sistemi
8th International Conference on Robot Intelligence Technology and Applications, RiTA 2020, Virtual, Online, 11 - 13 Aralık 2020, ss.195-204, (Tam Metin Bildiri)
The aim of this study is to investigate how to solve the path-planning problem of multiple competing players towards moving targets within a dynamically changing environment. A novel approach is needed to exceed the classical solutions for single or multiple agent search algorithms. An assignment strategy is introduced for pursuing agents. They can compute the distance towards the targets, while all players are at the current state. The reason to use the assignment strategy is to find a better solution, especially in the round circle cases, where pursuing agents trap and outmanoeuvre the targets. This study set out to explore how the agents can outsmart targets by exploiting repeated A* searches. To find a solution to such a dynamic problem, a heuristic search algorithm Strategy Multiple Target A* (STMTA*) will be developed and implemented. These are promising AI approaches. Pursuing agents can freely communicate and share information. A multi-agent framework will be used. The experimental results suggested that STMTA* is quicker in number of steps and successful in respect of catching targets on each test run approximately by 27%.