期刊文献+

基于PCNN的迷宫最短路径求解算法 被引量:13

An algorithm for finding the shortest path of labyrinth based on PCNN model
下载PDF
导出
摘要 本文根据脉冲耦合神经网络(PCNN)并行运行的特点,提出了基于PCNN模型的迷宫最短路径搜索算法。从理论上对该算法进行了分析和讨论,并给出了具体的算法和实验结果,验证了该方法的有效性。与其他算法相比,该方法可以在最短的时间内完成最短路径的搜索。 This paper brings forward a new approach for finding the shortest path of maze based on Pulse Couple Neural Network which features parallel running. And the algorithm is analyzed and discussed theoretically. The validity of this method is proved by the experimental results. Compared with the other methods, this method can find the shortest path of maze with the minimum effort.
出处 《电路与系统学报》 CSCD 北大核心 2005年第3期72-75,共4页 Journal of Circuits and Systems
关键词 PCNN模型 迷宫 最短路径搜索 PCNN model labyrinth finding the shortest path
  • 相关文献

参考文献7

  • 1John J L, Ritter D. Observation of periodic waves in a pulse-couple neural network[J]. Opt Lett, 1993, 18(5): 1253-1255.
  • 2Kuntimad G, Ranganath H S. Perfect image segmentation using pulse couple neural networks[J]. IEEE Trans on Neural Networks, 1999, 10(3): 591-598.
  • 3Johnson J L, Padgett M L. PCNN models and application[J]. IEEE Trans on Neural Net works, 1999, 10(3): 480-498.
  • 4顾晓东,余道衡.PCNN的原理及其应用[J].电路与系统学报,2001,6(3):45-50. 被引量:42
  • 5John Caulfield H, Jason M Kinser. Finding the shortest path in the shortest time using PCNN's[J]. IEEE Trans on Neural Networks, 1999, 10(3): 604-606.
  • 6R Eckhorn, H J Reitboeck, M Arndt,P Dicke. Feature liking via synchronization among distributed assemblies: Simulations of results from cat visual cortex[J]. Neural Comput, 1990, 2(3): 293-307.
  • 7Ranganath H S, Kuntimad G. Object detection using pulse coupled neural network[J]. IEEE Trans on Neural Networks, 1999, 10(3): 615-620.

二级参考文献3

  • 1Gu Xiaodong,The 8th International Conference on Neural Information Processing,ICONIP,2001年
  • 2De Liang L Wang,IEEE Trans Neural Networks,2000年,12卷,1期,181页
  • 3Liu X,IEEE Trans Neural Networks,1999年,10卷,3期,564页

共引文献41

同被引文献86

引证文献13

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部