A comprehensive study on pathfinding techniques for robotics and video games

122Citations
Citations of this article
198Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This survey provides an overview of popular pathfinding algorithms and techniques based on graph generation problems. We focus on recent developments and improvements in existing techniques and examine their impact on robotics and the video games industry. We have categorized pathfinding algorithms based on a 2D/3D environment search. The aim of this paper is to provide researchers with a thorough background on the progress made in the last 10 years in this field, summarize the principal techniques, and describe their results. We also give our expectations for future trends in this field and discuss the possibility of using pathfinding techniques in more extensive areas.

References Powered by Scopus

9212Citations
2537Readers
Get full text

A survey of Monte Carlo tree search methods

2274Citations
2086Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Abd Algfoor, Z., Sunar, M. S., & Kolivand, H. (2015). A comprehensive study on pathfinding techniques for robotics and video games. International Journal of Computer Games Technology, 2015. https://doi.org/10.1155/2015/736138

Readers over time

‘15‘16‘17‘18‘19‘20‘21‘22‘23‘24‘25010203040

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 75

77%

Researcher 9

9%

Lecturer / Post doc 8

8%

Professor / Associate Prof. 6

6%

Readers' Discipline

Tooltip

Computer Science 85

71%

Engineering 28

24%

Environmental Science 3

3%

Psychology 3

3%

Article Metrics

Tooltip
Mentions
References: 2
Social Media
Shares, Likes & Comments: 2

Save time finding and organizing research with Mendeley

Sign up for free
0