Gathering of mobile robots with weak multiplicity detection in presence of crash-faults-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Gathering of mobile robots with weak multiplicity detection in presence of crash-faults

Published:2019-01 Issue: Volume:123 Page:145-155
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Pattanayak Debasish,Mondal Kaushik,H. Ramesh,Mandal Partha Sarathi^ORCID

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference18 articles.

1. Fault-tolerant gathering algorithms for autonomous mobile robots;Agmon;SIAM J. Comput.,2006

2. Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain, Certified impossibility results for byzantine-tolerant mobile robots, in: Stabilization, Safety, and Security of Distributed Systems - 15th Intl. Symposium, SSS 2013, Osaka, Japan, November 13-16, 2013. Proceedings, 2013, pp. 178–190.

3. Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement;Bhagat;J. Discrete Algorithms,2016

4. Subhash Bhagat, Krishnendu Mukhopadhyaya, Fault-tolerant gathering of semi-synchronous robots, in: Proceedings of the 18th International Conference on Distributed Computing and Networking, Hyderabad, India, 2017, January 5-7, 2017, p. 6.

5. Zohir Bouzid, Shantanu Das, Sébastien Tixeuil, Gathering of mobile robots tolerating multiple crash faults, in: IEEE 33rd Intl. Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, 2013, pp. 337–346.

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

1. The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots;Lecture Notes in Computer Science;2024

2. Gathering Over Heterogeneous Meeting Nodes;The Computer Journal;2023-10-05

3. Asynchronous Line Formation in Presence of Faulty Robots;2022 9th International Conference on Networking, Systems and Security;2022-12-20

4. Gathering over Meeting Nodes in Infinite Grid*;Fundamenta Informaticae;2022-09-12

5. Optimal Gathering Over Weber Meeting Nodes in Infinite Grid;International Journal of Foundations of Computer Science;2022-07-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3