作者: Peter Kling , Friedhelm Meyer auf der Heide
DOI: 10.1007/978-3-030-11072-7_13
关键词: Distributed computing 、 Robot 、 Computer science 、 Point (geometry) 、 Energy consumption 、 Swarm robotics 、 Simple (abstract algebra) 、 Upper and lower bounds 、 Plane (geometry) 、 Focus (optics)
摘要: We consider simple models of swarms identical, anonymous robots: they are points in the plane and “see” only their neighbors (robots within distance one). will deal with distributed local protocols such that result formations like “gathering at one point”. The focus be on assuming a continuous time model. present upper lower bounds run energy consumption, compare different both theoretically experimentally.