Programmnaya Ingeneria最新文献

{"title":"Algorithms for Route Planning and Navigation of Unmanned Aerial Vehicles","authors":"E. A. Petrishchev","doi":"10.17587/prin.15.352-361","DOIUrl":"https://doi.org/10.17587/prin.15.352-361","url":null,"abstract":"A brief overview of the results of recent research published in open sources in the field of route planning and navigation algorithms for unmanned aerial vehicles (UAV) is presented. Works devoted to global and local planning of trajectories taking into account known and detected obstacles in flight, as well as issues of navigation of groups of drones, are considered. Various approaches are analyzed, including graph algorithms (A*, Dijkstra, Rapidly-exploring Random Trees), methods of data mining in real time, potential fields. Special attention is paid to work on the use of neural networks and machine learning, SLAM and multi-agent technologies for planning UAV routes. The advantages and disadvantages of the main groups of algorithms are considered. A conclusion is drawn about the prospects for using hybrid methods, as well as machine learning technologies, to build intelligent UAV traffic control systems.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"8 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141816497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"New Approach to Personalizing Scenarios for a Single-Player 3D Soulslike Game","authors":"A. G. Kravets, A. V. Matokhina, I. N. Plotnikov, N. Salnikova","doi":"10.17587/prin.15.372-384","DOIUrl":"https://doi.org/10.17587/prin.15.372-384","url":null,"abstract":"The results of an analysis of games in the Action/RPG genre and existing methods for personalizing their scenarios are presented, and the stages of developing a computer video game using methods for personalizing its scenarios are outlined. These include strengthening and weakening the player and opponents, as well as changing the environ­ment; approaches and technologies used to solve the problems of developing a system for gameplay personification of game scenarios and developing a software product are revealed. A description of the design stages by the authors of a Soulslike-style game application with the possibility of personalizing its scenarios, the results of functional testing and game performance in terms of the number of frames per second are presented.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"20 15","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141814712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Method of Forming and Algorithm of Saving a Photo Map of the Seafloor during its Photography by an Unmanned Underwater Vehicle","authors":"V. F. Filaretov, E. S. Mursalimov, A. A. Timoshenko, A. Zuev","doi":"10.17587/prin.15.340-351","DOIUrl":"https://doi.org/10.17587/prin.15.340-351","url":null,"abstract":"The paper proposes a new method and algorithm for creating a photo map of the seabed from photographs obtained from on-board photo and video systems of autonomous uninhabited underwater vehicles during fulfillment of their various missions. This photo map is formed from photographs of the seabed by sequentially overlapping them. At the same time, data on the position of the underwater vehicle received from the on-board navigation system at the time of receipt of each photograph is used to position each photo image on the generated photo map. And to rotate and scale these photographic images, data on the orientation of the underwater vehicle in the global coordinate system and its height above the bottom, also obtained from the on-board navigation system, are used. To provide quick access to the photo map, it is proposed to store it on an on-board data storage device in the form of a tile map, widely used when creating interactive geographical maps, for example, Google Maps. However, the formation of a tile map is usually carried out on the basis of all the already received photographic images, as is done with satellite images, which cannot be applied on board underwater vehicles when data from the photo-video system is received sequentially. Therefore, a special algorithm has been developed and implemented that generates a tile map during the movement of the underwater vehicle and updates only the area of the tile map in which the photo is currently being taken. This minimizes the computational load and ensures the formation of a photo map of the bottom using standard on-board computing devices. The conducted semi-natural experiments with data obtained as a result of performing real missions using the MMT-3000 underwater vehicle confirmed the high efficiency of using the developed method and algorithm.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"17 19","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141814452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Methods for Implementing Tactile Sensations in Virtual Space by Integrating Physical Objects with Their Computer Models","authors":"A. Maltsev","doi":"10.17587/prin.15.331-339","DOIUrl":"https://doi.org/10.17587/prin.15.331-339","url":null,"abstract":"The paper presents original methods and approaches for integrating, from the user's point of view, three-dimensional virtual models visible to them in a virtual reality headset, and their physical prototypes. This allows for the addition of some important elements of physical reality to the virtual environment, such as tactile and muscle-motor sensations. Developed solutions are based on the use of such wireless devices as HTC Vive Trackers, which determine their position and orientation in space, and can be placed on various objects of the real world. An original approach to making a tracking system by means of two HTC Base Stations and several Vive Trackers with selecting one anchor element is proposed, as well as new methods for real-time integration of physical reality objects with their virtual models by using functional control schemes with own blocks for trackers. Based on methods and approaches proposed in this work, software modules were implemented. Approbation of these modules in the VirSim virtual environment system, which was developed in Scientific Research Institute for System Analysis of the Russian Academy of Sciences, showed that the solutions developed are adequate and effective, and can have practical application in virtual environment systems and training complexes.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"28 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141815633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Service Browser in Linux Environment","authors":"E. A. Kurako, R. E. Asratian, V. L. Orlov","doi":"10.17587/prin.15.219-228","DOIUrl":"https://doi.org/10.17587/prin.15.219-228","url":null,"abstract":"The key features of using web browsers and service browsers as clients of information systems are considered. A minimal set of methods has been defined that is sufficient for the effective support of client functioning. A comparison is made of the main methods that a browser used as a universal means of providing client applications should include. The basic steps of the service-browser algorithm are presented. The service browser has the full range of necessary ways to process information from the client. At the same time, it is more lightweight than a web browser. However, well-known service browsers operate in a Windows environment, which limits the scope of use. The possibility of transferring and using a C#-based service browser from a Windows environment to a Linux environment is considered. The base problems with the transfer are described. Migration methods are proposed. Using the example of the service module \"System Manager\", which is actually identical in both systems, a comparative analysis of the work was carried out. In order to estimate only the operating time of the service-browser components, a unified database management system is used. The launch of the main modules in the Linux environment is somewhat faster, which is explained by the features of GTK widgets. At the same time, in the Windows environment, it is much easier to develop systems with a complex graphical interface due to a richer palette of visual components. Existing web browsers are quite cumbersome and contain many functions that may be unnecessary for the development of information systems. A compact solution that includes all the necessary methods for use in the client is to use a service-browser. This paper proposes a method for building service browsers in the Linux environment based on the C# language and the Mono package, taking into account the developed additional components.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"65 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141114250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Method of Data Preprocessing on the Basis of Pulse Neural Network to Improve the Accuracy of Water Level Forecast on the Example of Ufa City of the Republic of Bashkortostan","authors":"E. V. Palchevsky, V. V. Antonov, E. A. Makarova, N. A. Kononov, Ya. S. Voyakovskaya","doi":"10.17587/prin.15.265-272","DOIUrl":"https://doi.org/10.17587/prin.15.265-272","url":null,"abstract":"The developed method of data preprocessing based on impulse neural network is considered. The essence of this method is to improve the quality of the initial dataset by minimising data noise. The peculiarity is to improve the accuracy of the predicted values of the time series of water levels obtained at the output of the pulse neural network. Retrospective data were obtained from hydrological posts (river gauge) and automatic stations with the help of FSUE «Centre of Register and Cadastre» from 01.01.1997 to 30.06.2023. On the example of hydrological post 76289 (Ufa) the experiment on forecasting of water levels with the help of the developed system «Flood 2.0» was carried out. The experiment proves the efficiency of the data preprocessing method developed in this study to improve the accuracy of water level forecasts.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"6 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Compilation of Hierarchical Transistor Circuits in SPICE Format","authors":"D. Cheremisinov, L. Cheremisinova","doi":"10.17587/prin.15.115-124","DOIUrl":"https://doi.org/10.17587/prin.15.115-124","url":null,"abstract":"Software tools for compiling and decompiling descriptions of transistor circuits are widely used in computer-aided VLSI design. These two operations are inverse to each other in terms of guiding the design process. Netlist compiling a hierarchical schematics allows its specification to be converted into a functionally equivalent flat netlist. The goal of the decompilation is to reconstruct the hierarchical description of the circuit by extracting subcircuits that are gates or more complex elements. This paper examines the problem of compiling hierarchical MOS transistor circuits. The initial hierarchical schematic and resulting flat netlist are specified in SPICE format. A fast recursive algorithm for compilation of hierarchical descriptions of arbitrary nesting depth and its software implementation in C++ are proposed. During the compilation process, the ports of the circuit substituted in place of the component being compiled are renamed, as well as the names of internal nets and elements in the description of the circuit itself by adding a prefix to them that specifies the path in the hierarchy to the component being compiled. The developed compilation program was tested on a number of practical hierarchical transistor circuits as part of a transistor circuit analyzer for functional equivalence. The results of the compilation program tests make it possible to evaluate the increase in compilation time with increasing complexity of circuits and the depth of subcircuits nesting, as well as to compare the performance of the compilation procedure and its inverse procedure of decompiling the resulting flat netlist.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"18 69","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140237169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Information System for the Selection of Hydropneumatic Capacitive Vessels","authors":"N. A. Fedotov, S. V. Kovalev, O. A. Kovaleva","doi":"10.17587/prin.15.146-154","DOIUrl":"https://doi.org/10.17587/prin.15.146-154","url":null,"abstract":"This article describes an algorithm for the automatic selection of hydropneumatic capacitive vessels used for household and industrial purposes. The suggested informational system makes it possible to reduce the working time spent on the selection of equipment and increase the relevance of the analyzed information. The article discusses a detailed description of the design of pneumohydroaccumulators, as well as provides examples of calculations of their main characteristics. The main task we needed to solve was a multi-criteria choice, and the article provides an overview of methods for solving this problem. In addition to these methods, we analyzed information systems that allow one to select suitable equipment among various alternatives. Based on the analysis of methods and similar software solutions, the authors suggested an information system and an algorithm for automatic selection of hydraulic accumulators by searching for options that meet the parameters specified by the system user. Also, the article discusses the process of purchasing capacitive equipment. There was demonstrated a logical model of the database structure storing the technical characteristics of the equipment which reflects objects of the information system and their connections. In this article we presented and argued the software for development of a specified information system. The development of the information system was based on the \"1С platform: The enterprise\". The task of selecting hydropneumatic capacitive vessels was solved by a request that can be interacted with through a report in the information system. This report allows the user to search for equipment by quantitative and qualitative characteristics: volume, operating pressure, vessel material, flange material, installation type (vertical or horizontal), availability of legs, cost, manufacturer or supplier. The report options allow users to search for equipment both in accordance with the specified parameters and with a deviation from them but only if the parameter is quantitative. The results of the report are ordered by relevance to the criteria specified by the user. The operation of the report query aggregating data was reflected in the flowchart. The article presents a situation where the user solves the selection problem by using capabilities of the report. The problem of multi-criteria selection was formulated in a way to demonstrate how a clear parameter of the report becomes fuzzy, and our solution of it allows you to find more alternative options with sorting by relevance helping you to identify the most suitable pneumohydroaccumulator. This software package was registered in the state registry of computer programs.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"87 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140239549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Methods for Thematic Analysis and Ranking in Information Analysis Systems Based on Relational DBMS","authors":"D. A. Shachnev","doi":"10.17587/prin.15.125-133","DOIUrl":"https://doi.org/10.17587/prin.15.125-133","url":null,"abstract":"The paper presents the models and algorithms for searching, filtering and ranking data in an information analysis system, based on the ontological description of its structure. The rules for filtering and ranking objects based on their boolean, numeric or enumerable properties are specified by the users, and based on these rules SQL queries are evaluated. Another problem considered is taking subject area into account when searching for objects. Adding this allows one to solve many tasks that occur in current research information systems, such as searching for experts in given subject areas or generating reports. A search query can be specified in the form of a set of keywords, and a statistical approach is used for comparing keyword sets.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"18 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140240285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"System for Selecting Tourist Routes Based on Genetic Programming","authors":"A. K. Khoroshavin","doi":"10.17587/prin.15.134-145","DOIUrl":"https://doi.org/10.17587/prin.15.134-145","url":null,"abstract":"One of the most important tasks in tourism is helping tourists plan a trip to a given place. Since it is impossible to visit all places, tourists try to be rational and choose what they find most acceptable and attractive. Each plan has limitations (e. g., length of tour, limited budget) and preferences (e. g., art, culture, historical sites, architecture, modernism) that should be considered when planning your travel trip. This is a special case of the Orientation problem — Tourist trip design problem. The goal is to maximize the total score achieved within a given tour duration limit. This paper focuses on developing a recommendation system that considers users limitations during tour planning and their preferences. Since this problem is an NP-hard problem, heuristic algorithms such as the genetic algorithm (GA) are well suited for solving it. However, this algorithm can take a very long time to find the optimal solution, so this article focuses on developing a greedy strategy of GA to find optimal or near-optimal solutions. Instead of random genetic transformations, the algorithm consciously modifies optimal routes in order to find the desired tour for the users in a shorter time. After this, the developed algorithm was compared with a GA using various generated user profiles. Over 700 locations in Novosibirsk were used as a dataset for making recommendations. These modifications made it possible to obtain optimal routes faster than the standard implementation of the genetic algorithm.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"9 17","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140239430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}