Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Ramachandran Vaidyanathan"'
Publikováno v:
Algorithms, Vol 14, Iss 2, p 56 (2021)
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third
Externí odkaz:
https://doaj.org/article/62e670f4d46b4543b5fb1f5240d79df1
Publikováno v:
IPDPS Workshops
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other robots using colored lights (the robots with lights model). This model assumes obstructed visibility where a r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a13dc59b5ed2bf041946ede062f14d39
https://doi.org/10.15803/ijnc.11.1_50
https://doi.org/10.15803/ijnc.11.1_50
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d3ed82ba21f38df2d515fbc74bf1371
https://doi.org/10.1109/ipdps53621.2022.00115
https://doi.org/10.1109/ipdps53621.2022.00115
Autor:
Jurgen Becker, Lana Josipovic, Viktor K. Prasanna, Marco Santambrogio, Ramachandran Vaidyanathan
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a22f85af3dc85d00b27e4297719c370
https://doi.org/10.1109/ipdpsw55747.2022.00018
https://doi.org/10.1109/ipdpsw55747.2022.00018
Autor:
Sushil Prasad, Charles Weems, Alan Sussman, Anshul Gupta, Trilce Estrada, Ramachandran Vaidyanathan, Sheikh Ghafoor, Krishna Kant, Craig Stunkel
Publikováno v:
Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 2.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::664ab75938283010acbcc1a3b9809105
https://doi.org/10.1145/3545947.3569594
https://doi.org/10.1145/3545947.3569594
Publikováno v:
Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 2.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4e56977a3ff06cd9c2cac8ab139b20f
https://doi.org/10.1145/3545947.3569623
https://doi.org/10.1145/3545947.3569623
Publikováno v:
Algorithms, Vol 14, Iss 56, p 56 (2021)
Algorithms
Volume 14
Issue 2
Algorithms
Volume 14
Issue 2
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::124b833f9e8a8af3880c1db2285119f8
https://www.mdpi.com/1999-4893/14/2/56
https://www.mdpi.com/1999-4893/14/2/56
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030910808
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b60f0bf59a1947a50190007d5820601
https://doi.org/10.1007/978-3-030-91081-5_35
https://doi.org/10.1007/978-3-030-91081-5_35
Publikováno v:
Information and Computation. 285:104699
We consider the fundamental problem of arranging a set of n autonomous robots (points) on a real plane according to an arbitrary given pattern. Each robot operates in a, largely oblivious, look-compute-move step. We measure the time complexity of our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c51000bee0b9d7e4b5004001bb66a265
https://doi.org/10.1016/j.ic.2021.104699
https://doi.org/10.1016/j.ic.2021.104699
Publikováno v:
IPDPS
We consider the distributed setting of n autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other robots using a constant number of colored lights (the robots with lights model). We assume obstructed visibili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b69beabaa5774538858f11ce41cbd106
https://doi.org/10.1109/ipdps47924.2020.00111
https://doi.org/10.1109/ipdps47924.2020.00111