ABSTRACT Finding the shortest path between two points is a classical problem of growing importance. More and more often, this problem is encountered within diverse computer science and image processing applications. Many different approaches to this problem exist. The method presented here is divided into a knowledge-based plan generator and a conventional program which acts upon cues present within the resulting plan. This method demonstrates significant efficiency while also providing certain advantages over other techniques.