Scholarlink

The \(\mathcal {OBLOT}\) model in swarm robotics assumes robots are anonymous, disoriented, oblivious, and silent. Their only means of (implicit) communication is transferred to their positioning. These constraints make distributed algorithm design difficult, and prior research has mainly focused on task feasibility, measuring cost in movements or rounds while neglecting computational power. This paper shows that for synchronous robots on finite graphs, unlimited computational power (within finite time) is impactful, enabling a definitive resolution algorithm that solves a broad class of problems with minimal moves and rounds.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Brief Announcement: On the Impact of Unlimited Computational Power in  \(\mathcal {OBLOT}\) : Consequences for Synchronous Robots on Graphs

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Serafino Cicerone,
  • Alessia Di Fonso,
  • Gabriele Di Stefano,
  • Alfredo Navarra

摘要

The \(\mathcal {OBLOT}\) model in swarm robotics assumes robots are anonymous, disoriented, oblivious, and silent. Their only means of (implicit) communication is transferred to their positioning. These constraints make distributed algorithm design difficult, and prior research has mainly focused on task feasibility, measuring cost in movements or rounds while neglecting computational power. This paper shows that for synchronous robots on finite graphs, unlimited computational power (within finite time) is impactful, enabling a definitive resolution algorithm that solves a broad class of problems with minimal moves and rounds.