Efficient inspection of underground galleries using k robots with limited energy

09/21/2022
by   Sergey Bereg, et al.
0

We study the problem of optimally inspecting an underground (underwater) gallery with k agents. We consider a gallery with a single opening and with a tree topology rooted at the opening. Due to the small diameter of the pipes (caves), the agents are small robots with limited autonomy and there is a supply station at the gallery's opening. Therefore, they are initially placed at the root and periodically need to return to the supply station. Our goal is to design off-line strategies to efficiently cover the tree with k small robots. We consider two objective functions: the covering time (maximum collective time) and the covering distance (total traveled distance). The maximum collective time is the maximum time spent by a robot needs to finish its assigned task (assuming that all the robots start at the same time); the total traveled distance is the sum of the lengths of all the covering walks. Since the problems are intractable for big trees, we propose approximation algorithms. Both efficiency and accuracy of the suboptimal solutions are empirically showed for random trees through intensive numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2022

On Optimal Coverage of a Tree with Multiple Robots

We study the algorithmic problem of optimally covering a tree with k mob...
research
05/16/2019

Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model

Two robots stand at the origin of the infinite line and are tasked with ...
research
09/05/2023

Run for Cover: Dominating Set via Mobile Agents

Research involving computing with mobile agents is a fast-growing field,...
research
03/06/2020

Miniature Robot Path Planning for Bridge Inspection: Min-Max Cycle Cover-Based Approach

We study the problem of planning the deployments of a group of mobile ro...
research
11/07/2022

Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem

In this paper, we consider the Uniform Cost-Distance Steiner Tree Proble...
research
05/05/2023

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem

Uniform cost-distance Steiner trees minimize the sum of the total length...

Please sign up or login with your details

Forgot password? Click here to reset