| 基于PCNN的迷宫最短路径求解算法 |
| |
| 引用本文： | 宋寅卯,袁端磊. 基于PCNN的迷宫最短路径求解算法[J]. 电路与系统学报, 2005, 10(3): 72-75 |
| |
| 作者姓名： | 宋寅卯 袁端磊 |
| |
| 作者单位： | 郑州轻工业学院,电气信息工程学院,河南,郑州,450002 |
| |
| 摘 要： | 本文根据脉冲耦合神经网络(PCNN)并行运行的特点,提出了基于PCNN模型的迷宫最短路径搜索算法。从理论上对该算法进行了分析和讨论,并给出了具体的算法和实验结果,验证了该方法的有效性。与其他算法相比,该方法可以在最短的时间内完成最短路径的搜索。
|
| 关 键 词： | PCNN模型 迷宫 最短路径搜索 |
| 文章编号： | 1007-0249(2005)03-0072-04 |
| 修稿时间： | 2004-11-02 |
An algorithm for finding the shortest path of labyrinth based on PCNN model |
| |
| SONG Yin-mao,YUAN Duan-lei. An algorithm for finding the shortest path of labyrinth based on PCNN model[J]. Journal of Circuits and Systems, 2005, 10(3): 72-75 |
| |
| Authors: | SONG Yin-mao YUAN Duan-lei |
| |
| Abstract: | 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. |
| |
| Keywords: | PCNN model labyrinth finding the shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
