Generally, pathfinding consists of two main steps: graph generation and a pathfinding algorithm. Each of these problems has different applications in different fields. In general, there are different variations of the pathfinding problem, such as single-agent pathfinding search, multiagent pathfinding search, adversarial pathfinding, dynamic changes in the environment, heterogeneous terrain, mobile units, and incomplete information. Currently, the most important area concerns the provision of high-performance, realistic paths for users. Although a number of developments have improved the accuracy and efficiency of pathfinding techniques over the past two decades, the problem still attracts a great deal of research. Pathfinding is a fundamental component of many important applications in the fields of GPS, video games, robotics, logistics, and crowd simulation and can be implemented in static, dynamic, and real-time environments. We also give our expectations for future trends in this field and discuss the possibility of using pathfinding techniques in more extensive areas. 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 have categorized pathfinding algorithms based on a 2D/3D environment search. We focus on recent developments and improvements in existing techniques and examine their impact on robotics and the video games industry. This survey provides an overview of popular pathfinding algorithms and techniques based on graph generation problems.