Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909744401219584 |
|---|---|
| author | Jana, Saswata Pramanick, Subhajit Bhattacharya, Adri Mandal, Partha Sarathi |
| author_facet | Jana, Saswata Pramanick, Subhajit Bhattacharya, Adri Mandal, Partha Sarathi |
| contents | In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property using only local knowledge. This paper affirmatively answers the question with a set of \emph{myopic} (finite visibility range) luminous robots with the aim of \emph{filling a minimal vertex cover} (MVC) of a given graph $G = (V, E)$. The graph has special vertices, called \emph{doors}, through which robots enter sequentially. Starting from the doors, the goal of the robots is to settle on a set of vertices that forms a minimal vertex cover of $G$ under the asynchronous ($\mathcal{ASYNC}$) scheduler. We are also interested in achieving the \emph{minimum vertex cover} (MinVC, which is NP-hard \cite{Karp1972} for general graphs) for a specific graph class using the myopic robots. We establish lower bounds on the visibility range for the robots and on the time complexity (which is $Ω(|E|)$). We present two algorithms for trees: one for single door, which is both time and memory-optimal, and the other for multiple doors, which is memory-optimal and achieves time-optimality when the number of doors is a constant. Interestingly, our technique achieves MinVC on trees with a single door. We then move to the general graph, where we present two algorithms, one for the single door and the other for the multiple doors with an extra memory of $O(\log Δ)$ for the robots, where $Δ$ is the maximum degree of $G$. All our algorithms run in $O(|E|)$ epochs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_14247 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots Jana, Saswata Pramanick, Subhajit Bhattacharya, Adri Mandal, Partha Sarathi Distributed, Parallel, and Cluster Computing In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property using only local knowledge. This paper affirmatively answers the question with a set of \emph{myopic} (finite visibility range) luminous robots with the aim of \emph{filling a minimal vertex cover} (MVC) of a given graph $G = (V, E)$. The graph has special vertices, called \emph{doors}, through which robots enter sequentially. Starting from the doors, the goal of the robots is to settle on a set of vertices that forms a minimal vertex cover of $G$ under the asynchronous ($\mathcal{ASYNC}$) scheduler. We are also interested in achieving the \emph{minimum vertex cover} (MinVC, which is NP-hard \cite{Karp1972} for general graphs) for a specific graph class using the myopic robots. We establish lower bounds on the visibility range for the robots and on the time complexity (which is $Ω(|E|)$). We present two algorithms for trees: one for single door, which is both time and memory-optimal, and the other for multiple doors, which is memory-optimal and achieves time-optimality when the number of doors is a constant. Interestingly, our technique achieves MinVC on trees with a single door. We then move to the general graph, where we present two algorithms, one for the single door and the other for the multiple doors with an extra memory of $O(\log Δ)$ for the robots, where $Δ$ is the maximum degree of $G$. All our algorithms run in $O(|E|)$ epochs. |
| title | Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2508.14247 |