| Title |
Fast approximate pathfinding based on 2D convolution / |
| Authors |
Teleiša, Marius ; Čalnerytė, Dalia |
| Full Text |
|
| Is Part of |
CEUR workshop proceedings: IVUS 2023: Information society and university studies 2023: proceedings of the 28th international conference on information society and university studies (IVUS 2023) Kaunas, Lithuania, May 12, 2023 / edited by: A. Lopata, T. Krilavičius, I. Veitaitė, A. García-Holgado.. Aachen : CEUR-WS. 2023, vol. 3575, p. 112-121.. ISSN 1613-0073 |
| Keywords [eng] |
hierarchical pathfinding ; grid graphs ; heuristic search |
| Abstract [eng] |
The goal of pathfinding algorithms is to find a path between the desired points. An optimal path is more complex and time consuming to find, which is why some industries, such as the video game industry, can sacrifice optimality for reduced run-time. A grid map can be represented as an image, so techniques used in image processing, such as filtering, may be applied to pathfinding. In this paper we propose a convolution inspired hierarchical pathfinding algorithm that achieved 4% longer paths and 97% shorter runtime than A* on average. |
| Published |
Aachen : CEUR-WS |
| Type |
Conference paper |
| Language |
English |
| Publication date |
2023 |
| CC license |
|
