TY - GEN

T1 - Evacuation from a finite 2D square grid field by a metamorphic robotic system

AU - Nakamura, Junya

AU - Kamei, Sayaka

AU - Yamauchi, Yukiko

N1 - Funding Information:
This work was supported by JSPS KAKENHI No. 19K11828,
Funding Information:
This work was supported by JSPS KAKENHI No. 19K11828, and Israel & Japan Science and Technology Agency (JST) SICORP (Grant#JPMJSC1806).
Publisher Copyright:
© 2020 IEEE

PY - 2020/11

Y1 - 2020/11

N2 - We consider evacuation from a finite two-dimensional (2D) square grid field by a metamorphic robotic system (MRS). An MRS is composed of anonymous memoryless modules. Each module of an MRS executes an identical distributed algorithm and moves autonomously while keeping the connectivity of modules. Since the modules are memoryless, an MRS utilizes its shape to remember the progress of execution. The number of available shapes that an MRS can form depends on the number of modules, which is thus an important complexity measure for a behavior of an MRS. In this paper, we investigate the minimum number of modules required to solve the evacuation problem with several conditions. First, we consider a rectangular field surrounded by walls with at least one exit and show that two modules are necessary and sufficient for evacuation from any rectangular field if the modules are equipped with a global compass, which allows the modules to have a common sense of direction. Then, we focus on the case where modules do not have a global compass and show that four (resp. seven) modules are necessary and sufficient for restricted (resp. any) initial states of an MRS. We also show that two modules are sufficient in the special case where an MRS is on a wall in an initial configuration. Finally, we extend these results to another type of fields, that is, mazes.

AB - We consider evacuation from a finite two-dimensional (2D) square grid field by a metamorphic robotic system (MRS). An MRS is composed of anonymous memoryless modules. Each module of an MRS executes an identical distributed algorithm and moves autonomously while keeping the connectivity of modules. Since the modules are memoryless, an MRS utilizes its shape to remember the progress of execution. The number of available shapes that an MRS can form depends on the number of modules, which is thus an important complexity measure for a behavior of an MRS. In this paper, we investigate the minimum number of modules required to solve the evacuation problem with several conditions. First, we consider a rectangular field surrounded by walls with at least one exit and show that two modules are necessary and sufficient for evacuation from any rectangular field if the modules are equipped with a global compass, which allows the modules to have a common sense of direction. Then, we focus on the case where modules do not have a global compass and show that four (resp. seven) modules are necessary and sufficient for restricted (resp. any) initial states of an MRS. We also show that two modules are sufficient in the special case where an MRS is on a wall in an initial configuration. Finally, we extend these results to another type of fields, that is, mazes.

UR - http://www.scopus.com/inward/record.url?scp=85104580630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85104580630&partnerID=8YFLogxK

U2 - 10.1109/CANDAR51075.2020.00016

DO - 10.1109/CANDAR51075.2020.00016

M3 - Conference contribution

AN - SCOPUS:85104580630

T3 - Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020

SP - 69

EP - 78

BT - Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 8th International Symposium on Computing and Networking, CANDAR 2020

Y2 - 24 November 2020 through 27 November 2020

ER -