Title :
Complicated path function search
Author :
Tetelbaum, Alexander Y.
Author_Institution :
Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA
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 the classes of problem described
Keywords :
graph theory; state-space methods; complicated path function; graph theory; optimum path search; state space; undirected graphs; Algorithm design and analysis; Control system analysis; Control systems; Design optimization; Routing; State-space methods; Wires;
Conference_Titel :
Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
Conference_Location :
Lafayette, LA
Print_ISBN :
0-7803-2428-5
DOI :
10.1109/MWSCAS.1994.519262
