Home /Research /A cooperative packet-loss-tolerant algorithm for Wireless Networked Robots rendezvous
OTHER

A cooperative packet-loss-tolerant algorithm for Wireless Networked Robots rendezvous

Sabato Manfredi, Claudio Pascariello, Nicola Roberto Zema, Isabelle Fantoni, Michał Król

Year
2017
Citations
3

Abstract

This paper studies the effects of an unreliable communication channel on the Wireless Networked Robots (WNR) rendezvous problem. The objective is to drive the robots to keep a desired formation through local exchange of information. A decentralized cooperative packet-loss tolerant algorithm is proposed to guarantee robots rendezvous despite the presence of packet losses. Realistic NS-3 (Network Simulator) simulation results validate the the proposed approach effectiveness.

Keywords

RendezvousComputer scienceComputer networkRobotNetwork packetWirelessPacket lossDistributed computingWireless ad hoc networkWireless sensor network

Related papers

Browse all OTHER papers