DEVELOPING PROXIMITY GRAPHS BY PHYSARUM POLYCEPHALUM: DOES THE PLASMODIUM FOLLOW THE TOUSSAINT HIERARCHY?

被引:73
作者
Adamatzky, Andrew [1 ]
机构
[1] Univ West England, Dept Comp Sci, Bristol BS16 1QY, Avon, England
基金
英国工程与自然科学研究理事会;
关键词
proximity graphs; Plasmodium; parallel computing; natural computation;
D O I
10.1142/S0129626409000109
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Plasmodium of Physarum polycephalum spans sources of nutrients and constructs varieties of protoplasmic networks during its foraging behavior. When the Plasmodium is placed on a substrate populated with sources of nutrients, it spans the sources with protoplasmic network. The Plasmodium optimizes the network to deliver efficiently the nutrients to all parts of its body. How exactly does the protoplasmic network unfold during the Plasmodium's foraging behavior? What types of proximity graphs arc approximated by the network? Does the Plasmodium construct a minimal spanning tree first and then add additional protoplasmic veins to increase reliability and throughcapacity of the network? We analyze a possibility that the Plasmodium constructs a series of proximity graphs: nearest-neighbour graph (NNG), minimum spanning tree (MST), relative neighborhood graph (RNG), Gabriel graph (GG) and Delaunay triangulation (DT). The graphs can be arranged in the inclusion hierarchy (Toussaint hierarchy): NNG subset of MST subset of RNG subset of GG subset of DT. We aim to verify if graphs, where nodes are sources of nutrients and edges are protoplasmic tubes, appear in the development of the Plasmodium in the order NNG -> MST -> RNG -> GG -> DT, corresponding to inclusion of the proximity graphs.
引用
收藏
页码:105 / 127
页数:23
相关论文
共 34 条
[1]  
Adamatzky A., 2007, UNCONVENTIONAL COMPU
[2]  
Adamatzky A., 2008, INT J BIFURCATION CH
[3]  
Adamatzky A., 2005, REACTION DIFFUSION C
[4]  
Adamatzky A., 2006, UTOPIAN GENUINE UNCO
[5]  
Adamatzky A, 1991, NEURAL NETW WORLD, V6, P335
[6]   Growing spanning trees in plasmodium machines [J].
Adamatzky, Andrew .
KYBERNETES, 2008, 37 (1-2) :258-264
[7]   PHYSARUM MACHINE: IMPLEMENTATION OF A KOLMOGOROV-USPENSKY MACHINE ON A BIOLOGICAL SUBSTRATE [J].
Adamatzky, Andrew .
PARALLEL PROCESSING LETTERS, 2007, 17 (04) :455-467
[8]   INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS [J].
Akl, Selim G. .
PARALLEL PROCESSING LETTERS, 2006, 16 (01) :19-37
[9]  
[Anonymous], 2009, COMPUTATIONAL GEOMET, V19, P105
[10]  
Aono M, 2004, AIP CONF PROC, V718, P188, DOI 10.1063/1.1787323