Growing spanning trees in plasmodium machines

被引:23
作者
Adamatzky, Andrew [1 ]
机构
[1] Univ W England, Fac Comp Engn & Math Sci, Bristol BS16 1QY, Avon, England
关键词
cybernetics; nature inspired computing; proximity graphs; plasmodium;
D O I
10.1108/03684920810851168
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Purpose - The purpose of this paper is to address the novel issues of executing graph optimization tasks on distributed simple growing biological systems. Design/methodology/approach - The author utilizes biological and physical processes to implement non-classical, and in principle more powerful, computing devices. The author experimentally verifies his previously discovered techniques on approximating spanning trees during single cell ontogeny. Plasmodium, a vegetative stage of slime mold Physarum polycephalum, is used as experimental computing substrate to approximate spanning trees. Points of given data set are represented by positions of nutrient sources, then a plasmodium is placed on one of the data points. Plasmodium develops and span all sources of nutrients, connecting them by protoplasmic strands. The protoplasmic strands represent edges of the computed spanning tree. Findings - Offers experimental implementation of plasmodium devices for approximation of spanning tree. Practical implications - The techniques, discussed in the paper, can be used in design and development of soft bodied robotic devices, including gel-based robots, reconfigurable massively robots, and hybrid wet-hardware robots. Originality/value - Discusses original ideas on growing spanning trees, and provide innovative experimental implementation.
引用
收藏
页码:258 / 264
页数:7
相关论文
共 26 条
[1]  
ADAMDTZKY A, 2001, COMPUTING NONLINEAR
[2]  
ADARNATZKY A, 2005, REACTION DIFFUSION C
[3]  
AHUJA M, 1989, P INT C DISTR COMP S, P2
[4]   ARE THE PREFERENCE AXIOMS REALLY RATIONAL [J].
ANAND, P .
THEORY AND DECISION, 1987, 23 (02) :189-214
[5]  
[Anonymous], NEURAL NETWORK WORLD
[6]  
Aono M, 2004, AIP CONF PROC, V718, P188, DOI 10.1063/1.1787323
[7]  
AONO M, 2001, COMP ANT SYST AIP C, V718, P177
[8]  
CHONG F, 1993, 14 MIT
[9]  
Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[10]   A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].
GALLAGER, RG ;
HUMBLET, PA ;
SPIRA, PM .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77