In this paper, a novel control algorithm to control and autonomously coordinate a Mobile Ad-hoc NETwork (MANET) is presented. By exploiting concept borrowed from graph theory, the presented algorithm focuses on the possibility of controlling only one node of the communication network to collect data (such as a robotic explorer moving in a disaster scenario) while the robotic antennas used to preserve the connectivity with a base camp are autonomously adapting their conguration depending on the obstacles detected in environment.

A Graph-Based Control Scheme of Mobile Ad-hoc Networks for Safe Rescue Missions

FALCONI, RICCARDO;MELCHIORRI, CLAUDIO
2014

Abstract

In this paper, a novel control algorithm to control and autonomously coordinate a Mobile Ad-hoc NETwork (MANET) is presented. By exploiting concept borrowed from graph theory, the presented algorithm focuses on the possibility of controlling only one node of the communication network to collect data (such as a robotic explorer moving in a disaster scenario) while the robotic antennas used to preserve the connectivity with a base camp are autonomously adapting their conguration depending on the obstacles detected in environment.
Proceedings of the 33rd Chinese Control Conference
1270
1275
M. Onofri; R. Falconi; Ju Wang; C. Melchiorri
File in questo prodotto:
Eventuali allegati, non sono esposti

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/11585/522748
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact