作者: Noam Gordon , Yotam Elor , Alfred M. Bruckstein
DOI: 10.1007/978-3-540-87527-7_7
关键词: Swarm intelligence 、 Correctness 、 Artificial intelligence 、 Visibility graph 、 Computer science 、 Mobile robot 、 Swarm behaviour 、 Distributed computing
摘要: In this follow-up to an ANTS 2004 paper we continue investigate the problem of gathering a swarm multiple robotic agents on plane using very limited local sensing capabilities. our previous work, assumed that cannot measure their distance neighboring at all. paper, consider crude range-limited capability can only tell if are either nearor far. We introduce two new variants previously proposed algorithm utilize capability. prove correctness algorithms, and show newly added improve performance significantly.