Method. Algorithm and Scenarios of Using a Group of UAVs as Base Stations for a Group of Ground Mobile Agents

The paper proposes a method, an algorithm and scenarios of the use of a group of unmanned aerial vehicles (UAVs) as base stations to provide radio communication for a group of ground mobile agents (GMAs) as part of heterogeneous dynamic technical systems (HDTSs) operating in an intelligent environment. The work gives the mathematical description of the problem of choosing sub-optimal (rational) composition and spatial distribution of the UAV s, and calculating the coverage range (radius) for DAV-DAV and DAV - GMA links respectively. The proposed algorithm allows forming the composition of the DAV group (iteratively) to ensure that the coverage for the GMAs when moving in a given region. The algorithm checks the expediency of moving the D A V s (or their operation in current positions), moves additional DAVs from the base or returns unused DAVs to the base (changes their state to inactive), if necessary. The main tasks to be performed by the HDTS (composed of the groups of DAVs and GMAs) have been determined. The paper proposes several scenarios for the use of the UAVs to ensure radio communications for ground mobile agents. The work offers the requirements to the developed solution as part of the security monitor of a HDTS, including the functionality, a set of target parameters, and the main events/possible failures that can occur during the mission

Authors

Institutions

Publication Details

Published
2024-09-08
DOI
https://doi.org/10.1109/rusautocon61949.2024.10694373
Citations
2
Primary Topic
Cybersecurity and Information Systems
Type
article
Field-Weighted Citation Impact
0.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Method. Algorithm and Scenarios of Using a Group of UAVs as Base Stations for a Group of Ground Mobile Agents

Elena Jharko, Mark Mamchenko
2 citations
Cybersecurity and Information Systems
0.70
article

Method. Algorithm and Scenarios of Using a Group of UAVs as Base Stations for a Group of Ground Mobile Agents

Elena Jharko, Mark Mamchenko
article en
2 citations

Abstract

The paper proposes a method, an algorithm and scenarios of the use of a group of unmanned aerial vehicles (UAVs) as base stations to provide radio communication for a group of ground mobile agents (GMAs) as part of heterogeneous dynamic technical systems (HDTSs) operating in an intelligent environment. The work gives the mathematical description of the problem of choosing sub-optimal (rational) composition and spatial distribution of the UAV s, and calculating the coverage range (radius) for DAV-DAV and DAV - GMA links respectively. The proposed algorithm allows forming the composition of the DAV group (iteratively) to ensure that the coverage for the GMAs when moving in a given region. The algorithm checks the expediency of moving the D A V s (or their operation in current positions), moves additional DAVs from the base or returns unused DAVs to the base (changes their state to inactive), if necessary. The main tasks to be performed by the HDTS (composed of the groups of DAVs and GMAs) have been determined. The paper proposes several scenarios for the use of the UAVs to ensure radio communications for ground mobile agents. The work offers the requirements to the developed solution as part of the security monitor of a HDTS, including the functionality, a set of target parameters, and the main events/possible failures that can occur during the mission

V. A. Trapeznikov Institute of Control Sciences (RU)
Openalex Percentile: Top 27%
Cybersecurity and Information Systems
0.70
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.