Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism

Liping Zhu, Song Ju Kim, Masahiko Hara, Masashi Aono

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Choosing a better move correctly and quickly is a fundamental skill of living organisms that corresponds to solving a computationally demanding problem. A unicellular plasmodium of Physarum polycephalum searches for a solution to the travelling salesman problem (TSP) by changing its shape to minimize the risk of being exposed to aversive light stimuli. In our previous studies, we reported the results on the eight-city TSP solution. In this study, we show that the time taken by plasmodium to find a reasonably high-quality TSP solution grows linearly as the problem size increases from four to eight. Interestingly, the quality of the solution does not degrade despite the explosive expansion of the search space. Formulating a computational model, we show that the linear-time solution can be achieved if the intrinsic dynamics could allocate intracellular resources to grow the plasmodium terminals with a constant rate, even while responding to the stimuli. These results may lead to the development of novel analogue computers enabling approximate solutions of complex optimization problems in linear time.

Original languageEnglish
Article number180396
JournalRoyal Society Open Science
Volume5
Issue number12
DOIs
Publication statusPublished - 2018 Dec 1

Fingerprint

Traveling salesman problem
Analog computers

Keywords

  • Amoeba computing
  • Bioinspired computing
  • Natural computing
  • Physarum
  • Travelling salesman problem

ASJC Scopus subject areas

  • General

Cite this

Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism. / Zhu, Liping; Kim, Song Ju; Hara, Masahiko; Aono, Masashi.

In: Royal Society Open Science, Vol. 5, No. 12, 180396, 01.12.2018.

Research output: Contribution to journalArticle

@article{63544b414144454da891cba5df308280,
title = "Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism",
abstract = "Choosing a better move correctly and quickly is a fundamental skill of living organisms that corresponds to solving a computationally demanding problem. A unicellular plasmodium of Physarum polycephalum searches for a solution to the travelling salesman problem (TSP) by changing its shape to minimize the risk of being exposed to aversive light stimuli. In our previous studies, we reported the results on the eight-city TSP solution. In this study, we show that the time taken by plasmodium to find a reasonably high-quality TSP solution grows linearly as the problem size increases from four to eight. Interestingly, the quality of the solution does not degrade despite the explosive expansion of the search space. Formulating a computational model, we show that the linear-time solution can be achieved if the intrinsic dynamics could allocate intracellular resources to grow the plasmodium terminals with a constant rate, even while responding to the stimuli. These results may lead to the development of novel analogue computers enabling approximate solutions of complex optimization problems in linear time.",
keywords = "Amoeba computing, Bioinspired computing, Natural computing, Physarum, Travelling salesman problem",
author = "Liping Zhu and Kim, {Song Ju} and Masahiko Hara and Masashi Aono",
year = "2018",
month = "12",
day = "1",
doi = "10.1098/rsos.180396",
language = "English",
volume = "5",
journal = "Royal Society Open Science",
issn = "2054-5703",
publisher = "The Royal Society",
number = "12",

}

TY - JOUR

T1 - Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism

AU - Zhu, Liping

AU - Kim, Song Ju

AU - Hara, Masahiko

AU - Aono, Masashi

PY - 2018/12/1

Y1 - 2018/12/1

N2 - Choosing a better move correctly and quickly is a fundamental skill of living organisms that corresponds to solving a computationally demanding problem. A unicellular plasmodium of Physarum polycephalum searches for a solution to the travelling salesman problem (TSP) by changing its shape to minimize the risk of being exposed to aversive light stimuli. In our previous studies, we reported the results on the eight-city TSP solution. In this study, we show that the time taken by plasmodium to find a reasonably high-quality TSP solution grows linearly as the problem size increases from four to eight. Interestingly, the quality of the solution does not degrade despite the explosive expansion of the search space. Formulating a computational model, we show that the linear-time solution can be achieved if the intrinsic dynamics could allocate intracellular resources to grow the plasmodium terminals with a constant rate, even while responding to the stimuli. These results may lead to the development of novel analogue computers enabling approximate solutions of complex optimization problems in linear time.

AB - Choosing a better move correctly and quickly is a fundamental skill of living organisms that corresponds to solving a computationally demanding problem. A unicellular plasmodium of Physarum polycephalum searches for a solution to the travelling salesman problem (TSP) by changing its shape to minimize the risk of being exposed to aversive light stimuli. In our previous studies, we reported the results on the eight-city TSP solution. In this study, we show that the time taken by plasmodium to find a reasonably high-quality TSP solution grows linearly as the problem size increases from four to eight. Interestingly, the quality of the solution does not degrade despite the explosive expansion of the search space. Formulating a computational model, we show that the linear-time solution can be achieved if the intrinsic dynamics could allocate intracellular resources to grow the plasmodium terminals with a constant rate, even while responding to the stimuli. These results may lead to the development of novel analogue computers enabling approximate solutions of complex optimization problems in linear time.

KW - Amoeba computing

KW - Bioinspired computing

KW - Natural computing

KW - Physarum

KW - Travelling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85059684764&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059684764&partnerID=8YFLogxK

U2 - 10.1098/rsos.180396

DO - 10.1098/rsos.180396

M3 - Article

VL - 5

JO - Royal Society Open Science

JF - Royal Society Open Science

SN - 2054-5703

IS - 12

M1 - 180396

ER -