Path search for complicated functions
A.Y. Tetelbaum · 2002
It is shown that one of the possible ways of conducting an optimum path search for a complicated path function is to reduce the problem to a short path search through the state space. A general algorithm for the optimum path search is proposed and discussed. The proposed algorithm can be considered as a general method of conducting a search in the state space for described classes of problems.