In this research, we focus on making a comparative study between the path planning algorithm for multi-agent systems that are compatible with the GPU, regarding the main criteria like the success rate of the algorithm for finding a valid solution, the scalability of the algorithm, its run time compared with the CPU for a small number of agents and a big number of agents.

Алдармини С. (науч. рук. Колюбин С.А.) COMPARISON OF GPU MULTI-AGENT PATH PLANNING ALGORITHMS // Сборник тезисов докладов конгресса молодых ученых. Электронное издание. – СПб: Университет ИТМО, [2023]. URL: https://kmu.itmo.ru/digests/article/10159