On the effectiveness of optimal path finding methods

Date

1972

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Many problems in a number of different areas can be related to the general problem of finding a path, through a graph.. Often the search, for a path must be restricted by certain conditions such as time constraints or a guarantee that the path found is optimal. It is not always a simple matter, therefore, to select one of the available pathfinding methods which is most effective for a particular application. In this paper, a new path-finding method is presented and several known methods are discussed on a comparative basis. Versions of the algorithms were implemented by means of LISP programs and tested for their effectiveness. The results are used to demonstrate that, under certain conditions search effectiveness may be improved.

Description

Keywords

Citation