Communication and complexity in a GRN-based multicellular system for graph colouring.
Artificial Genetic Regulatory Networks (GRNs) are interesting control models through their simplicity and versatility. They can be easily implemented, evolved and modified, and their similarity to their biological counterparts makes them interesting for simulations of life-like systems as well. These aspects suggest they may be perfect control systems for distributed computing in diverse situations, but to be usable for such applications the computational power and evolvability of GRNs need to be studied. In this research we propose a simple distributed system implementing GRNs to solve the well known NP-complete graph colouring problem. Every node (cell) of the graph to be coloured is controlled by an instance of the same GRN. All the cells communicate directly with their immediate neighbours in the graph so as to set up a good colouring. The quality of this colouring directs the evolution of the GRNs using a genetic algorithm. We then observe the quality of the colouring for two different graphs according to different communication protocols and the number of different proteins in the cell (a measure for the possible complexity of a GRN). Those two points, being the main scalability issues that any computational paradigm raises, will then be discussed.
Buck
Moritz
M
Centre for Computer Science & Informatics Research, University of Hertfordshire, Hatfield, Hertfordshire, United Kingdom. M.Buck@herts.ac.uk
Nehaniv
Chrystopher L
CL
D000465:Algorithms; D001185:Artificial Intelligence; D019295:Computational Biology / Q000379:methods*; D003196:Computer Graphics; D053263:Gene Regulatory Networks; D008962:Models, Theoretical