Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Sau, Buddhadeb"'
Dispersion by mobile agents is a well studied problem in the literature on computing by mobile robots. In this problem, $l$ robots placed arbitrarily on nodes of a network having $n$ nodes are asked to relocate themselves autonomously so that each no
Externí odkaz:
http://arxiv.org/abs/2408.12220
In distributed computing by mobile robots, robots are deployed over a region, continuous or discrete, operating through a sequence of \textit{look-compute-move} cycles. An extensive study has been carried out to understand the computational powers of
Externí odkaz:
http://arxiv.org/abs/2407.05678
Arbitrary Pattern Formation (APF) is a fundamental coordination problem in swarm robotics. It requires a set of autonomous robots (mobile computing units) to form an arbitrary pattern (given as input) starting from any initial pattern. This problem h
Externí odkaz:
http://arxiv.org/abs/2309.11190
This study addresses the problem of "Circle Formation on an Infinite Grid by Fat Robots" ($CF\_FAT\_GRID$). Unlike prior work focused solely on point robots in discrete domain, it introduces fat robots to circle formation on an infinite grid, alignin
Externí odkaz:
http://arxiv.org/abs/2308.10031
In the field of distributed system, Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of robots to a particular position on an environment (discrete or continuous
Externí odkaz:
http://arxiv.org/abs/2303.10366
Consider a group of autonomous mobile computational entities called robots. The robots move in the Euclidean plane and operate according to synchronous $Look$-$Compute$-$Move$ cycles. The computational capabilities of the robots under the four tradit
Externí odkaz:
http://arxiv.org/abs/2303.03031
Consider a set of $n$ mobile entities, called robots, located and operating on a continuous circle, i.e., all robots are initially in distinct locations on a circle. The \textit{gathering} problem asks to design a distributed algorithm that allows th
Externí odkaz:
http://arxiv.org/abs/2302.07600
In this paper, we have considered two fully synchronous $\mathcal{OBLOT}$ robots having no agreement on coordinates entering a finite unoriented grid through a door vertex at a corner, one by one. There is a resource that can move around the grid syn
Externí odkaz:
http://arxiv.org/abs/2301.08519
Arbitrary pattern formation (\textsc{Apf}) is a well-studied problem in swarm robotics. To the best of our knowledge, the problem has been considered in two different settings: one in a euclidean plane and another in an infinite grid. This work deals
Externí odkaz:
http://arxiv.org/abs/2212.02876
Two fundamental problems of distributed computing are Gathering and Arbitrary pattern formation (\textsc{Apf}). These two tasks are different in nature as in gathering robots meet at a point but in \textsc{Apf} robots form a fixed pattern in distinct
Externí odkaz:
http://arxiv.org/abs/2210.00567