TY - GEN
T1 - Asynchronous pattern formation by anonymous oblivious mobile robots
AU - Fujinaga, Nao
AU - Yamauchi, Yukiko
AU - Kijima, Shuji
AU - Yamashita, Masafumi
N1 - Funding Information:
This work is supported in part by MEXT/IPSJ KAKENHI 21650002, 22300004, 23700019, 24104003 and 24650008.
PY - 2012
Y1 - 2012
N2 - We present an oblivious pattern formation algorithm for anonymous mobile robots in the asynchronous model. The robots obeying the algorithm, starting from any initial configuration I, always form a given pattern F, if I and F do not contain multiplicities and ρ(I) divides ρ(F), where ρ(·) denotes the geometric symmetricity. Our algorithm substantially outdoes an algorithm by Dieudonné et al. proposed in DISC 2010, which is dedicated to ρ(I) = 1. Our algorithm is best possible (as long as I and F do not contain multiplicities), since there is no algorithm that always forms F from I when ρ(F) is not divisible by ρ(I). All known pattern formation algorithms are constructed from scratch. We instead use a bipartite matching algorithm (between the robots and the points in F) we proposed in OPODIS 2011 as a core subroutine, to make the description of algorithm concise and easy to understand.
AB - We present an oblivious pattern formation algorithm for anonymous mobile robots in the asynchronous model. The robots obeying the algorithm, starting from any initial configuration I, always form a given pattern F, if I and F do not contain multiplicities and ρ(I) divides ρ(F), where ρ(·) denotes the geometric symmetricity. Our algorithm substantially outdoes an algorithm by Dieudonné et al. proposed in DISC 2010, which is dedicated to ρ(I) = 1. Our algorithm is best possible (as long as I and F do not contain multiplicities), since there is no algorithm that always forms F from I when ρ(F) is not divisible by ρ(I). All known pattern formation algorithms are constructed from scratch. We instead use a bipartite matching algorithm (between the robots and the points in F) we proposed in OPODIS 2011 as a core subroutine, to make the description of algorithm concise and easy to understand.
UR - http://www.scopus.com/inward/record.url?scp=84868375501&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868375501&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33651-5_22
DO - 10.1007/978-3-642-33651-5_22
M3 - Conference contribution
AN - SCOPUS:84868375501
SN - 9783642336508
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 312
EP - 325
BT - Distributed Computing - 26th International Symposium, DISC 2012, Proceedings
T2 - 26th International Symposium on Distributed Computing, DISC 2012
Y2 - 16 October 2012 through 18 October 2012
ER -