2022
DOI: 10.25124/cepat.v1i01.4863
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Pathfinding in Game Development

Abstract: Pathfinding is one important method in many studies or works that consists of autonomous movement, such as robot, game, transportation, and so on. Pathfinding aims to find the most efficient route for the related autonomous entity. To date, there are many algorithms regarding to the pathfinding. Especially, there are four well-known pathfinding algorithms: A*, Theta*, Dijkstra, and Breadth First Search (BFS). Due to this circumstance, this work aims to observe and review these four well-known algorithms deeper… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 23 publications
(31 reference statements)
0
4
0
Order By: Relevance
“…-Node [0, 3] -Node [0, 2] F(x) = 80 -Node (1,2) F(x) = 80 -Node (1,3) F(x) = 66 (Node selected) 3. Calculate F(x) from nodes around (1,3) towards the position of the player -Node (1,3) -Node (2,2) F(x) = 86 -Node (2,3) F(x) = 72 (Node selected) 4.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…-Node [0, 3] -Node [0, 2] F(x) = 80 -Node (1,2) F(x) = 80 -Node (1,3) F(x) = 66 (Node selected) 3. Calculate F(x) from nodes around (1,3) towards the position of the player -Node (1,3) -Node (2,2) F(x) = 86 -Node (2,3) F(x) = 72 (Node selected) 4.…”
Section: Resultsmentioning
confidence: 99%
“…-Node [0, 3] -Node [0, 2] F(x) = 80 -Node (1,2) F(x) = 80 -Node (1,3) F(x) = 66 (Node selected) 3. Calculate F(x) from nodes around (1,3) towards the position of the player -Node (1,3) -Node (2,2) F(x) = 86 -Node (2,3) F(x) = 72 (Node selected) 4. Calculate F(x) from nodes around (2,3) towards the position of the player -Node (2,3) -Node (2,3) F(x) = 92 -Node (3,3) F(x) = 78 (Node selected) 5.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The scenario employs a (CALE) with a simplified navigation and interaction interface that encourages emotions and interactions among participants, who can play alone or with their instructors. For agent movement in a virtual world, the A * (A-Star) pathfinding search algorithm is used [61] (see Fig. 11).…”
Section: Emocash Gameplaymentioning
confidence: 99%