2019 Fiscal Year Annual Research Report
Geometric Algorithms for Portable devices
Project/Area Number |
17K12635
|
Research Institution | Tohoku University |
Principal Investigator |
Korman Matias 東北大学, 情報科学研究科, 助教 (80732718)
|
Project Period (FY) |
2017-04-01 – 2020-03-31
|
Keywords | Algorithms / Computational Geometry / Distributed algorithms / NP-completeness |
Outline of Annual Research Achievements |
Due to a change in location, we decided to interrupt the grant halfway through the year. Nonetheless, several of the milestones were achieved, even those planned for 2020 and 2021: -Although the concept of convex hull is well known and studied, its extension to environment with obstacles was never studied. We introduced the problem, showed its complexity and introduced the first algorithm for computing it -We studied the communication protocol for modular robots. Given a configuration of robots, we are interested in them communication so that they can reach another target shape. Although the problem turned out to be PSPACE hard (proof currently under review), we gave a constructive algorithm for the particular case in which you can add 5 helping robots in the exterior.
|
-
[Journal Article] Dynamic Graph Coloring2019
Author(s)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, Andre; van Renssen, Marcel Roeloffzen, Sander Verdonschot
-
Journal Title
Algorithmica
Volume: 81(4)
Pages: 1319-1341
DOI
-
-
-
-
-
-
[Presentation] Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers2019
Author(s)
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belen Palop, Irene Parada, Andre van Renssen, Vera Sacristan
Organizer
ESA 2019: 3:1-3:14
Int'l Joint Research