Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Krishnendu Mukhopadhyaya"'
Publikováno v:
Algorithms, Vol 14, Iss 2, p 62 (2021)
For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots are
Externí odkaz:
https://doaj.org/article/91552ef9319143eea1862a98e7c13967
Publikováno v:
Theoretical Computer Science. 916:40-61
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19dfcb4f35877571a829d7cd7989be40
https://doi.org/10.1016/j.tcs.2022.03.003
https://doi.org/10.1016/j.tcs.2022.03.003
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e929970654f04be7849303a8f7b51b1
http://arxiv.org/abs/2206.07416
http://arxiv.org/abs/2206.07416
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86c6adecadab93b0b23dd6c32aa8b1e8
http://arxiv.org/abs/2202.03350
http://arxiv.org/abs/2202.03350
Autor:
Bibhuti Das, Krishnendu Mukhopadhyaya
Publikováno v:
Proceedings of the 23rd International Conference on Distributed Computing and Networking.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::264b310dd9e377011ed07dbdca9f1190
https://doi.org/10.1145/3491003.3491299
https://doi.org/10.1145/3491003.3491299
Publikováno v:
Proceedings of the 23rd International Conference on Distributed Computing and Networking.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f455738888c32088e6bb4c4394bdcd69
https://doi.org/10.1145/3491003.3491301
https://doi.org/10.1145/3491003.3491301
Autor:
Quentin Bramas, Bapi Chatterjee, Stéphane Devismes, Malcolm Egan, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, V. Vijaya Saradhi
This volume LNCS constitutes the refereed proceedings of the 21st International Conference on Distributed Computing and Intelligent Technology, ICDCIT 2025, in Bhubaneswar, in India, in January 2025. ICDCIT is organized into two tracks: Distributed C
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
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. Robot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afde5dbc14320c536492600c998b16b2
Publikováno v:
Algorithms, Vol 14, Iss 62, p 62 (2021)
Algorithms
Volume 14
Issue 2
Algorithms
Volume 14
Issue 2
For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6712c20a3c3a0f857e22d12233c0e20
https://doi.org/10.3390/a14020062
https://doi.org/10.3390/a14020062
Publikováno v:
Journal of Graph Algorithms and Applications. 21:265-280
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c97e2b40d065274839e2eadc4069bd1b
https://doi.org/10.7155/jgaa.00416
https://doi.org/10.7155/jgaa.00416