The topology of look-compute-move robot wait-free algorithms with hard termination-Reference-Cited by-同舟云学术

The topology of look-compute-move robot wait-free algorithms with hard termination

Published:2018-12-15 Issue:3 Volume:32 Page:235-255
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Alcántara Manuel^ORCID,Castañeda Armando,Flores-Peñaloza David,Rajsbaum Sergio

Funder

Universidad Nacional Autónoma de México

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00446-018-0345-3.pdf

Reference44 articles.

1. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)

2. Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

3. Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco, CA (2013)

4. Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, vol. 3(2). Morgan & Claypool, San Rafael (2012)

5. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, LNCS, vol. 1741, pp. 93–102. Springer, Berlin (1999)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Analysis of Multi Agent Systems Agent Based Programming;Journal of Computing and Natural Science;2023-10-05

2. Wait-free approximate agreement on graphs;Theoretical Computer Science;2023-02

3. Tight Bounds for Asymptotic and Approximate Consensus;Journal of the ACM;2021-12-31

4. Discussion on the Integrated Design of Electrical Internet of Things System for Inspection Robots;Proceedings of the 11th International Conference on Computer Engineering and Networks;2021-11-12

5. Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21