| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872437 | Discrete Applied Mathematics | 2014 | 8 Pages |
Abstract
This paper studies deterministic movement over toroidal grids (and more generally, Cayley graphs on groups), integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Katy E. Beeler, Kenneth S. Berenhaut, Joshua N. Cooper, Meagan N. Hunter, Peter S. Barr,