A. Goebels, H. Kleine Büning, S. Priesterjahn, and A. Weimer (Germany)
Partitioning, MAS, Distributed Computing, Swarm, Task Allocation, Locality
This paper deals with the autonomous and uniform parti tioning of very simple, homogeneous agents onto a fixed number of targets in a geometric space. A set of algorithms will be presented and compared according to the quality of the partitioning and the runtime of simulations with differ ent starting conditions. Random and heuristic approaches will be discussed. The algorithm with the most promising experimental results, the Border Switch Strategy (BSS), will be explained and formalized in a detailed way.
Important Links:
Go Back
