Voronoi-like nondeterministic partition of a lattice by collectives of finite automata

Mathematical and Computer Modelling

Volumn 28, Issue 10, 1998, Pages 73-93

  Adamatzky, A ^a   Holland, O ^a  

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

Author keywords

Ant algorithms; Collectives of automata; Parallel computing; Swarm systems; Voronoi diagram

Indexed keywords

EID: 0032414278     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(98)00156-3     Document Type: Article

References (57)

1. 1. M.L. Tsetlin, On the behaviour of finite automata in random media, Automatika i Telemekhanika (In Russian) 32, 1345-1354, (1961).
2. 2. M.L. Tsetlin and V.Yu. Krylov, Examples of automata games (In Russian), DAN SSSR 149, 284-287, (1963).
3. 3. V.L. Stefanyuk, An example of collective of two automata, Automation and Remote Control 24, 781-784, (1963).
4. nd IJCAI, London, (1971).
5. 5. V.L. Stefanyuk, On mutual assistance in the collective of radiostations, Information Transmission Problems 7, 103-107, (1971).
6. 6. V.Yu. Krylov and M.L. Tsetlin, On automata games (In Russian), Automatika i Telemekhanika 24, 975-987, (1963).
7. 7. V.L. Stefanyuk, From multi-agent systems to collective behaviour, In Proc. of the Int. Workshop Distributed Artificial Intelligence and Multi-Agent Systems, St. Petersburg, Russia, 1997, 223-224, 327-338, (1997).
8. 8. M.L. Tsetlin, Automata Theory and Modelling of Biological Systems, Academic Press, New York, (1973).
9. 9. S. Cook and C. Rackoff, Space lower bounds for maze threadability on restricted machines, SIAM J. Comput. 9, 636-652, (1980).
10. 10. A. Colorni, M. Dorigo and V. Maniezzo, Distributed optimization by ant colonies, In Proc. of Europ. Conf. on Artificial Life., (Edited by F. Varela and P. Bourgine), pp. 134-142, (1991).
11. 11. S. Appleby and S. Steward, Mobile agents for control in telecommunications networks, British Telecom Technology Journal 12, 104-113, (1994).
12. st Int. Conf. On Autonomous Agents, Marina del Rey, U.S.A., pp. 209-216, (1997).
13. 13. R. Schoonderwoerd, O. Holland, J. Bruten and L. Rothkratz, Ant-based load balancing in telecommunication networks, Adaptive Behaviour 5, 169-207, (1996).
14. 14. M. Dorigo, V. Maniezzo and A. Colorni, The ant system: Optimization by a colony of cooperating agents, IEEE Trans. Syst. Man Cybern. 26, 1-13, (1996).
15. th Int. Conf. on Machine Learning, 252-260, (1995).
16. 16. A. Adamatzky and O. Holland, Approximation of spanning trees by natural computation using swarm systems and cellular automata, (submitted).
17. 17. A. Adamatzky and O. Holland, Swarm intelligence: Representations and algorithms, In Proc. Int. Workshop on Distributed Artificial Intelligence and Multi-Agent Systems, St. Petersburg, Russia, 1997, pp. 13-22, (1997).
18. 18. A.I. Adamatzky, Constructing a discrete generalized Voronoi diagram in reaction-diffusion media, Neural Networks World 6, 635-643, (1994).
19. 19. A. Adamatzky, Identification of Cellular Automata, Taylor and Francis, London, (1994).
20. 20. A. Adamatzky, Local parallel algorithms for computation of Voronoi diagram (Russian), Elektronnoe Modelirovanie 14, 26-28, (1992).
21. 21. A. Adamatzky, Voronoi-like partition of lattice in cellular automata, Mathl. Comput. Modelling 23 (4), 51-66, (1996).
22. th Int. Workshop on the Synthesis and Stimulation of Living Systems, (Edited by R.A. Brooks and P. Maes), MIT Press, p. 181-189, (1994).
23. st Annual ACM Symp. Theory of Computing, p. 375-381, (1989).
24. 24. P. Beam, A. Borodin, P. Raghavan, W.L. Ruzzo and M. Tompa, Time-space tradeoff for undirected graph traversal by graph automata, Information and Computation 130, 101-129, (1996).
25. 25. D. Tolmachiev and A. Adamatzky, Chemical processor for approximation of Voronoi diagram, Adv. Material Optics Electr. 6, 191-196, (1996).
26. 26. P. Tzionas, A. Thanailakis and Ph. Tsalides, An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture, Image and Vision Computing 15, 35-45, (1997).
27. 1 and L∞ norms, Mathl. Comput. Modelling 26 (4), 71-78, (1997).
28. 28. W.J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comp. Syst. Sci. 4, 177-192, (1970).
29. 29. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8, 189-202, (1979).
30. 30. L. Zanietti, The incomplete Voronoi diagram and percolation analysis, Physics Letters A 189, 167-178, (1994).
31. 31. J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6, 675-695, (1977).
32. 32. A. Adamatzky, Identification of fuzzy cellular automata, (In Russian), Automatika i Vychislitel'naya Tekhnika 6, 75-80, (1991).
33. 33. A.I. Adamatzky, Hierarchy of fuzzy cellular automata, Fuzzy Sets and Systems 62 (2), 167-174, (1994).
34. 34. T. Yang and L.B. Yang, The global stability of fuzzy cellular neural network, IEEE Trans. Circuit and Systems. I. Fundamental Theory and Appl. 43, 880-883, (1996).
35. 35. S. Baglio, L. Fortuna, G. Giudice and G. Manganaro, Fuzzy cellular systems for a new computational paradigm, Engineering Appl. of Artif. Intell. 10, 47-52, (1997).
36. 36. I. Pyatetski-Shapiro, O. Stavskaya and A. Toom, On the homogeneous neural networks (In Russian), Automatika i Telemekhanika 6, 123-128, (1969).
37. 37. A. Toom, Nonergodic homogeneous random media (In Russian), Veroyatnostnye Metody Issledovania 41, 43-51, (1972).
38. 38. A. Toom, Nonergodicity of multi-dimensional automata systems (In Russian), Problemy Peredachi Informacii 10, 239-246, (1974).
39. 39. T.M. Liggett, Interacting Particle Systems, Springer-Verlag, (1985).
40. 40. R. Dobrushin, V. Kryukov and A. Toom, Editors, Stochastic Cellular Systems: Ergodicity, Morphogenesis, Manchester University Press, Manchester, (1990).
41. 41. K. Eloranta, Critical growth phenomena in cellular automata, Physica D 103, 478-484, (1997).
42. 42. J.L. Lebowitz, C. Maes and E.R. Speer, Statistical mechanics of probabilistic cellular automata, J. Stat. Phys. 59, 117-170, (1990).
43. 43. R. Raghavan, Cellular automat in pattern recognition, Information Sciences 70, 145-177, (1993).
44. 44. A.I. Adamatzky, Identification of probabilistic cellular automata, Soviet J. Comput. Syst. Sci. 30, 118-123, (1992).
45. 45. S.M. Ermakov and G.A. Mikhailov, Statistical Modelling (In Russian), Nauka, Moscow, (1976).
46. 46. A.N. Tikhomirov and A.A. Samarskii, Equations of Mathematical Physics (In Russian), Moskva, Nauka, (1972).
47. th Symp. Foundations of Computer Science, pp. 238-246, (1993).
48. 48. U. Fiege, A fast randomised LOGSPACE algorithm for graph connectivity, Theor. Comput. Sci. 169,147-160, (1996).
49. th IEEE Symp. Foundations of Computer Science, pp. 218-233, (1979).
50. th Ann. Symp. Foundations of Computer Science, pp. 479-487, (1988).
51. 51. M. Salvatori, Random walks on generalized lattices, Monatschefte fur Mathematik 121, 145-161, (1996).
52. 52. G. Wei, Exact shapes of random walks in two dimensions, Physica A 222, 152-154, (1995).
53. 53. G. Wei, New approach to shapes of arbitrary random walks, Physica A 222, 155-160, (1995).
54. 54. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, (1992).
55. 55. J.W. Ketchum, Routing in cellular mobile radio communication networks, In Routing in Communications Networks, (Edited by M.E. Steenstrup), pp. 313-350, Prentice Hall, Englewood Cliffs, NJ, (1995).
56. 56. G.S. Lauer, Packet-radio routing, In Routing in Communications Networks, (Edited by M.E. Steenstrup), pp. 351-396, Prentice Hall, Englewood Cliffs, NJ, (1995).
57. 57. A. Frieze and M. Molloy, Broadcasting in random graphs, Discr. Appl. Math. 54, 77-79, (1994).