Searching without communicating: tradeoffs between performance and selection complexity
© 2016, Springer-Verlag Berlin Heidelberg. We consider the ANTS problem (Feinerman et al.) in which a group of agents collaboratively search for a target in a two-dimensional plane. Because this problem is inspired by the behavior of biological species, we argue that in addition to studying the time...
Main Authors: | Lenzen, Christoph (Author), Lynch, Nancy (Author), Newport, Calvin (Author), Radeva, Tsvetomira (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer Nature,
2021-10-27T19:52:48Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Trade-offs between selection complexity and performance when searching the plane without communication
by: Lenzen, Christoph, et al.
Published: (2016) -
Brief Announcement: Partial Reversal Acyclicity
by: Radeva, Tsvetomira, et al.
Published: (2012) -
A symbiotic perspective on distributed algorithms and social insects
by: Radeva, Tsvetomira
Published: (2017) -
Properties of link reversal algorithms for routing and leader election
by: Radeva, Tsvetomira
Published: (2013) -
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
by: Newport, Calvin Charles, et al.
Published: (2010)