Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. N. Agmon, D. Peleg, Fault-tolerant gathering algorithms for autonomous mobile robots, in: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, January 2004, pp. 1063–1071
2. M. Cieliebak, Gathering non-oblivious mobile robots, in: Proc. Latin American Conf. on Theoretical Informatics, 2004, pp. 577–588
3. M. Cieliebak, P. Flocchini, G. Prencipe, N. Santoro, Solving the robots gathering problem, in: Proc. 30th Int. Colloq. on Automata, Languages and Programming, 2003, pp. 1181–1196
4. M. Cieliebak, G. Prencipe, Gathering autonomous mobile robots, in: Proc. 9th Int. Colloq. on Stuctural Information and Communication Complexity, June 2002, pp. 57–72
5. R. Cohen, D. Pleg, Convergence properties of the gravitational algorithm in asynchronous robot systems, in: Proc. 12th European Symp. on Algorithms, 2004, pp. 228–239
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献