Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Mukhopadhyaya, Krishnendu"'
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, we consider the dispersion problem for silent robots \cite{gorain2024co
Externí odkaz:
http://arxiv.org/abs/2408.05491
In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking node p_i has a capacity of k_i which
Externí odkaz:
http://arxiv.org/abs/2310.09813
In the existing literature of the Mutual Visibility problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates the
Externí odkaz:
http://arxiv.org/abs/2206.07416
Publikováno v:
In Theoretical Computer Science 1 January 2025 1023
The gathering over meeting nodes problem requires the robots to gather at one of the pre-defined meeting nodes. This paper investigates the problem with respect to the objective function that minimizes the total number of moves made by all the robots
Externí odkaz:
http://arxiv.org/abs/2202.03350
Publikováno v:
Fundamenta Informaticae, Volume 187, Issue 1 (October 21, 2022) fi:8841
The gathering over meeting nodes problem asks the robots to gather at one of the pre-defined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting nodes. Robots
Externí odkaz:
http://arxiv.org/abs/2112.06506
Autor:
Mondal, Moumita, Chaudhuri, Sruti Gan, Dutta, Ayan, Mukhopadhyaya, Krishnendu, Chatterjee, Punyasha
In this paper, we study the circle formation problem by multiple autonomous and homogeneous disc-shaped robots (also known as fat robots). The goal of the robots is to place themselves on the periphery of a circle. Circle formation has many real-worl
Externí odkaz:
http://arxiv.org/abs/2012.07113
Publikováno v:
In Journal of Parallel and Distributed Computing October 2023 180
This paper addresses the mutual visibility problem for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the
Externí odkaz:
http://arxiv.org/abs/1708.02825
This paper proposes a strategy for a group of deaf and dumb robots, carrying clocks from different countries, to meet at a geographical location which is not fixed in advanced. The robots act independently. They can observe others, compute some locat
Externí odkaz:
http://arxiv.org/abs/1604.00498