Thumbnail
Access Restriction
Subscribed

Author El Haddad, J. ♦ Haddad, S.
Sponsorship Arab Comput. Soc. ♦ IEEE Comput. Soc
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Scheduling algorithm ♦ Robots ♦ Peer to peer computing ♦ Distributed algorithms
Abstract Summary form only given. 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/spl I.bar/nite) discrete time Markov chain. Theoretical results in this area are then combined in order to establish the proof of the algorithm.
Description Author affiliation: Univ. Paris Dauphine, France (El Haddad, J.; Haddad, S.)
ISBN 0780379837
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-07-14
Publisher Place Tunisia
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 28.13 kB


Source: IEEE Xplore Digital Library