Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference80 articles.
1. Abshoff, S., Cord-Landwehr, A., Jung, D., Meyer auf der Heide, F.: Towards gathering robots with limited view in linear time: the closed chain case. CoRR abs/1501.04877 (2015). http://arxiv.org/abs/1501.04877
2. Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of 32nd ACM Symposium on Principles of Distributed Computing (PODC) (2013)
3. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)
4. Ajith, A., Crina, G., Vitorino, R.: Stigmergic Optimization, Studies in Computational Intelligence, vol. 31. Springer, Berlin (2006)
5. Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献