A Comprehensive Study on Pathfinding Techniques for Robotics and Video Games
Open Access
- 2 April 2015
- journal article
- review article
- Published by Hindawi Limited in International Journal of Computer Games Technology
- Vol. 2015, 1-11
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.Keywords
This publication has 25 references indexed in Scilit:
- Cellular topology and topological coordinate systems on the hexagonal and on the triangular gridsAnnals of Mathematics and Artificial Intelligence, 2014
- Simulation of Dynamic Path Planning for Real-Time Vision-Base Robots2013
- Survey of Shadow Volume Algorithms in Computer GraphicsIETE Technical Review, 2013
- Benchmarks for Grid-Based PathfindingIEEE Transactions on Computational Intelligence and AI in Games, 2012
- Grid Task Scheduling: Algorithm ReviewIETE Technical Review, 2011
- Global planning on the Mars Exploration Rovers: Software integration and surface testingJournal of Field Robotics, 2009
- Comparing real-time and incremental heuristic search for real-time situated agentsAutonomous Agents and Multi-Agent Systems, 2008
- Understanding Planning Tasks2008
- Planning as heuristic searchArtificial Intelligence, 2001
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968