Simulation of Path Finding Algorithm – a Bird’s Eye Perspective

Abstract

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