Online Planning for Data Collection in Multi-Robot Systems

Wireless sensors networks have been used for data collection in various civil and military applications. We consider a system where a group of mobile robots and a set of stationary wireless sensor nodes are sparsely deployed in a large unbounded area. In such scenarios, all sensor nodes may not be connected via a communication network. Furthermore, no pair of sensor nodes may be within the transmission range of each other. Therefore, many relay nodes are needed to guarantee the connectivity of the network. However, this approach will affect the lifetime of the system due to the energy consumption by data transmission. In this paper, we study the problem of data collection from the deployed sensors utilizing the robots. The robots do not know the locations of each other and the sensor nodes. Moreover, the sensor nodes do not know the locations of each other and the robots. We propose an online algorithm in which the robot explores the area to find the sensor nodes and collect their stored data. Depending on whether the number of robots is known by the robots in advance or not, we investigate and compare two cases of the problem. In simulations, we empirically evaluate the performance of our algorithm and show that it quantifies as a function of the environment size, the number of robots, and the communication range when both the number of robots and the number of sensors are not known in advance.

Authors

Institutions

Publication Details

Journal
Deu Muhendislik Fakultesi Fen ve Muhendislik
Published
2025-05-22
DOI
https://doi.org/10.21205/deufmd.2025278016
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Planning for Data Collection in Multi-Robot Systems

Deniz Özsoyeller
Deu Muhendislik Fakultesi Fen ve Muhendislik
Energy Efficient Wireless Sensor Networks
article

Online Planning for Data Collection in Multi-Robot Systems

Deniz Özsoyeller
article en

Abstract

Wireless sensors networks have been used for data collection in various civil and military applications. We consider a system where a group of mobile robots and a set of stationary wireless sensor nodes are sparsely deployed in a large unbounded area. In such scenarios, all sensor nodes may not be connected via a communication network. Furthermore, no pair of sensor nodes may be within the transmission range of each other. Therefore, many relay nodes are needed to guarantee the connectivity of the network. However, this approach will affect the lifetime of the system due to the energy consumption by data transmission. In this paper, we study the problem of data collection from the deployed sensors utilizing the robots. The robots do not know the locations of each other and the sensor nodes. Moreover, the sensor nodes do not know the locations of each other and the robots. We propose an online algorithm in which the robot explores the area to find the sensor nodes and collect their stored data. Depending on whether the number of robots is known by the robots in advance or not, we investigate and compare two cases of the problem. In simulations, we empirically evaluate the performance of our algorithm and show that it quantifies as a function of the environment size, the number of robots, and the communication range when both the number of robots and the number of sensors are not known in advance.

Deu Muhendislik Fakultesi Fen ve MuhendislikVol. 27(80)
Yaşar University (TR)
Openalex Percentile: Top 89%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.