LHLeonid F. Hulianytskyi

Leonid F. Hulianytskyi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Leonid F. Hulianytskyi has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • UAV SWARMS AND THEIR CHARACTERISTICS

    by L.F. Hulianytskyi

    The article examines the key challenges in the planning and implementation of missions for UAV groups, primarily their swarms, and the main approaches to formulating and resolving the emerging problems, based on scientific publications of recent years. Definitions for a number of terms used in this field are proposed. Aspects of drone mission planning are considered, using the proposed system of swarm characteristics. Keywords: UAV, drone group, drone team, UAV swarm, swarm mission planning, mission specialization.

  • SEARCH DIVERSIFICATION IN ACO ALGORITHMS AND ITS APPLICATION

    by Hulianytskyi L.F.

    This paper presents a novel approach to the development of diversified ant colony optimization (ACO) algorithms, which are among the most widely used methods in combinatorial optimization. The proposed diversification in ACO algorithms is based on considering multiple options for extending the current solution fragment by incorporating several vertices of the problem graph into the route instead of just one, as is typically done. The ability of ants to foresee multiple search steps ahead increases the likelihood of avoiding suboptimal solutions and finding more accurate ones. This approach is applied to create metaheuristic algorithms for solving various combinatorial optimization problems. The results of computational experiments on a series of applied combinatorial optimization problems across different classes demonstrate the successful modification of the known ACO algorithms. Keywords: combinatorial optimization, Ant Colony Optimization, routing, traveling salesman problem, UAV, optimization of flight routes, computational experiment.

  • Open Access

    About the Problem of Drone Routing

    by Leonid Hulianytskyi, Natalia Byshovets, Olena Zhdanova

    Introduction. Unmanned aerial vehicles (UAVs) are attracting considerable interest in a variety of areas, such as logistics, defence, search and rescue, agriculture, manufacturing and environmental monitoring. The effective use of these flexible resources requires the development of models and methods that ensure the creation of safe and efficient flight routes for UAVs. The purpose of the paper is to study the current state of UAV routing problems, including an analysis of existing research in this field and systematization of scientific approaches and algorithms as well as the formalization of some practically important problems. Results. A classification of UAV routing problems has been proposed based on various criteria, including the number of UAVs, the number of base locations, UAV recharging constraints, additional conditions, evaluation criteria, and the constancy of conditions. An analysis and classification of UAV routing problems are presented, highlighting the significance of these problems in various fields such as logistics, defense, agriculture, and others. Meaningful formulations of several interrelated practical UAV routing problems have been proposed, and their formalization has been carried out in the form of specific mathematical models. Conclusions. The development of unmanned aerial vehicles (UAVs) is a dynamic and relevant area with a wide range of applications. The paper systemises scientific approaches and algorithms for optimising UAV routes, analyses and classifies routing problems according to various criteria. The proposed classification allows for a better understanding of the structure of the problems and the selection of appropriate methods for solving them. The main result is the formalisation of a number of practical UAV routing problems in the form of mathematical models, which allows developing effective algorithms for solving these problems, increasing the efficiency of UAVs in various fields, such as logistics, defence and agriculture. Keywords: route optimization, unmanned aerial vehicle, drone, mathematical model, flight resource, combinatorial optimization, monitoring, logistics.


  • Open Access

    Route Optimization in Mission Planning for Hybrid DRONE+VEHICLE Transport Systems

    by Leonid Hulianytskyi, Oleg Rybalchenko

    Introduction. In the context of modern technologies and the widespread use of unmanned aerial vehicles (UAVs) in various fields of activity, the study of optimizing their mission planning becomes increasingly relevant. This is particularly true for hybrid systems where UAVs are integrated with ground transportation ("Drone+Vehicle"). The article deals with the aspects of optimizing the mission routes of a drone that can be transported by a specialized vehicle, performing reconnaissance or maintenance missions for the presented targets. A mathematical model has been developed that allows integrating various planning stages, including determining the direction of the vehicle based on the data obtained during the drone's mission. The purpose of the paper is development and application of mathematical and software-algorithmic tools, in particular, based on the ideas of swarm intelligence, in planning operations for the inspection or maintenance of a given set of objects using hybrid systems "Drone+Vehicle". Results. A mathematical model of the problem of routing hybrid systems of the "Drone+Vehicle" type has been formed. Greedy type algorithms, deterministic local search and ant colony optimization (ACO) to solve the problem are proposed, implemented and analyzed. A computational experiment has been conducted to demonstrate the advantages of the AMC algorithm in terms of speed and efficiency, even for problems of high dimensionality. Conclusions. The proposed approach allows to cover several stages of planning the mission of a hybrid "Drone+Vehicle" system with an aggregated mathematical model. The developed mathematical model also covers the problem of choosing the direction of further movement of a vehicle located in a certain place, depending on the analysis of the results of the inspection of specified targets that may contain objects for inspection or maintenance. To solve the formulated combinatorial optimization problem, greedy type, deterministic local search, and OMC algorithms have been developed. The results of the computational experiment demonstrate the superiority of the OMC algorithm over the combined "greedy + deterministic local search" algorithm. An important future direction of research is the development and application of routing models and algorithms that take into account the obstacles present on the ground. The developed mathematical apparatus allows to move on to consider problems in which the locations of the vehicle's base on the route are not specified but are determined depending on the configuration of the targets. Keywords: unmanned aerial vehicles, hybrid systems, mission planning, route optimization, mathematcal modeling, ant colony optimization, logistics.


  • Planning of Logistics Missions of the “UAV+Vehicle” Hybrid Systems

    by V. P. Horbulin, L. F. Hulianytskyi, I. V. Sergienko


  • Open Access

    An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud

    by Leonid Hulianitskyi, Vyacheslav Korolyov, Oleksandr Khodzinskyi

    Introduction. The hope of solving the problem of the avalanche-like growth of requirements for computing power, essential for solving complex routing problems and other problems of combinatorial optimization, relies on the latest quantum computers, in the development of which governments and corporations invest multi-billion investments. The article examines modern routing algorithms and performs their analysis and verification, if the authors of the algorithm provided appropriate test programs. The purpose of the article is to review the current state of development in the field of development of routing algorithms for hybrid quantum-classical clouds, analyze them and propose a classification of algorithms. Results. Modern quantum computers (QCs) make it possible to find approximate solutions to some of mathematical problems faster than classical computers. The inaccuracy of the solutions obtained by the QC is a consequence of physical and technological limitations: calculation errors are caused by thermal noise, a small number of computational elements - qubits and connections between them, which requires the decomposition of the problem and the use of heuristic algorithms. The analysis of approaches to the solution of optimization problems on QC allows us to single out: quantum response and variational search of eigenvalues based on quantum logic gates as the general directions of development of the vast majority of algorithms for solving routing problems. The considered algorithms reduce the vehicle routing problem to a quadratic unconstrained binary optimization problem, which is isomorphic to the Hamilton-Ising model. In this form, the problem is suitable for embedding in QC, which finds an approximate solution that has the best statistical reliability or corresponds to the quantum state with the lowest energy. As a separate class, vehicle routing algorithms for classical computers that use quantum computing to accelerate problem solving can be distinguished. For example, neural networks that calculate weighting factors using QC or an ant algorithm that calculates a pheromone trail in a hybrid cloud. It should be mentioned the quantum-inspired algorithms, which are based on software tools for the simulation of QC and the corresponding libraries and allow creating an effective class of algorithms for solving problems of vehicle routing. Conclusions. Combining hardware quantum annealing with a number of software tools for calculating optimization problems for classical computers in a hybrid quantum-classical cloud service allows to obtain advantages in speed and accuracy of some types of complex optimization problems of a commercial scale, in particular, routing vehicles, which is already bringing substantial profits to a number of corporations.


  • The Improved Algorithm for Reducing the UAV Swarm Radio Visibility

    by Leonid Hulianytskyi, Maksym Ogurtsov

    This work presents the developed set of improved data transmission algorithms with adaptive signal power for protection against radio-electronic warfare and reducing the radio visibility of a UAV swarm, the purpose of which is to minimize the power levels of swarm members (UAVs) transmitters, and to optimize data transmission routes within the swarm Relevance of this research is high because of heavy losses, that UAVs facing during the surveillance and strike missions during a full-scale military combat. The requirements to UnACs to ensure the possibility of the developed family of data transmission algorithms usage for protection against radio-electronic warfare and reducing the radio visibility of a UAV swarm are formulated. The data transmission with reduced signal power problem for protection against radio-electronic warfare and reducing the radio visibility of a UAV swarm was formulated as an optimization problem. The improved UAV swarm network initialization algorithm for data transmission and radio visibility reduction is developed. The improved algorithms that will support further operation of an UAV swarm for data transmission and radio visibility reduction during a mission are developed and practically tested. There were analyzed advantages and disadvantages of the improved algorithms compared to its previous version.