Trajectory based communication in an ad hoc network of robots

Bracka, Pirro; Midonnet, Serge; Roussel, Gilles

doi:10.1109/wimob.2005.1512878

Cited by 5 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we present the non self-stabilizing scheduling protocol of Bracka et al (2003) for a robotic network. Let us first describe the system model and give some assumptions 2.1 The system model 1.…”

Section: Scheduling Protocolmentioning

confidence: 99%

“…The obvious requirement is that a robot cannot leave a location without establishing a communication with the other robot, henceforth called peer, associated with this location. In the scheduling algorithm of Bracka et al (2003) each robot infinitely visits its locations following the order of its array starting from the first one. Then Bracka et al developed a specific, yet rather lengthy, proof that no (partial or global) deadlock can occur.…”

Section: Scheduling Protocolmentioning

confidence: 99%

See 1 more Smart Citation

A fault-tolerant communication mechanism for cooperative robots

Haddad

2004

International Journal of Production Research

View full text Add to dashboard Cite

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 here 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 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.

show abstract

Section: Scheduling Protocolmentioning

confidence: 99%

Section: Scheduling Protocolmentioning

confidence: 99%

A fault-tolerant communication mechanism for cooperative robots

Haddad

2004

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…The current work is based on Bracka et al [1] scheduling protocol for a robotic network. Let us first describe the hypotheses :…”

Section: A Non Self-stabilizing Scheduling Protocolmentioning

confidence: 99%

“…In [1], the authors develop a specific (and rather lengthy) proof that no (partial or global) deadlock can occur. With the help of Petri net theory, we give a short and simple proof of the algorithm.…”

Section: A Non Self-stabilizing Scheduling Protocolmentioning

confidence: 99%

2003

ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts.

View full text Add to dashboard Cite

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 (infinite) Discrete Time Markov Chain. Theoretical results in this area are then combined in order to establish the proof of the algorithm.

show abstract

An Algorithm for Selecting a Group Leader in Mobile Robots Realized by Mobile Ad Hoc Networks and Object Entropy

Kim

Adaptive and Natural Computing Algorithms

View full text Add to dashboard Cite

Trajectory based communication in an ad hoc network of robots

Abstract: International audienc

Cited by 5 publications

References 13 publications

A fault-tolerant communication mechanism for cooperative robots

A fault-tolerant communication mechanism for cooperative robots

Table of Contents

An Algorithm for Selecting a Group Leader in Mobile Robots Realized by Mobile Ad Hoc Networks and Object Entropy

Contact Info

Product

Resources

About