title: Multistate network model for the pathfinding problem with a self-recovery property.
abstract: 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.
authors.affiliation: Graduate School of Science and Engineering, University of Toyama, Toyama 930-8555, Japan. Electronic address: kueda@sci.u-toyama.ac.jp.
authors.forename: Kei-Ichi
authors.initials: K
authors.lastname: Ueda
authors.affiliation: WPI-AIMR Tohoku University, Sendai 980-8577, Japan.
authors.forename: Masaaki
authors.initials: M
authors.lastname: Yadome
authors.affiliation: WPI-AIMR Tohoku University, Sendai 980-8577, Japan.
authors.forename: Yasumasa
authors.initials: Y
authors.lastname: Nishiura
mesh_terms: D000465:Algorithms; D000818:Animals; D004625:Embryo, Nonmammalian; D006801:Humans; D008959:Models, Neurological; D016571:Neural Networks, Computer; D014981:Xenopus
keywords: Attractors; Dynamical systems; Pathfinding