Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. N. Agmon, D. Peleg, Fault tolerant gathering algorithms for autonomous mobile robots, in: Proc. 15th Symposium on Discrete Algorithms, SODA 2004, 2004 pp. 1063–1071
2. A distributed memoryless point convergence algorithm for mobile robots with limited visibility;Ando;IEEE Transactions on Robotics and Automation,1999
3. Gathering non-oblivious mobile robots;Cieliebak,2004
4. M. Cieliebak, P. Flocchini, G. Prencipe, N. Santoro, Solving the gathering problem, in: Proc. 30th International Colloquium on Automata, Languages and Programming, ICALP ’03, 2003, pp. 1181–1196
5. R. Cohen, D. Peleg, Convergence properties of the gravitational algorithm in asynchronous robot systems, in: Proc. 12th Annual European Symposium on Algorithms, ESA ’04, 2004, pp. 228–239
Cited by
113 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献