2 citations · 3 across the 5 of their papers we have counts for
10 papers
Optimal Uniform Circle Formation by Asynchronous Luminous Robots
Caterina Feletti, Debasish Pattanayak, Gokarna Sharma
We study the {\sc Uniform Circle Formation} ({\sc UCF}) problem for a swarm of autonomous mobile robots operating in \emph{Look-Compute-Move} (LCM) cycles on the Euclidean plan…
On maximal k-edge-connected subgraphs of undirected graphs
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas +1
We show how to find and efficiently maintain maximal k-edge-connected subgraphs in undirected graphs. In particular, we provide the following results. (1) A general framework for m…
Filling MIS Vertices by Myopic Luminous Robots
Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak +1
We present the problem of finding a maximal independent set (MIS) (named as \emph{MIS Filling problem}) of an arbitrary connected graph having vertices with luminous myopic mob…
Fort Formation by an Automaton
Kartikey Kant, Debasish Pattanayak, Partha Sarathi Mandal
Building structures by low capability robots is a very recent research development. A robot (or a mobile agent) is designed as a deterministic finite automaton. The objective is to…
Conic Formation in Presence of Faulty Robots
Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal +1
Pattern formation is one of the most fundamental problems in distributed computing, which has recently received much attention. In this paper, we initiate the study of distributed…
Randomized Gathering of Asynchronous Mobile Robots
Debasish Pattanayak, John Augustine, Partha Sarathi Mandal
This paper revisits the widely researched \textit{gathering} problem for two robots in a scenario which allows randomization in the asynchronous scheduling model. The scheduler is…
Chauffeuring a Crashed Robot from a Disk
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal
Evacuation of robots from a disk has attained a lot of attention recently. We visit the problem from the perspective of fault-tolerance. We consider two robots trying to evacuate f…
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal +1
Distributed evacuation of mobile robots is a recent development. We consider the evacuation problem of two robots which are initially located at the center of a unit disk. Both the…
Convergence of Even Simpler Robots without Location Information
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal +1
The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can…
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection
Debasish Pattanayak, Kaushik Mondal, H. Ramesh +1
There has been a wide interest in designing distributed algorithms for tiny robots. In particular, it has been shown that the robots can complete certain tasks even in the presence…