원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Path finding is one of those required elements of the computer network. Any path finding algorithm will work as long as there are no obstacles or distractions along the way. If there is an obstacle, then the character needs to figure out a way to move around and still reach the goal.
In this paper, we have simulated the existing path-finding algorithms and state that A* is the most popular choice for path-finding and it is very flexible and can be used in a wide range of contexts.
목차
Abstract
1. Introduction
2. Simulation of path finding algorithm
3. Experiment and Analysis
4. Related works
5. Conclusion
References
1. Introduction
2. Simulation of path finding algorithm
3. Experiment and Analysis
4. Related works
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보