Evolving transport networks with cellular automata models inspired by slime mould

IEEE Transactions on Cybernetics

Volumn 45, Issue 9, 2015, Pages 1887-1899

  Tsompanas, Michail Antisthenis I ^a   Sirakoulis, Georgios Ch ^a   Adamatzky, Andrew I ^b  

^a DEMOCRITUS UNIVERSITY OF THRACE   (Greece)

^b UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Cellular automata (CA); evolution; modeling; Physarum polycephalum; transport networks; tubular networks

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; BIOLOGY; CELLULAR AUTOMATA; COMPUTATIONAL GEOMETRY; GRAPH THEORY; MODELS; MOLDS; SUBSTRATES;

BIO-INSPIRED COMPUTING; BIOLOGICAL EXPERIMENTS; CELLULAR AUTOMATA MODELS; EVOLUTION; EXPERIMENTAL LABORATORY; PHYSARUM POLYCEPHALUM; TRANSPORT NETWORKS; TUBULAR NETWORKS;

PROBLEM SOLVING;

BIOLOGICAL MODEL; BIOLOGY; PHYSARUM POLYCEPHALUM; PHYSIOLOGY; TRANSPORT AT THE CELLULAR LEVEL;

BIOLOGICAL TRANSPORT; COMPUTATIONAL BIOLOGY; MODELS, BIOLOGICAL; PHYSARUM POLYCEPHALUM;

EID: 84939795143     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCYB.2014.2361731     Document Type: Article

References (47)

1. L. Liu, Y. Song, H. Ma, and X. Zhang, "Physarum optimization: A biology-inspired algorithm for minimal exposure path problem in wireless sensor networks, " in Proc. IEEE INFOCOM, Orlando, FL, USA, 2012, pp. 1296-1304
2. Y. Song, L. Liu, and H. Ma, "A physarum-inspired algorithm for minimal exposure problem in wireless sensor networks, " in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Shanghai, China, 2012, pp. 2151-2156
3. A. Kurz, "Constructing maps for mobile robot navigation based on ultrasonic range data, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 2, pp. 233-242, Apr. 1996
4. R. Araujo and A. T. De Almeida, "Learning sensor-based navigation of a real mobile robot in unknown worlds, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 29, no. 2, pp. 164-178, Apr. 1999
5. S. S. Ge, L. Xuecheng, and A. A. Mamun, "Boundary following and globally convergent path planning using instant goals, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 35, no. 2, pp. 240-254, Apr. 2005
6. A. R. Willms and S. X. Yang, "An efficient dynamic system for realtime robot-path planning, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 4, pp. 755-766, Aug. 2006
7. C. Ye, "Navigating a mobile robot by a traversability field histogram, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 2, pp. 361-372, Apr. 2007
8. A. R. Willms and S. X. Yang, "Real-time robot path planning via a distance-propagating dynamic system with obstacle clearance, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 3, pp. 884-893, Jun. 2008
9. W. Zeng, W. Zong, and C. Xiong, "Performance optimization for wireless network of ultra wideband, " in Proc. 4th Int. Conf. Comput. Inf. Sci. (ICCIS), Chongqing, China, 2012, pp. 1100-1103
10. J. F. Leng and W. Zeng, "An improved shortest path algorithm for computing one-to-one shortest paths on road networks, " in Proc. 1st Int. Conf. Inf. Sci. Eng. (ICISE), Nanjing, China, 2009, pp. 1979-1982
11. W. Bechkit et al., "A new weighted shortest path tree for converge cast traffic routing in WSN, " in Proc. IEEE Symp. Comput. Commun. (ISCC), Cappadocia, Italy, 2012, pp. 000187-000192
12. S. Zhu and G. M. Huang, "A new parallel and distributed shortest path algorithm for hierarchically clustered data networks, " IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 9, pp. 841-855, Sep. 1998
13. X. Yuan and A. Saifee, "Path selection methods for localized quality of service routing, " in Proc. 10th Int. Conf. Comput. Commun. Netw., Scottsdale, AZ, USA, 2001, pp. 102-107
14. M. Saad and Z.-Q. Luo, "Design of WDM networks under economy of scale pricing and shortest path routing, " IEEE J. Sel. Areas Commun., vol. 24, no. 4, pp. 1-36, Apr. 2006
15. S. Misra and B. J. Oommen, "Dynamic algorithms for the shortest path routing problem: Learning automata-based solutions, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 35, no. 6, pp. 1179-1192, Dec. 2005
16. A. I. Adamatzky, "Computation of shortest path in cellular automata, " Math. Comput. Model., vol. 23, no. 4, pp. 105-113, 1996
17. C. W. Ahn and R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations, " IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 566-579, Dec. 2002
18. A. W. Mohemmed, N. C. Sahoo, and T. K. Geok, "A new particle swarm optimization based algorithm for solving shortest-paths tree problem, " in Proc. IEEE Congr. Evol. Comput. (CEC), Singapore, 2007, pp. 3221-3225
19. W.-L. Zhong, J. Huang, and J. Zhang, "A novel particle swarm optimization for the Steiner tree problem in graphs, " in Proc. IEEE Congr. Evol. Comput. (CEC), Hong Kong, 2008, pp. 2460-2467
20. A. Adamatzky, "Slime mould solves maze in one pass, assisted by gradient of chemo-attractants, " IEEE Trans. Nanobiosci., vol. 11, no. 2, pp. 131-134, Jun. 2012
21. T. Nakagaki, H. Yamada, and A. ToÍth, "Intelligence: Maze-solving by an amoeboid organism, " Nature, vol. 407, no. 6803, p. 470, 2000
22. A. Tero, R. Kobayashi, and T. Nakagaki, "A mathematical model for adaptive transport network in path finding by true slime mold, " J. Theor. Biol., vol. 244, no. 4, p. 553, 2007
23. A. Adamatzky, Physarum Machines. Singapore: World Scientific, 2010
24. A. Adamatzky, Ed., Bio-Evaluation of World Transport Networks. Singapore: World Scientific, 2012
25. M. Aono and M. Hara, "Amoeba-based nonequilibrium neurocomputer utilizing fluctuations and instability, " in Unconventional Computation (Lecture Notes in Computer Science), vol. 4618, S. Akl, C. Calude, M. Dinneen, G. Rozenberg, and H. Wareham, Eds. Berlin, Germany: Springer, 2007, pp. 41-54
26. A. Adamatzky, "Growing spanning trees in plasmodium machines, " Kybernetes, vol. 37, no. 2, pp. 258-264, 2008
27. S. Tsuda, M. Aono, and Y.-P. Gunji, "Robust and emergent Physarum logical-computing, " Biosystems, vol. 73, no. 1, pp. 45-55, 2004
28. A. Schumann and A. Adamatzky, "Physarum spatial logic, " New Math. Nat. Comput., vol. 7, pp. 483-498, Jan. 2011
29. S. Tsuda, K. Zauner, and Y. Gunji, "Robot control with biological cells, " Biosystems, vol. 87, pp. 215-223, Feb. 2007
30. A. Ishiguro, M. Shimizu, and T. Kawakatsu, "A modular robot that exhibits amoebic locomotion, " Robot. Auton. Syst., vol. 54, pp. 641-650, Aug. 2006
31. Y. Zhao, H. L. Wei, and S. A. Billings, "A new adaptive fast cellular automaton neighborhood detection and rule identification algorithm, " IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 42, no. 4, pp. 1283-1287, Aug. 2012
32. J. Jones, "Approximating the behaviours of Physarum polycephalum for the construction and minimisation of synthetic transport networks, " in Unconventional Computation (Lecture Notes in Computer Science), vol. 5715, C. Calude, J. Costa, N. Dershowitz, E. Freire, and G. Rozenberg, Eds. Berlin, Germany: Springer, 2009, pp. 191-208
33. Y. P. Gunji, T. Shirakawa, T. Niizato, and T. Haruna, "Minimal model of a cell connecting amoebic motion and adaptive transport networks, " J. Theor. Biol., vol. 253, pp. 659-667, Aug. 2008
34. M.-A. I. Tsompanas and G. Ch. Sirakoulis, "Modeling and hardware implementation of an amoeba-like cellular automaton, " Bioinspir. Biomim., vol. 7, no. 3, p. 036013, 2012
35. A. Adamatzky, "Developing proximity graphs by Physarum polycephalum: Does the plasmodium follow the Toussaint hierarchy?" Parallel Process. Lett., vol. 19, no. 1, pp. 105-127, 2009
36. A. Adamatzky, "If BZ medium did spanning trees these would be the same trees as Physarum built, " Phys. Lett. A, vol. 373, no. 10, pp. 952-956, 2009
37. A. Adamatzky and S. G. Akl, "Trans-Canada slimeways: Slime mould imitates the Canadian transport network, " Int. J. Nat. Comput. Res. (IJNCR), vol. 2, no. 4, pp. 31-46, 2011
38. A. I. Adamatzky, "Route 20, autobahn 7, and slime mold: Approximating the longest roads in USA and Germany with slime mold on 3-D terrains, " IEEE Trans. Cybern., vol. 44, no. 1, pp. 126-136, Jan. 2014
39. J. Crank, The Mathematics of Diffusion. Oxford, U.K.: Clarendon Press, 1956
40. A. Adamatzky, G. J. MartIÍnez, S. V. Chapa-Vergara, R. Asomoza-Palacio, and C. R. Stephens, "Approximating Mexican highways with slime mould, " Nat. Comput., vol. 10, no. 3, pp. 1195-1214, Sep. 2011
41. A. Adamatzky and R. Alonso-Sanz, "Rebuilding Iberian motorways with slime mould, " Biosystems, vol. 105, no. 1, pp. 89-100, 2011
42. G. T. Toussaint, "The relative neighborhood graph of a finite planar set, " Pattern Recognit., vol. 12, no. 4, pp. 261-268, 1980
43. G. T. Toussaint, "Some unsolved problems on proximity graphs, " in Proc. 1st Workshop Proximity Graphs, Las Cruces, NM, USA, Dec. 1989. [Online]. Available: http://cgm.cs.mcgill.ca/~godfried/publications/openprox.pdf
44. J. W. Jaromczyk and G. T. Toussaint, "Relative neighborhood graphs and their relatives, " Proc. IEEE, vol. 80, no. 9, pp. 1502-1517, Sep. 1992
45. A. Adamatzky and J. Jones, "Road planning with slime mould: If Physarum built motorways it would route M6/M74 through newcastle, " Int. J. Bifurcat. Chaos, vol. 20, no. 10, pp. 3065-3084, 2010
46. A. Adamatzky and T. Schubert, "Schlauschleimer in Reichsautobahnen: Slime mould imitates motorway network in Germany, " Kybernetes, vol. 41, no. 7, pp. 1050-1071, 2012
47. A. Adamatzky et al., "Are motorways rational from slime moulds point of view?" Int. J. Parallel Emerg. Distrib. Syst., vol. 28, no. 3, pp. 230-248, 2013