The history of the use of mines dates back almost two centuries. The geography of their use and the associated social harm have made them, without exaggeration, a global problem. At the same time, searches were underway for safe methods of their neutralization using various technical means. In so doing, until now, none of the existing methods provides a 100% guarantee of cleaning the territory, which determines the purpose of finding innovative methods and the possibility of combining them with existing ones. Unmanned aerial vehicles (UAVs) are becoming a real modern breakthrough in the field of intellectual achievements. Obtaining optimal results when solving a wide range of different problems, together with the development of composite materials, software, and the latest navigation equipment, make the tasks assigned to them and the expected results more and more difficult. UAVs allow people not to be in life-threatening conditions, to conduct activities beyond their physiological and psychophysiological abilities. The combination of the ability to collect spatial data during flight in various ranges of remote sensing with the possibility of carrying variants of useful equipment opens up prospects for their use in the field of demining territories. Supplementing UAV technologies with modern information systems for processing and analysis of information (expert systems, machine learning, computational intelligence, distributed artificial intelligence, neural networks, etc.), including spatial geographic information systems (GIS), opens up great prospects in the field of humanitarian demining of territories.

This paper suggests an approach to generate pseudo-random sequences based on the discrete-time model of the simple memristive chaotic system. We show that implementing Euler’s and Runge–Kutta’s methods for the simulation solutions gives the possibility of obtaining chaotic sequences that maintain general properties of the original chaotic system. A preliminary criterion based on the binary sequence balance estimation is proposed and applied to separate any binary representation of the chaotic time sequences into random and non-random parts. This gives us the possibility to delete obviously non-random sequences prior to the post-processing. The investigations were performed for arithmetic with both fixed and floating points. In both cases, the obtained sequences successfully passed the NIST SP 800-22 statistical tests. The utilization of the unidirectional asymmetric coupling of chaotic systems without full synchronization between them was suggested to increase the performance of the chaotic pseudo-random number generator (CPRNG) and avoid identical sequences on different outputs of the coupled systems. The proposed CPRNG was also implemented and tested on FPGA using Euler’s method and fixed-point arithmetic for possible usage in different applications. The FPGA implementation of CPRNG supports a generation speed up to 1.2 Gbits/s for a clock frequency of 50 MHz. In addition, we presented an example of the application of CPRNG to symmetric image encryption, but nevertheless, one is suitable for the encryption of any binary source.

In this article we exploit memristor-based chaotic circuits for pseudo-random generators. In particular, the simplest memristor-based chaotic circuit is considered. The circuit consists of only three series elements: inductor, capacitor and memristor. The statistical properties of the generated pseudo-random sequences have been verified by means of the NIST test. The results show that the developed generator can be used in cryptographic applications.

In the paper, the periodicity of pseudo-chaotic implementations in fixed-point calculations is studied using the example of a logistic equation. It was established that with 32-bit represented numbers (three bits - the whole part, 29 bits - the fractional part), the maximum length of the observed cycle is L_(max )< 2^14 iterations, and the space of possible states of the chaotic system after the completion of the transition process is limited S≈2^14 different numbers. Histograms of the duration of transient processes preceding the exit of the trajectory into a cyclic orbit are constructed. It was found that the maximum durations of the transition process do not exceed (2Lmax, 4Lmax). The paper also demonstrates and substantiates the expediency of using a dynamic threshold when forming binary sequences based on chaotic numbers using the threshold method. It is shown that the criterion for the balance of the binary representation of chaotic sequences enables the optimal choice of the number of high-order bits that must be discarded in order to obtain a uniform distribution. Approaches to increase the cyclicity of period of digital implementations of chaotic systems are analyzed. It is shown that the period of the external disturbance must be coordinated with the durations of the cycles observed in the chaotic system. The results of the work show the limitations of chaotic systems, which must be correctly taken into account when using them in cryptography.

Operating systems (OS) play a major role in the functionality and performance of unmanned aerial vehicles, serving as their central nervous system to manage various components and functions. This article provides a comprehensive overview of embedded operating systems (EOS), real-time operating systems (RTOS), and cloud operating systems (Cloud OS) intended for unmanned aerial vehicles (UAVs). In particular, from the perspective of practical use, both the strengths and weaknesses of the following operating systems were analyzed: PX4 Autopilot, ArduPilot, NuttX, Robot Operating System (ROS), FreeRTOS, MicroPython, and ChibiOS/RT. A general overview of the potential practical applications of Cloud OS is also presented. Therefore, one can gain insights into the criteria for selecting operating systems, as well as their strengths and limitations. It is important to understand that the role of an operating system in UAV development is crucial for optimizing performance, safety, and efficiency across various applications, from agricultural monitoring to security surveillance.

In this paper, we create a distribution of the embedded operating system for Cyclone V SoC FPGA platforms based on the Linux kernel. A comparison of well-known open-source tools for creating embedded operating systems is demonstrated. A step-by-step example of embedded OS synthesis using custom scripts and a simplified pipeline is given, which increases the adaptability of the target system. The possibility of adding hardware-oriented tools for interaction between SoC and FPGA is demonstrated. This makes it possible to create a wide range of hardware applications with remote access. The proposed approach is also vendor-independent and can be applied to other FPGA SoCs. The final system, although not significantly different in resource requirements from Yocto, is more adaptable and can be ported to the Yocto base if necessary. This allows us to make the most of the Full Custom approach, ensuring an optimal balance between development efficiency, responsiveness to changes, and system resource requirements.