We study the impact of restricting the class of separator problems on the look-compute-move mobile robot model hierarchy. In particular, we show that reachability specifications are sufficient to separate the semi-synchronous and the asynchronous model variants when robots agree on the unit-distance, but the two model variants are equivalent when considering terminating problems and no coordinate system agreement.

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

On Restricting Separator Problems in the OBLOT Computational Landscape

  • Quentin Bramas,
  • Sébastien Tixeuil

摘要

We study the impact of restricting the class of separator problems on the look-compute-move mobile robot model hierarchy. In particular, we show that reachability specifications are sufficient to separate the semi-synchronous and the asynchronous model variants when robots agree on the unit-distance, but the two model variants are equivalent when considering terminating problems and no coordinate system agreement.