Pathfinding in Computer Games
暂无分享,去创建一个
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This report will highlight pathfinding algorithms used presently in games and their shortcomings especially when dealing with real-time pathfinding. With the advances being made in other components, such as physics engines, it is AI that is impeding the next generation of computer games. This report will focus on how machine learning techniques such as Artificial Neural Networks and Genetic Algorithms can be used to enhance an agents ability to handle pathfinding in real-time.
[1] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[2] Laurene V. Fausett,et al. Fundamentals Of Neural Networks , 1994 .
[3] Anthony Stentz. Map-Based Strategies for Robot Navigation in Unknown Environments , 1998 .
[4] Anthony Stentz,et al. Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.