Solving the puzzle problem using Hopfield neural network in conjunction with tree search algorithm

被引:0
作者
Taheri, J [1 ]
机构
[1] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
来源
PROCEEDINGS OF THE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS 2003, VOLS 1-4 | 2003年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new approach based on Artificial Neural Networks for solving the Puzzle Problem in conjunction with the Tree Search Algorithm, is presented. For this purpose, a Hopfield Neural Network is used in a certain constraint satisfaction problem of the puzzle so that the energy of a state can be interpreted as the extent to which a hypothesis fits the underlying neural formulation model. Thus, low energy values indicate a good level of constraint satisfaction of the puzzle problem. Also, another criterion known as "Tree Search Algorithm", is used to solve the puzzle problem. At the end, based on the appropriate behaviors of each-of the presented algorithms, these two algorithms are combined so that they generate a much more powerful algorithm than each of them individually. Finally, a comparison is made for the actual performance of the proposed algorithm and the Hopfield Neural Network optimizer formerly presented in [12].
引用
收藏
页码:456 / 461
页数:6
相关论文
共 11 条
[1]  
[Anonymous], ARTIFICIAL INTELLIGE
[2]  
ARABIE P, 1996, CLUSTERING ANS CLASS
[3]  
BOWEN KA, 1991, PROLOG EXPERT SYSTEM
[4]  
GAO QS, 1989, MACRO TRANSFORM APPR
[5]  
HOPFIELD JJ, 1985, BIOL CYBERNETICS, V52
[6]  
IRANI KB, 1988, IEEE T PATTERN ANAL, V10
[7]  
KAJIURA M, 1989, IEEE TAB NEUR NETW C, V2
[8]  
Kung SY, 1993, DIGITAL NEURAL NETWO
[9]  
SADATI N, 1999, 26 INT C COMP IND EN
[10]  
SCHWEFEL HP, 1991, P 1 C PAR PROBL SOLV