Self-stabilizing Determinsitic Gathering

Details Self-stabilizing Determinsitic Gathering Self-stabilizing Determinsitic Gathering

2009-05-06

arxiv.org/abs/0905.0747v1

Computer Science

Multiagent Systems

Scientific paper

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.

Affiliated with

Also associated with

No associations

Rating

Self-stabilizing Determinsitic Gathering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-stabilizing Determinsitic Gathering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-stabilizing Determinsitic Gathering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541217