Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference34 articles.
1. Agathangelou, C., Georgiou, C. and Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In 32nd ACM Symposium on Principles of Distributed Computing (PODC), 250–259, 2013.
2. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)
3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts (1974)
4. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818–838 (1999)
5. Barel, A., Manor, R. and Bruckstein, A. M.: Come Together: Multi-agent geometric consensus (Gathering, Rendezvous, Clustering, Aggregation). arXiv:1902.01455 [cs.MA], 2019