DPDebasish Pattanayak
Debasish Pattanayak
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Debasish Pattanayak has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Nicola Santoro
Carleton University
2 shared publications - Paola Flocchini
University of Ottawa
2 shared publications - Alfredo Navarra
University of Perugia
1 shared publication - Caterina Feletti
Department of Computer Science Università degli Studi di Milano Italy
1 shared publication - Francesco Piselli
Department of Mathematics and Computer Science, University of Perugia, Perugia, Italy
1 shared publication - Giuseppe Prencipe
Università di Pisa
1 shared publication
Latest Publications
- 25 March 2026
- Published by Springer Nature in Distributed Computing
- Vol. 39 (2) , 11
Universal pattern formation by oblivious robots under sequential schedulers
- 25 March 2026
- Published by Springer Nature in Distributed Computing
- Vol. 39 (2) , 11
Universal pattern formation by oblivious robots under sequential schedulers
- Open Access
Universal Dancing by Luminous Robots under Sequential Schedulers
The Dancing problem requires a swarm of $n$ autonomous mobile robots to form a sequence of patterns, aka perform a choreography. Existing work has proven that some crucial restrictions on choreographies and initial configurations (e.g., on repetitions of patterns, periodicity, symmetries, contractions/expansions) must hold so that the Dancing problem can be solved under certain robot models. Here, we prove that these necessary constraints can be dropped by considering the LUMI model (i.e., where robots are endowed with a light whose color can be chosen from a constant-size palette) under the quite unexplored sequential scheduler. We formalize the class of Universal Dancing problems which require a swarm of $n$ robots starting from any initial configuration to perform a (periodic or finite) sequence of arbitrary patterns, only provided that each pattern consists of $n$ vertices (including multiplicities). However, we prove that, to be solvable under LUMI, the length of the feasible choreographies is bounded by the compositions of $n$ into the number of colors available to the robots. We provide an algorithm solving the Universal Dancing problem by exploiting the peculiar capability of sequential robots to implement a distributed counter mechanism. Even assuming non-rigid movements, our algorithm ensures spatial homogeneity of the performed choreography.Open AccessUniversal Dancing by Luminous Robots under Sequential Schedulers
The Dancing problem requires a swarm of $n$ autonomous mobile robots to form a sequence of patterns, aka perform a choreography. Existing work has proven that some crucial restrictions on choreographies and initial configurations (e.g., on repetitions of patterns, periodicity, symmetries, contractions/expansions) must hold so that the Dancing problem can be solved under certain robot models. Here, we prove that these necessary constraints can be dropped by considering the LUMI model (i.e., where robots are endowed with a light whose color can be chosen from a constant-size palette) under the quite unexplored sequential scheduler. We formalize the class of Universal Dancing problems which require a swarm of $n$ robots starting from any initial configuration to perform a (periodic or finite) sequence of arbitrary patterns, only provided that each pattern consists of $n$ vertices (including multiplicities). However, we prove that, to be solvable under LUMI, the length of the feasible choreographies is bounded by the compositions of $n$ into the number of colors available to the robots. We provide an algorithm solving the Universal Dancing problem by exploiting the peculiar capability of sequential robots to implement a distributed counter mechanism. Even assuming non-rigid movements, our algorithm ensures spatial homogeneity of the performed choreography.