—We consider the problem of exploring an unknown environment with a pair of mobile robots. The goal is to make the robots meet (or rendezvous) in minimum time such that there is ...
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
In this paper, we propose a TDMA based simple transmission scheme, which overcomes the effect of the delays caused by the poor synchronization of the relaying nodes over Ricean ch...
– Motion synchronization in mobile robot networks is a fundamental task in distributed multi-robot collaboration. In this paper, we investigate the robustness of synchronous spee...