Learn More
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion ac-tuators. Those robots must collaborate to reach a single vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ring-shaped networks suggest that there exists a tradeoff(More)
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of(More)
We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non-atomic CORDA model with asynchronous fair scheduling. In(More)
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory corruption, and topology change. Because such transient faults occur so frequently in mobile ad hoc networks, distributed algorithms on them(More)