抄録
In this study, we propose a continuous model for a pathfinding system. We consider acyclic graphs whose vertices are connected by unidirectional edges. The proposed model autonomously finds a path connecting two specified vertices, and the path is represented by a stable solution of the proposed model. The system has a self-recovery property, i.e., the system can find a path when one of the connections in the existing path is suddenly terminated. Further, we demonstrate that the appropriate installation of inhibitory interaction improves the search time.
本文言語 | 英語 |
---|---|
ページ(範囲) | 32-38 |
ページ数 | 7 |
ジャーナル | Neural Networks |
巻 | 62 |
DOI | |
出版ステータス | 出版済み - 2015/02/01 |
ASJC Scopus 主題領域
- 認知神経科学
- 人工知能