A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Cellular automata in pattern recognition
Information Sciences: an International Journal
Hierarchy of fuzzy cellular automata
Fuzzy Sets and Systems
Discrete Applied Mathematics
Routing in cellular mobile radio communications networks
Routing in communications networks
Routing in communications networks
A fast randomized LOGSPACE algorithm for graph connectivity
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Time-space tradeoffs for undirected graph traversal by graph automata
Information and Computation
Critical growth phenomena in cellular automata
Proceedings of the workshop on Lattice dynamics
Ant-based load balancing in telecommunications networks
Adaptive Behavior
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A randomized time-space tradeoff of O/spl tilde/(mR/spl circ/) for USTCON
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Fine-grain discrete Voronoi diagram algorithms in L1 and L∞ norms
Mathematical and Computer Modelling: An International Journal
Voronoi-like partition of lattice in cellular automata
Mathematical and Computer Modelling: An International Journal
Laziness + Sensitivity + Mobility = Structure. Emergence of Patterns in Lattice Swarms
ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Morphology of patterns of lattice swarms: Interval parameterization
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.98 |
This paper describes an algorithm for the construction of the edges of a Voronoi diagram on a two-dimensional lattice by collectives of finite automata which pick up and drop pebbles at nodes, and move at random between nodes. Given a set of labelled nodes on a lattice, we wish to identify those nodes of the lattice which are the edges of the Voronoi cells of the labelled nodes. Every finite automaton is given a color corresponding to one of the labelled nodes. Automata start their walks at the nodes of the given set. They carry pebbles, and change the orientations of their velocity vectors according to a given probability distribution. When automata of different colors meet at a node of the lattice they drop their pebbles. When this process has run its course, the number of pebbles of each color at each node of the lattice indicates the membership degree (or probability of membership) of this node in the set of edge nodes of the Voronoi diagram. In the paper, we analyse three models of the computation of Voronoi diagrams by automata, give results of numerical simulations, determine the convergence rate of the algorithm, and show the exact shapes of the Voronoi cells.