Gathering of oblivious robots on infinite grids with minimum traveled distance

标题
Gathering of oblivious robots on infinite grids with minimum traveled distance
作者
关键词
Distributed computing, Asynchronous system, Look–Compute–Move model, Weber point, Oblivious and anonymous robots
出版物
INFORMATION AND COMPUTATION
Volume 254, Issue -, Pages 377-391
出版商
Elsevier BV
发表日期
2016-09-21
DOI
10.1016/j.ic.2016.09.004

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More