DocumentCode
299222
Title
Path search for complicated functions
Author
Tetelbaum, Alexander Y.
Author_Institution
Int. Solomon Univ., Kiev, Ukraine
Volume
1
fYear
1995
fDate
30 Apr-3 May 1995
Firstpage
369
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
0-7803-2570-2
Type
conf
DOI
10.1109/ISCAS.1995.521527
Filename
521527
Link To Document