par Hamann, Heiko;Aust, Till;Reina, Andreagiovanni
Référence Lecture notes in computer science, 12421 LNCS, page (134-147)
Publication Publié, 2020-01-01
Référence Lecture notes in computer science, 12421 LNCS, page (134-147)
Publication Publié, 2020-01-01
Article révisé par les pairs
Résumé : | Scalability is a key feature of swarm robotics. Hence, measuring performance depending on swarm size is important to check the validity of the design. Performance diagrams have generic qualities across many different application scenarios. We summarize these findings and condense them in a practical performance analysis guide for swarm robotics. We introduce three general classes of performance: linear increase, saturation, and increase/decrease. As the performance diagrams may contain rich information about underlying processes, such as the degree of collaboration and chains of interference events in crowded situations, we discuss options for quickly devising hypotheses about the underlying robot behaviors. The validity of our performance analysis guide is then made plausible in a number of simple examples based on models and simulations. |