Collaborative Diffusion on the GPU for Path-Finding in Games

McMillan, Craig; Hart, Emma; Chalmers, Kevin

doi:10.1007/978-3-319-16549-3_34

Cited by 2 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the experimental procedure described by [23], all experiments were repeated 10 times and the average results calculated for each evaluation metric. A complete disconnect from the internet is kept throughout the experiment to prevent any disruptions caused by unwanted activity.…”

Section: Experimental Results On Analysis Of Pathfinding Algorithmsmentioning

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

Section: Experimental Results On Analysis Of Pathfinding Algorithmsmentioning

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

show abstract

“…A focus of these previous works is on item deduplication. A number of previous works considered the execution of an individual search on a GPU [39], [40]. Zhou et al [41] use multiple thousand binary heaps to hold intermediate results.…”

Section: Priority Queue Designmentioning

confidence: 99%

Performance Evaluation of Priority Queues for Fine-Grained Parallel Tasks on GPUs

Baudis¹,

Jacob

Andelfinger

2017

2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS

View full text Add to dashboard Cite

Graphics processing units (GPUs) are increasingly applied to accelerate tasks such as graph problems and discreteevent simulation that are characterized by irregularity, i.e., a strong dependence of the control flow and memory accesses on the input. The core data structure in many of these irregular tasks are priority queues that guide the progress of the computations and which can easily become the bottleneck of an application. To our knowledge, currently no systematic comparison of priority queue implementations on GPUs exists in the literature. We close this gap by a performance evaluation of GPU-based priority queue implementations for two applications: discrete-event simulation and parallel A* path searches on grids. We focus on scenarios requiring large numbers of priority queues holding up to a few thousand items each. We present performance measurements covering linear queue designs, implicit binary heaps, splay trees, and a GPU-specific proposal from the literature. The measurement results show that up to about 500 items per queue, circular buffers frequently outperform tree-based queues for the considered applications, particularly under a simple parallelization of individual item enqueue operations. We analyze profiling metrics to explore classical queue designs in light of the importance of high hardware utilization as well as homogeneous computations and memory accesses across GPU threads.

show abstract

Collaborative Diffusion on the GPU for Path-Finding in Games

Cited by 2 publications

References 6 publications

A Comparison of Pathfinding Algorithm for Code Optimization on Grid Maps

A Comparison of Pathfinding Algorithm for Code Optimization on Grid Maps

Performance Evaluation of Priority Queues for Fine-Grained Parallel Tasks on GPUs

Contact Info

Product

Resources

About