In this paper, we present an algorithm for exploring an unknown graph with opaque edges by multiplerobots. We show that this algorithm is near optimal on graphs with n vertices and superlinear number of edges (i.e., ...
详细信息
ISBN:
(纸本)9781479951994
In this paper, we present an algorithm for exploring an unknown graph with opaque edges by multiplerobots. We show that this algorithm is near optimal on graphs with n vertices and superlinear number of edges (i.e., omega(n) edges), and give an adversarial construction to show that the algorithm does not perform well on cyclic graphs with O(n) edges.
In this article, we consider how a very large numbers of robots, differing in their bodies, sensing, and intelligence, may be made to coexist, communicate, and compete fairly toward achieving their individual goals, i...
详细信息
暂无评论