arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1503.06973cs.ET
收藏

黏菌激发的广义排斥场沃罗诺伊图

Slime Mould Inspired Generalised Voronoi Diagrams with Repulsive Fields

Jeff Jones, Andrew Adamatzky

摘要:

巨大的单细胞变形虫生物多头绒泡菌(Physarumpolycephalum)构建了最小化的运输网络,但也可以使用两种不同的机制来近似沃罗诺伊图。在第一种方法中,Voronoi平分线由作为生成点的排斥源的预先存在的疟原虫网络的变形来表示。在第二种方法中,生成点充当生长的疟原虫的接种位点,并且Voronoi平分线由疟原虫融合之前的空区域表示。为了探索在排斥场存在下最小化网络的行为,我们利用绒泡菌的计算模型作为分布式虚拟计算材料。我们将不同类型的计算行为引起的吸引力和排斥刺激,并证明了近似沃罗诺伊图使用增长对吸引剂,避免排斥剂,和两者的组合。证明了沃罗诺伊图对点数据源、复杂平面形状和圆集的逼近。通过改变排斥剂浓度,我们发现,数据源的分区保持,但内部网络连接最小化的收缩力的传输网络。总之,我们发现,非常规的计算方法的剧目是通过增加刺激所提出的排斥领域,提出新的方法来平面划分,包装和最小化问题。

英文摘要:

The giant single-celled amoeboid organism Physarum polycephalum constructs minimising transport networks but can also approximate the Voronoi diagram using two different mechanisms. In the first method Voronoi bisectors are rep- resented by deformation of a pre-existing plasmodial network by repellent sources acting as generating points. In the second method generating points act as inoculation sites for grow- ing plasmodia and Voronoi bisectors are represented by vacant regions before the plasmodia fuse. To explore the behaviour of minimising networks in the presence of repulsion fields we utilise a computational model of Physarum as a distributed virtual computing material. We characterise the different types of computational behaviours elicited by attraction and repulsion stimuli and demonstrate the approximation Voronoi diagrams using growth towards attractants, avoidance of repellents, and combinations of both. Approximation of Voronoi diagrams for point data sources, complex planar shapes and circle sets is demonstrated. By altering repellent con- centration we found that partition of data sources was maintained but the internal network connectivity was minimised by the contractile force of the transport network. To conclude, we find that the repertoire of unconventional computation methods is enhanced by the addition of stimuli presented by repellent fields, suggesting novel approaches to plane-division, packing, and minimisation problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑