Distributed Graph Computations via Mobile Robots

Document Type

Conference Article

Publication Title

ACM International Conference Proceeding Series

Abstract

The realm of distributed computing by mobile robots on graphs has witnessed significant advancements in recent years, offering solutions to various real-world problems. This research delves into two fundamental problems in this domain, focusing on the development of efficient algorithms and crash tolerance. To date, we have been able to provide (i) efficient, crash-tolerant dispersion algorithms for mobile robots [1], and (ii) the exploration of small dominating sets and maximal independent sets through mobile robots [2].

First Page

252

Last Page

253

DOI

10.1145/3631461.3632507

Publication Date

1-4-2024

Share

COinS