Title :
Path search for complicated functions
Author :
Tetelbaum, Alexander Y.
Author_Institution :
Int. Solomon Univ., Kiev, Ukraine
fDate :
30 Apr-3 May 1995
Abstract :
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
Keywords :
optimisation; search problems; complicated functions; optimum path search algorithm; state space; Equations; State-space methods;
Conference_Titel :
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2570-2
DOI :
10.1109/ISCAS.1995.521527
