Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya最新文献_第3页

Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment 未知环境下最小匝数自主移动机器人动态路径规划算法

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.211

G. Rego, R. Voronov

引用次数: 0

Method for solving an optimal control problem in the Mayer form with a quasidifferentiable functional in the presence of phase constraints 具有相位约束的拟可微泛函Mayer型最优控制问题的求解方法

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.110

A. Fominyh, V. Karelin, L. Polyakova

{"title":"Method for solving an optimal control problem in the Mayer form with a quasidifferentiable functional in the presence of phase constraints","authors":"A. Fominyh, V. Karelin, L. Polyakova","doi":"10.21638/11701/spbu10.2023.110","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.110","url":null,"abstract":"The article considers the problem of optimal control of an object described by a system of ordinary differential equations with a continuously differentiable right-hand side and with a nonsmooth (but only a quasidifferentiable) quality functional. The problem is in the Mayer form with either free or partially fixed right end. Piecewise-continuous and bounded controls are supposed to be admissible if they lie in some parallelepiped at any moment of time. The phase coordinates and controls are also subject to mixed pointwise constraints. Phase constraints are taken into account by introducing new variables with known boundary conditions into the system. The standard discretization of the original system and the parametrization of the control are carried out, theorems are given on the convergence of the solution of the discrete system obtained to the desired solution of the continuous problem. Further, in order to study the resulting discrete system, the apparatus of quasidifferential calculus is used and the method of the quasidifferential descent is applied. Examples illustrating the operation of the algorithm are given.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76169199","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}

引用次数: 0

On the influence of the cental trend on the nature of the density distribution of maximum entropy in machine learning 集中趋势对机器学习中最大熵密度分布性质的影响

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.204

A. V. Kvasnov, Anatoliy A. Baranenko, Evgeniy Y. Butyrsky, Uliana P. Zaranik

引用次数: 0

Clearing function in the context of the invariant manifold method 清除函数上下文中的不变流形方法

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-06-22 DOI: 10.21638/11701/spbu10.2023.205

Almaz Mustafin, Aliya Kantarbayeva

{"title":"Clearing function in the context of the invariant manifold method","authors":"Almaz Mustafin, Aliya Kantarbayeva","doi":"10.21638/11701/spbu10.2023.205","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.205","url":null,"abstract":"Clearing functions (CFs), which express a mathematical relationship between the expected throughput of a production facility in a planning period and its workload (or work-inprogress, WIP) in that period have shown considerable promise for modeling WIP-dependent cycle times in production planning. While steady-state queueing models are commonly used to derive analytic expressions for CFs, the finite length of planning periods calls their validity into question. We apply a different approach to propose a mechanistic model for one-resource, one-product factory shop based on the analogy between the operation of machine and enzyme molecule. The model is reduced to a singularly perturbed system of two differential equations for slow (WIP) and fast (busy machines) variables, respectively. The analysis of this slow-fast system finds that CF is nothing but a result of the asymptotic expansion of the slow invariant manifold. The validity of CF is ultimately determined by how small is the parameter multiplying the derivative of the fast variable. It is shown that sufficiently small characteristic ratio ’working machines: WIP’ guarantees the applicability of CF approximation in unsteady-state operation.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"12 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87497215","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}

引用次数: 0

Working groups: Creation and management 工作组:创建和管理

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.414

E. Lezhnina, Gennady M. Khitrov, Elizaveta A. Kalinina, Ivan A. Kononov

引用次数: 0

Random information horizon for a class of differential games with continuous updating 一类持续更新微分对策的随机信息视界

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.304

A. Tur, O. Petrosian

引用次数: 0

ONTOLOGICAL APPROACH APPLICATION TO THE DESIGN OF A GEOSPATIAL EXPERIMENTAL DATABASE FOR INFORMATION SUPPORT OF RESEARCH IN PRECISION AGRICULTURE 本体论方法在精准农业研究信息支持地理空间实验数据库设计中的应用

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.206

O. Mitrofanova, Eugenii P. Mitrofanov, Nataliya A. Bure

{"title":"ONTOLOGICAL APPROACH APPLICATION TO THE DESIGN OF A GEOSPATIAL EXPERIMENTAL DATABASE FOR INFORMATION SUPPORT OF RESEARCH IN PRECISION AGRICULTURE","authors":"O. Mitrofanova, Eugenii P. Mitrofanov, Nataliya A. Bure","doi":"10.21638/11701/spbu10.2022.206","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2022.206","url":null,"abstract":"Thanks to the development of information technologies and computing resources, it became possible to obtain and process big data, including geospatial data. Most research in the field of precision farming is interdisciplinary in nature, with experimental field data used by disparate scientific groups. In this connection, it became necessary to develop a unified web-based system for storing, organizing, and exchanging experimental information between researchers. The first step in achieving this goal was to create a geospatial database. Since the system being developed in the future may require extensions, modifications, adjustments, integration into other projects, it seems appropriate to use the ontology to form the database structure. The most popular tools were used as the main tools: the ontology language OWL (Ontology Web Language), the Protege 5.5 development environment. The main initial information obtained in the course of experimental studies carried out at the biopolygon: weather data, agrochemical indicators (sampling of soil and plants with georeferencing), agrophysical parameters (humidity, electrical conductivity), remote sensing data. Based on the results of the analysis of the current state of research in the field of storage and systematization of experimental information in crop production, as well as a survey of ARI employees, a prototype of the database structure was formed based on the ontological approach. Nine parent classes were defined as the foundation: Field, Crop rotation - experience, Agrotechnology, Yield, Meteo, Ground samples, Orthophoto, Calendar, and Dictionary - units of measurement.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"7 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88302607","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}

引用次数: 0

Smooth approximations of nonsmooth convex functions 非光滑凸函数的光滑近似

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.408

L. Polyakova

引用次数: 0

Аnalysis and synthesis of communication network structures by state enumeration method Аnalysis和状态枚举法合成通信网络结构

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.301

K. Batenkov

{"title":"Аnalysis and synthesis of communication network structures by state enumeration method","authors":"K. Batenkov","doi":"10.21638/11701/spbu10.2022.301","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2022.301","url":null,"abstract":"Оne of the methods of analysis and synthesis of communication network structures is considered, based on the simplest approach to calculating the probability of connectivity - the method of iterating over the states of the network edges. Despite its significant drawback, which consists in the considerable complexity of the calculations carried out, it turns out to be quite in demand both at the stage of debugging new analysis methods and when performing the procedure of sequential synthesis of network structures. The proposed method of sequential synthesis can be presented in the form of stages, at each of which one or more edges (network elements) are added. An increase in the number of edges used leads to an increase in the number of variations of the connectivity functions of a graph with an added edge, and hence to an increase in the complexity of operations for calculating conditional probabilities. At the same time, such a complication makes it possible to more accurately solve the synthesis problem, since not in all situations the sequential addition of edges is equivalent to sorting through all possible alternatives. Both the described method of analyzing the structures of communication networks based on the enumeration of states and the synthesis method differ in the essential simplicity of the implementation of the processes of the calculations carried out. It is this circumstance that allows us to use these methods as reference. The accuracy of the calculations depends solely on the capabilities of hardware and software systems and is in no way limited directly by the method of sorting states. As a result, the calculation of the probability of connectivity with precision accuracy, which is typical for situations of comparative analysis of communication networks with the availability and survivability coefficients of individual network elements close to the threshold values, also turns out to be feasible on the basis of the methods considered.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"41 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82795033","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}

引用次数: 0

Calculation of the ionization potential of zinc and graphene phthalocyaninates on the surface of dielectrics 电介质表面锌和酞菁酸石墨烯的电离势计算

IF 0.6

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2022-01-01 DOI: 10.21638/11701/spbu10.2022.104

D. Kuranov, T. Andreeva, M. Bedrina

{"title":"Calculation of the ionization potential of zinc and graphene phthalocyaninates on the surface of dielectrics","authors":"D. Kuranov, T. Andreeva, M. Bedrina","doi":"10.21638/11701/spbu10.2022.104","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2022.104","url":null,"abstract":"A mathematical model is proposed for calculating the ionization potentials of molecules on the surface of dielectrics in order to quantify changes in the electronic characteristics of materials on a substrate. The semiconductor and photoelectronic properties of nanosystems based on phthalocyanine derivatives are determined by the electronic structure of molecules. Based on the zinc phthalocyaninate molecule ZnC32N8H16, model structures are constructed that increase this molecule by attaching benzene rings ZnC48N8H24, ZnC64N8H32 and a model simulating the film structure of Zn4C120N32 H48. Graphene was considered as a nanostructure modeling a fragment of a monomer lm. The ionization potentials of these compounds on the surface of magnesium oxide, sodium chloride and silicon are calculated. In the presence of a substrate, the ionization potentials of all nanostructures decrease, while the values of the surface ionization potentials remain fundamentally dierent in their magnitude for all compounds. The compound ZnC64N8H32 sprayed onto the surface exhibits the best photoelectronic properties, its surface ionization potential is comparable to graphene.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"8 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79092016","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}

引用次数: 0