50 research outputs found
Slime mould computes planar shapes
Computing a polygon defining a set of planar points is a classical problem of
modern computational geometry. In laboratory experiments we demonstrate that a
concave hull, a connected alpha-shape without holes, of a finite planar set is
approximated by slime mould Physarum polycephalum. We represent planar points
with sources of long-distance attractants and short-distance repellents and
inoculate a piece of plasmodium outside the data set. The plasmodium moves
towards the data and envelops it by pronounced protoplasmic tubes
Computers from plants we never made. Speculations
We discuss possible designs and prototypes of computing systems that could be
based on morphological development of roots, interaction of roots, and analog
electrical computation with plants, and plant-derived electronic components. In
morphological plant processors data are represented by initial configuration of
roots and configurations of sources of attractants and repellents; results of
computation are represented by topology of the roots' network. Computation is
implemented by the roots following gradients of attractants and repellents, as
well as interacting with each other. Problems solvable by plant roots, in
principle, include shortest-path, minimum spanning tree, Voronoi diagram,
-shapes, convex subdivision of concave polygons. Electrical properties
of plants can be modified by loading the plants with functional nanoparticles
or coating parts of plants of conductive polymers. Thus, we are in position to
make living variable resistors, capacitors, operational amplifiers,
multipliers, potentiometers and fixed-function generators. The electrically
modified plants can implement summation, integration with respect to time,
inversion, multiplication, exponentiation, logarithm, division. Mathematical
and engineering problems to be solved can be represented in plant root networks
of resistive or reaction elements. Developments in plant-based computing
architectures will trigger emergence of a unique community of biologists,
electronic engineering and computer scientists working together to produce
living electronic devices which future green computers will be made of.Comment: The chapter will be published in "Inspired by Nature. Computing
inspired by physics, chemistry and biology. Essays presented to Julian Miller
on the occasion of his 60th birthday", Editors: Susan Stepney and Andrew
Adamatzky (Springer, 2017
Routing Physarum with electrical flow/current
Plasmodium stage of Physarum polycephalum behaves as a distributed dynamical
pattern formation mechanism who's foraging and migration is influenced by local
stimuli from a wide range of attractants and repellents. Complex protoplasmic
tube network structures are formed as a result, which serve as efficient
`circuits' by which nutrients are distributed to all parts of the organism. We
investigate whether this `bottom-up' circuit routing method may be harnessed in
a controllable manner as a possible alternative to conventional template-based
circuit design. We interfaced the plasmodium of Physarum polycephalum to the
planar surface of the spatially represented computing device, (Mills' Extended
Analog Computer, or EAC), implemented as a sheet of analog computing material
whose behaviour is input and read by a regular 5x5 array of electrodes. We
presented a pattern of current distribution to the array and found that we were
able to select the directional migration of the plasmodium growth front by
exploiting plasmodium electro-taxis towards current sinks. We utilised this
directional guidance phenomenon to route the plasmodium across its habitat and
were able to guide the migration around obstacles represented by repellent
current sources. We replicated these findings in a collective particle model of
Physarum polycephalum which suggests further methods to orient, route, confine
and release the plasmodium using spatial patterns of current sources and sinks.
These findings demonstrate proof of concept in the low-level dynamical routing
for biologically implemented circuit design
Physarum machines for space missions
A Physarum machine is a programmable amorphous biological computer experimentally implemented in plasmodium Physarum polycephalum. We overview a range of tasks solvable by Physarum machines and speculate on how the Physarum machines could be used in future space missions
Cellular Automata Applications in Shortest Path Problem
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 201