SIMULATING DISTRIBUTED ALGORITHMS FOR LATTICE AGENTS

O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner


We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2- and 3-dimensional square/cubic lattice-based agents.

This AgentSystem assumes that each agent is capable to change its position in the lattice and that neighboring agents can attach to and detach from each other. In addition, it assumes that each module has some constant size memory and computation capability, and can send/receive constant size messages to/from its neighbors.

The AgentSystem allows the user to define sets of agents and sets of rules, which are applied to all agents. It simulates the synchronized execution of the set of rules by all the modules, and can keep track of all actions made by the modules at each step, supporting consistency warnings and error checking.

AVAILABLE DOCUMENTS

  1. O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner.
    Simulating distributed algorithms for lattice agents.
    To appear in Proc. XV Spanish Meeting on Computational Geometry, June 26-28, 2013.
    PDF
  2. R. Wallner.
    A System of Autonomously Self-Reconfigurable Agents.
    Diploma Thesis, Institute for Software Technology, Graz University of Technology, 2009.
    PDF.

THE 2-DIMENSIONAL SQUARE-LATTICE SIMULATOR


2-DIMENSIONAL EXAMPLES OF AGENTS AND RULES

We provide several configurations of agents together with our sets of rules to perform the following tasks for connected sets of agents. Details for the algorithms can be found in reference 2.

THE 3-DIMENSIONAL CUBIC-LATTICE SIMULATOR


3-DIMENSIONAL EXAMPLES OF AGENTS AND RULES

We provide several configurations of agents together with our sets of rules to perform the following tasks for connected sets of agents. Details for the algorithms can be found in reference 2.

RELATED WORK


Last update of this page: