Physarum can compute shortest paths

Journal of Theoretical Biology

Volumn 309, Issue , 2012, Pages 121-133

  Bonifaci, Vincenzo ^a,b   Mehlhorn, Kurt ^b   Varma, Girish ^b,c  

^a CNR   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Natural adaptive networks; Natural algorithm; Slime mold

Indexed keywords

ALGORITHM; FEEDBACK MECHANISM; NUMERICAL MODEL; SLIME MOULD;

ADAPTATION; ALGORITHM; ARTICLE; EVOLUTION; FEEDBACK SYSTEM; FORAGING; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; MOULD; NATURAL ALGORITHM; PHYSARUM POLYCEPHALUM; PRIORITY JOURNAL; SHORTEST PATH PROBLEM;

MODELS, BIOLOGICAL; MOVEMENT; PHYSARUM POLYCEPHALUM;

PHYSARUM; PHYSARUM POLYCEPHALUM;

EID: 84863442482     PISSN: 00225193     EISSN: 10958541     Source Type: Journal    
DOI: 10.1016/j.jtbi.2012.06.017     Document Type: Article

References (17)

1. Adamatzky A. Physarum Machines: Computers from Slime Mold 2010, World Scientific, Singapore.
2. Baldauf S.L., Doolittle W.F. Origin and evolution of the slime molds (Mycetozoa). Proc. Natl. Acad. Sci. USA 1997, 94:12007-12012.
3. Bollobás B. Modern Graph Theory 1998, Springer, New York.
4. Bonifaci, V., Mehlhorn, K., Varma, G., 2011. Physarum can compute shortest paths, (October 2011). http://arXiv:1106.0423v3.
5. Chazelle B. Natural algorithms. Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms 2009, SIAM, Philadelphia, PA. C. Mathieu (Ed.).
6. Clarke F., Ledyaev Y., Stern R., Wolenski P. Nonsmooth Analysis and Control Theory 1998, Springer, New York.
7. Hirsch M.W., Smale S. Differential Equations, Dynamical Systems, and Linear Algebra 1974, Academic Press, San Diego.
8. Ito, K., Johansson, A., Nakagaki, T., Tero, A., 2011. Convergence properties for the Physarum solver, (January 2011). http://arXiv:1101.5249v1.
9. Kirby B.J. Micro- and Nanoscale Fluid Mechanics: Transport in Microfluidic Devices 2010, Cambridge University Press, Cambridge.
10. Mäkelä M.M., Neittanmäki P. Nonsmooth Optimization 1992, World Scientific, Singapore.
11. Miyaji T., Ohnishi I. Mathematical analysis to an adaptive network of the plasmodium system. Hokkaido Math. J. 2007, 36:445-465.
12. Miyaji T., Ohnishi I. Physarum can solve the shortest path problem on Riemannian surface mathematically rigourously. Intern. J. Pure Appl. Math. 2008, 47:353-369.
13. Nakagaki T., Tero A., Kobayashi R., Ohnishi I., Miyaji T. Computational ability of cells based on cell dynamics and adaptability. New Gener. Comput. 2009, 27:57-81.
14. Nakagaki T., Yamada H., Tóth A. Maze-solving by an amoeboid organism. Nature 2000, 407:470.
15. Tero A., Kobayashi R., Nakagaki T. A mathematical model for adaptive transport network in path finding by true slime mold. J. Theor. Biol. 2007, 244:553-564.
16. Tero A., Takagi S., Saigusa T., Ito K., Bebber D., Fricker M., Yumiki K., Kobayashi R., Nakagaki T. Rules for biologically inspired adaptive network design. Science 2010, 327:439-442.
17. 〈〉, 2010. http://www.youtube.com/watch?v=tLO2n3YMcXw&t=4m43s.