The recent development of wireless network architecture and distributed control algorithm allows the onset of large scale robotic application such as monitoring, formation control and flocking, coordination, exploration of unknown environments, and surveillance. In such applications there are many autonomous robots which have capabilities of sensing and acting on the environment and that can communicate with the other robot by wireless communication network defining a Wireless Networked Robotic Systems (in the follows briefly WNR). Usually a robot implements a cooperative algorithm to get some common WNR objective. A widely studied cooperative algorithm allows every robot automatically converge to a common position (consensus or rendezvous) using only local information received from its one hop neighboring robots. Therefore WNR brings together the cooperative control algorithm and the communication capabilities. Despite of a large body of research produced by robotics research community, it is a challenging problem to explore the analysis, the design and evaluation of cooperative algorithm in a more realistic scenario of wireless networked robotic application where the networking and protocol features might affect the overall closed loop WNR performance. In this direction the paper deals with the analysis and design of m-order cooperative control algorithm for fast rendezvous seeking over WNR. Specifically we give a sufficient stability condition of the control algorithm in the presence of heterogeneous time delays affecting the communication through the hops of the WNR. Moreover we analyze the effect of the packet collision phenomena and the presence of background disturbance traffic on the resulting WNR performance. The above sufficient stability condition and analysis, joining with the implementation issues can give a guideline about the design of the rendezvous control algorithm and wireless protocol parameters when we deal with a realistic network environment of WNR. Simulation experiments carried out by a realistic simulation confirm the theoretical findings.

An Algorithm for Fast Rendezvous Seeking of Wireless Networked Robotic Systems / Manfredi, Sabato. - In: AD HOC NETWORKS. - ISSN 1570-8705. - 11:7(2013), pp. 1942-1950. [10.1016/j.adhoc.2012.06.010]

An Algorithm for Fast Rendezvous Seeking of Wireless Networked Robotic Systems

MANFREDI, SABATO
2013

Abstract

The recent development of wireless network architecture and distributed control algorithm allows the onset of large scale robotic application such as monitoring, formation control and flocking, coordination, exploration of unknown environments, and surveillance. In such applications there are many autonomous robots which have capabilities of sensing and acting on the environment and that can communicate with the other robot by wireless communication network defining a Wireless Networked Robotic Systems (in the follows briefly WNR). Usually a robot implements a cooperative algorithm to get some common WNR objective. A widely studied cooperative algorithm allows every robot automatically converge to a common position (consensus or rendezvous) using only local information received from its one hop neighboring robots. Therefore WNR brings together the cooperative control algorithm and the communication capabilities. Despite of a large body of research produced by robotics research community, it is a challenging problem to explore the analysis, the design and evaluation of cooperative algorithm in a more realistic scenario of wireless networked robotic application where the networking and protocol features might affect the overall closed loop WNR performance. In this direction the paper deals with the analysis and design of m-order cooperative control algorithm for fast rendezvous seeking over WNR. Specifically we give a sufficient stability condition of the control algorithm in the presence of heterogeneous time delays affecting the communication through the hops of the WNR. Moreover we analyze the effect of the packet collision phenomena and the presence of background disturbance traffic on the resulting WNR performance. The above sufficient stability condition and analysis, joining with the implementation issues can give a guideline about the design of the rendezvous control algorithm and wireless protocol parameters when we deal with a realistic network environment of WNR. Simulation experiments carried out by a realistic simulation confirm the theoretical findings.
2013
An Algorithm for Fast Rendezvous Seeking of Wireless Networked Robotic Systems / Manfredi, Sabato. - In: AD HOC NETWORKS. - ISSN 1570-8705. - 11:7(2013), pp. 1942-1950. [10.1016/j.adhoc.2012.06.010]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11588/486445
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 11
social impact