The Minimum Cost Path Finding Algorithm using a Hopfield Type Neural Network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 708
  • Download : 1379
DC FieldValueLanguage
dc.contributor.authorHong, S.G.-
dc.contributor.authorKim, S.W.-
dc.contributor.authorLee, Ju-Jang-
dc.date.accessioned2009-01-15T09:08:44Z-
dc.date.available2009-01-15T09:08:44Z-
dc.date.issued1995-
dc.identifier.citationFuzzy Systems, 1995. International Joint Conference of the Fourth IEEE International Conference on Fuzzy Systems and The Second International Fuzzy Engineering Symposium., Proceedings of 1995 IEEE International Conference on, Volume: 4, On page(s): 1719-1726en
dc.identifier.isbn0-7803-2461-7-
dc.identifier.urihttp://hdl.handle.net/10203/8322-
dc.description.abstractNeural networks have been proposed as new computational tools for solving constrained optimization problems. In this paper the minimum cost path finding algorithm is proposed by using a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defined at first. To achieve this, the concept of a vector-represented network is used to describe the connected path. Through simulations, it will be shown that the proposed algorithm works very well in many cases. The local minima problem of a Hopfield type neural network is discusseden
dc.language.isoen_USen
dc.publisherIEEEen
dc.subjectPath findingen
dc.subjectHopfield networken
dc.titleThe Minimum Cost Path Finding Algorithm using a Hopfield Type Neural Networken
dc.typeArticleen
dc.identifier.doi10.1109/FUZZY.1995.409914-

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0