Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Debasish Pattanayak"'
Publikováno v:
IEEE Transactions on Mobile Computing. 21:1449-1462
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d311f226ff039411648b0e17be96c0e
https://doi.org/10.1109/tmc.2020.3022075
https://doi.org/10.1109/tmc.2020.3022075
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031248474
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7094b1c404c7d7ea4bad5b130fc4e4d3
https://doi.org/10.1007/978-3-031-24848-1_1
https://doi.org/10.1007/978-3-031-24848-1_1
Publikováno v:
Theoretical Computer Science. 858:64-80
This paper revisits the widely researched gathering problem for two robots without any agreement on the coordinate system in a scenario which allows randomization in the asynchronous scheduling model. The scheduler is considered to be the adversary w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b32b262ab16927c011762284988d9fc
https://doi.org/10.1016/j.tcs.2020.11.048
https://doi.org/10.1016/j.tcs.2020.11.048
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031099922
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5a7bef28af42261a763565a7f62c4b6
https://doi.org/10.1007/978-3-031-09993-9_11
https://doi.org/10.1007/978-3-031-09993-9_11
Publikováno v:
Journal of Parallel and Distributed Computing. 123:145-155
We study the Gathering problem for mobile robots in presence of faults. In classical gathering, robots gather at a point not known a priori in finite time. In this paper, we focus on gathering of all non-faulty robots at a single point in the presenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::104f323b4ca43af3e55c8330c89deb41
https://doi.org/10.1016/j.jpdc.2018.09.015
https://doi.org/10.1016/j.jpdc.2018.09.015
Publikováno v:
ICDCN (Adjunct Volume)
The dispersion problem on graphs asks k ≤ n robots initially placed arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration with each robot on a distinct node. This problem is of interest due to its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbd8a8cc73ab253dd409f6bc32122fac
https://doi.org/10.1145/3427477.3429464
https://doi.org/10.1145/3427477.3429464
Publikováno v:
Distributed Computing and Internet Technology ISBN: 9783030656201
ICDCIT
ICDCIT
With existing tracing mechanisms, we can quickly identify potentially infected people with a virus by choosing everyone who has come in contact with an infected person. In the presence of abundant resources, that is the most sure-fire way to contain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96b59437d3bfd14f9f49b919698bb3a5
https://doi.org/10.1007/978-3-030-65621-8_12
https://doi.org/10.1007/978-3-030-65621-8_12
Publikováno v:
ICDCN
Unmanned Aerial Vehicles (UAVs) or Drones are of massive interest in monitoring large areas with uneven surfaces or managing large events such as protests while ensuring civil security and public safety. A common requirement for this needs the UAVs t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d7e4e92d7a9eeb758f74086fbdfcbc3
https://doi.org/10.1145/3369740.3369781
https://doi.org/10.1145/3369740.3369781
Publikováno v:
ICDCN
Distributed evacuation of mobile robots has recently raised the interest of researchers. Czyzowicz et al. [1] introduced the evacuation problem minimizing the time required for the last searcher to reach the target. They showed the optimal evacuation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6963e31b069e7274d96e256f0cdf303
https://doi.org/10.1145/3369740.3373806
https://doi.org/10.1145/3369740.3373806
Publikováno v:
COMSNETS
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 make a structure from a given distribution of materials (\textit{bric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36837c1aa7437ecc5c6487e93c47fabd