Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Mondal, Kaushik"'
Distance-2-Dispersion (D-2-D) problem aims to disperse $k$ mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph $G$ with $n$ nodes such that no two agents occupy adjacent nodes in the final configuration,
Externí odkaz:
http://arxiv.org/abs/2410.19468
The dispersion involves the coordination of $k \leq n$ agents on a graph of size $n$ to reach a configuration where at each node at most one agent can be present. It is a well-studied problem. Also, this problem is studied on dynamic graphs with $n$
Externí odkaz:
http://arxiv.org/abs/2410.04050
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
A black hole in a graph is a dangerous site that disposes any incoming agent into that node without leaving any trace of its existence. In the Black Hole Search (BHS) problem, the goal is for at least one agent to survive, locate the position of the
Externí odkaz:
http://arxiv.org/abs/2405.18367
Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a network, many important problems have been studied in this context. G
Externí odkaz:
http://arxiv.org/abs/2305.01753
Autor:
Kaur, Tanvir, Mondal, Kaushik
The aim of the dispersion problem is to place a set of $k(\leq n)$ mobile robots in the nodes of an unknown graph consisting of $n$ nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary initial c
Externí odkaz:
http://arxiv.org/abs/2301.04938
In the dispersion problem, a set of $k$ co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an anonymous graph $G=(V,E)$, where the nodes of the graph are not labeled. The edges inciden
Externí odkaz:
http://arxiv.org/abs/2202.05710
Autor:
Saxena, Ashish, Mondal, Kaushik
Publikováno v:
In Theoretical Computer Science 29 December 2024 1022
Publikováno v:
In Ocean Engineering 1 July 2024 303
Publikováno v:
In Journal of Parallel and Distributed Computing June 2024 188