Towards a Stationary Monge-Kantorovich Dynamics: The Physarum Polycephalum Experience

In this work we propose an extension to the continuous setting of a model describing the dynamics of slime mold, Physarum Polycephalum (PP), which was proposed to simulate the ability of PP to find the shortest path connecting two food sources in a maze. The original model describes the dynamics of the slime mold on a finite-dimensional planar graph using a pipe-flow analogy whereby mass transfer occurs because of pressure differences with a conductivity coefficient that varies with the flow intensity. This model has been shown to be equivalent to a problem of “optimal transportation” on graphs. We propose an extension that abandons the graph structure and moves to a continuous domain. The new model couples an elliptic diffusion equation enforcing PP density balance with an ordinary differential equation governing the flow dynamics. We conjecture that the new system of equations presents a time-asymptotic equilibrium and that such an equilibrium point is precisely the solution of Monge--Kantorovich partia...

[1]  Eugene Stepanov,et al.  On Regularity of Transport Density in the Monge--Kantorovich Problem , 2003, SIAM J. Control. Optim..

[2]  Luigi De Pascale,et al.  Sharp summability for Monge Transport density via Interpolation , 2004 .

[3]  R. McCann,et al.  Uniqueness and transport density in Monge's mass transportation problem , 2002 .

[4]  Andrew Adamatzky Reconfiguring Physarum machines with attractants , 2010 .

[5]  Andrew Adamatzky,et al.  Physarum Machines: Computers from Slime Mould , 2010 .

[6]  G. Mingione,et al.  Bounded Minimisers of Double Phase Variational Integrals , 2015 .

[7]  G. M. Troianiello,et al.  Elliptic Differential Equations and Obstacle Problems , 1987 .

[8]  C. B. Morrey Second Order Elliptic Systems of Differential Equations. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[9]  L. Ambrosio Lecture Notes on Optimal Transport Problems , 2003 .

[10]  John Michael Rassias,et al.  Lecture Notes on Mixed Type Partial Differential Equations , 1990 .

[11]  Kurt Mehlhorn,et al.  Physarum can compute shortest paths , 2011, SODA.

[12]  A. Tero,et al.  Rules for Biologically Inspired Adaptive Network Design , 2010, Science.

[13]  J. Barrett,et al.  A MIXED FORMULATION OF THE MONGE-KANTOROVICH EQUATIONS , 2007 .

[14]  Pierre Seppecher,et al.  Mathématiques/Mathematics Shape optimization solutions via Monge-Kantorovich equation , 1997 .

[15]  Pavel B. Bochev,et al.  On the Finite Element Solution of the Pure Neumann Problem , 2005, SIAM Rev..

[16]  L. Evans,et al.  Differential equations methods for the Monge-Kantorovich mass transfer problem , 1999 .

[17]  M. Giaquinta,et al.  An Introduction to the Regularity Theory for Elliptic Systems, Harmonic Maps and Minimal Graphs , 2005 .

[18]  A. Tero,et al.  A mathematical model for adaptive transport network in path finding by true slime mold. , 2007, Journal of theoretical biology.

[19]  T. Nakagaki,et al.  Intelligence: Maze-solving by an amoeboid organism , 2000, Nature.

[20]  S. Campanato Equazioni ellittiche del IIo ordine e spazi $$\mathfrak{L}^{(2,\lambda )} $$ . , 1965 .

[21]  Michel Fortin,et al.  Mixed and Hybrid Finite Element Methods , 2011, Springer Series in Computational Mathematics.