Thumbnail

Self-Stabilizing Scheduling Algorithm for Cooperating Robots

El Haddad, Joyce; Haddad, Serge (2003), Self-Stabilizing Scheduling Algorithm for Cooperating Robots, ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts., IEEE, p. 128-135

View/Open
Type
Communication / Conférence
Date
2003
Conference title
ACS/IEEE International Conference on Computer Systems and Applications (AICCSA'03)
Conference date
2003-07
Conference city
Tunis
Conference country
Tunisie
Book title
ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts.
Publisher
IEEE
ISBN
0-7803-7983-7
Pages
128-135
Metadata
Show full item record
Author(s)
El Haddad, Joyce
Haddad, Serge
Abstract (EN)
We address the problem of autonomous robots which alternate between execution of individual tasks and peer-to-peer communication. Each robot keeps in its permanent memory a set of locations where it can meet some of the other robots. The proposed self-stabilizing algorithm solves the management of visits to these locations ensuring that after the stabilizing phase, every visit to a location will lead to a communication. We model the untimed behaviour of a robot by a Petri net and the timed behaviour by an (in_nite) discrete time Markov chain. Theoretical results in this area are then combined in order to establish the proof of the algorithm.
Subjects / Keywords
Markov chain; Petri net theory; autonomous robots; randomized distributed algorithms; Self-stabilizing systems