HEURISTIC ALGORITHMS FOR FINDING THE MINIMUM STEINER TREE IN THE PROBLEM OF OPTIMIZING THE DEPLOYMENT AND MOTION CONTROL OF SEVERAL FLYING INFORMATION AND TELECOMMUNICATION ROBOTS

Abstract

Background. The article explores the problem of combining the motion control of existing FITRs and the deployment of new FITRs so that the number of new FITRs deployed to support the communication of terrestrial subscribers can be minimized. This problem is formulated as the Steiner Minimum Tree Problem (SMT) with existing mobile Steiner points with a constraint on the edges length of the network graph.
 Objective. Improve the mathematical model for ensuring the connectivity of episodic radio networks using FITRs and improve the algorithms for providing the connectivity of episodic radio networks using FITRs.
 Methods. The two algorithms (deploying new FITRs before moving existing FITRs, and moving existing FITRs before deployment of new FITRs) separate the problem and solve the deployment problem, the movement one after the other. In contrast, the algorithm for deploying new FITRs while moving existing FITRs optimizes the deployment problem and the control of movement across and solves these two problems simultaneously.
 Results. A proposed method includes three heuristic algorithms for placing new FITRs, taking into account the movement of existing FITRs (that is, considering scenarios for moving existing FITRs: deploying new FITRs before, after, or during the movement of existing FITRs) for the SMT problem with existing mobile Steiner points with a constraint on the edges length of the network graph.
 Conclusions. Evaluation of the effectiveness of the proposed algorithms in various scenarios shows that algorithms taking into account the movement of existing FITRs are always more efficient (in terms of the number of newly added FITRs) than an algorithm without taking into account the movement of existing FITRs.