• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

A fault-tolerant communication mechanism for cooperative robots

El Haddad, Joyce; Haddad, Serge (2004), A fault-tolerant communication mechanism for cooperative robots, International Journal of Production Research, 42, 14, p. 2793-2808. http://dx.doi.org/10.1080/00207540410001705185

View/Open
publi34.pdf (193.2Kb)
Type
Article accepté pour publication ou publié
Date
2004
Journal name
International Journal of Production Research
Volume
42
Number
14
Publisher
Taylor & Francis
Pages
2793-2808
Publication identifier
http://dx.doi.org/10.1080/00207540410001705185
Metadata
Show full item record
Author(s)
El Haddad, Joyce
Haddad, Serge
Abstract (EN)
Operations in unpredictable environments require coordinating teams of robots. This coordination implies peer-to-peer communication between the team's robots, resource allocation, and coordination. 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 protocol is constructed by two layered modules (sub-algorithms: a self-stabilizing scheduling and a construction of a minimum-hop path forest). The first 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 (infinite) Discrete Time Markov Chain. Theoretical results in this area are then combined in order to establish the proof of the algorithm. The second self-stabilizing algorithm computes the minimum-hop path between a specific robot's location and the locations of all the other robots of the system in order to implement routing.
Subjects / Keywords
Markov chains; Petri nets; self-stabilization; fault tolerance; multi-robots systems

Related items

Showing items related by title and author.

  • Thumbnail
    Algorithmes de communication auto-stabilisants dans un système de robots mobiles 
    El Haddad, Joyce; Haddad, Serge (2003) Communication / Conférence
  • Thumbnail
    A Fault-Contained Spanning Tree Protocol for Arbitrary Networks 
    El Haddad, Joyce; Haddad, Serge (2004) Communication / Conférence
  • Thumbnail
    Self-Stabilizing Scheduling Algorithm for Cooperating Robots 
    El Haddad, Joyce; Haddad, Serge (2003) Communication / Conférence
  • Thumbnail
    A Self-stabilizing Protocol for an Ad hoc Networks of Mobile Robots 
    Haddad, Serge; El Haddad, Joyce (2002) Document de travail / Working paper
  • Thumbnail
    An algorithm providing fault-tolerance for layered distributed systems 
    Taghelit, Mohamed; Haddad, Serge; Sens, Pierre (1991) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo