The State of Art Heuristic Pathfinding in Games

Sabri, Aimi Najwa; Radzi, Nor Haizan Mohamed; Hassan, H.

doi:10.1166/asl.2018.10731

Cited by 3 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, this study presents a review of common challenges for pathfinding in video games. Besides, this research complements an earlier study which reviews several optimization and variant of pathfinding algorithms such as [4], [10], [11], and [12]. The existence of periodic review on a regular basis becomes essential as a guideline to the new researchers in recognizing the improvement of pathfinding study and emphasize the possible research in the character's navigation using heuristic pathfinding techniques.…”

Section: Introductionmentioning

confidence: 62%

“…Pathfinding in the static environment poses fewer challenges than the dynamic environment, which the latter refers to the changeable position of obstacle [12]. In computer games, pathfinding is very important to allow non-player characters (NPCs) to move to specific target positions [13].…”

Section: Challenges For Pathfinding In Video Gamesmentioning

confidence: 99%

“…The heuristic search function is a key field of AI, and it has been extensively utilized in game-play, path-planning and agent control [26]. The definition of the heuristic search function can be simplified as a set of guidelines for selecting pathways in a state-space that resulted in an agreeable possible resolution by decreasing the number of options movements [12]. The heuristic itself employs a practical pathfinding algorithm that is not guaranteed to be finest or rational, but which is nevertheless adequate for the pathfinding solution.…”

Section: Optimization By Improving Heuristic Functionsmentioning

confidence: 99%

See 2 more Smart Citations

A Review on Informed Search Algorithms for Video Games Pathfinding

Kapi¹

2020

IJATCSE

View full text Add to dashboard Cite

Pathfinding is a broadly applied algorithm that involved the discovery of routes between two positions by avoiding obstacles at the same time. Recently, a significant number of researchers focusing on informed search algorithms for pathfinding concerning games. However, review regarding the latest optimization in the pathfinding algorithm and its advantages still lacks in the literature. To organize this heterogeneity, this paper presents a review that focused on numerous modifications to enhance the execution of the informed search algorithm through four classified perspectives: i) modification to the graph representation, ii) enhancement of heuristic function, iii) hybrid search algorithm, and iv) new data structure. This paper also aims to discuss common challenges faced by pathfinding in video games and providing future trends for optimization. While incorporating pathfinding optimization over the past decade, this paper also aims to assist new researchers by emphasizing the potential path for further exploration.

show abstract

Section: Introductionmentioning

confidence: 62%

Section: Challenges For Pathfinding In Video Gamesmentioning

confidence: 99%

Section: Optimization By Improving Heuristic Functionsmentioning

confidence: 99%

See 1 more Smart Citation

A Review on Informed Search Algorithms for Video Games Pathfinding

Kapi¹

2020

IJATCSE

View full text Add to dashboard Cite

show abstract

“…Grid maps are the most popular pathfinding environment due to the simplicity and ease of use [6]. Furthermore, it is also relatively fast to generate a grid map and it only includes two categories of cells: passable and block able [7]. The movement of an agent in grid map is limited to eight possible directions.…”

Section: Introductionmentioning

confidence: 99%

A Comparison of Pathfinding Algorithm for Code Optimization on Grid Maps

Kapi¹,

Sunar²,

Algfoor³

2022

IJACSA

View full text Add to dashboard Cite

There have been various pathfinding algorithms created and developed over the past few decades to assist in finding the best path between two points. This paper presents a comparison of several algorithms for pathfinding on 2D grid maps. As a result, this study identified Jump Point Search Block Based Jumping (JPS (B)) as a potential algorithm in term of five evaluation metrics including search time. The comparisons pointed out the potential algorithm and code optimization was performed on the selected JPS(B) algorithm, and it was named JPS(BCO). This paper also explores issues regarding the JPS(B) and how to resolve them in order to optimize access to the index pointer. The presented enhance JPS(BCO) is capable to search optimal path quicker than the original JPS(B) as demonstrated by experimental findings. An experiment of different size grid maps is conducted to validate the ability of the proposed algorithm in term of search time. The comparative study with original JPS (B) exhibits the enhancement that has more benefits on grid maps of different size in terms of search time.

show abstract