{"title":"Dynamic Energy-Efficient Zone Routing (DEEZR): A Synergistic Approach for Optimizing Its Networks","authors":"Saravana Sivakumar V, Jeena Jacob I","doi":"10.1134/S0005117925600879","DOIUrl":"10.1134/S0005117925600879","url":null,"abstract":"<p>High energy consumption, fluctuating network circumstances, and scalability concerns all pose substantial challenges to the efficient functioning and scalability of IoT and ITS networks. In such dynamic contexts, existing routing protocols frequently fall short of striking a balance between energy efficiency and adaptability, underscoring the need for a reliable solution. This paper suggests the dynamic energy-efficient zone routing (DEEZR) algorithm, a novel hybrid framework that combines zone-based routing methods with energy-efficient clustering, to address these issues. Based on HEED principles, DEEZR starts with the creation of energy-efficient clusters, using proximity and residual energy to choose the best cluster head. Network lifespan is ensured by the ideal cluster head rotation determined by the prediction model incorporated into the clustering phase. Building on this, DEEZR uses a zone-based routing technique that was influenced by ZRP. Reactive routing is used for intercluster communication to minimize control overhead, while proactive tactics are used for intracluster routing to reduce latency. Furthermore, a gravitational search algorithm (GSA) balances energy consumption and communication efficiency by dynamically optimizing the zone radius while considering node mobility, residual energy, and traffic patterns. Compared to baseline protocols, simulation findings show that DEEZR considerably improves energy usage by 0.3 J, bandwidth by 0.8 mbps, rounds by 4500, and PDR by 99.9%. DEEZR’s dynamic zoning feature optimizes resource usage and guarantees reliable performance by modifying cluster sizes and topologies in response to shifting network conditions. Because of these advancements, DEEZR is especially useful for extensive IoT and ITS applications, providing a sustainable solution for dynamic and energy-constrained settings.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"86 1-4","pages":"72 - 88"},"PeriodicalIF":0.6,"publicationDate":"2026-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147588529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust Static Output Feedback H∞ Control of Linear Discrete-Time Polytopic Systems Using a New Synthesis Condition with Reduced Conservatism","authors":"Mehmet Nur Alpaslan Parlakç","doi":"10.1134/S0005117925600831","DOIUrl":"10.1134/S0005117925600831","url":null,"abstract":"<p>This paper presents a novel approach for the synthesis of robust static output feedback <span>({{H}_{infty }})</span> controllers for linear discrete-time systems subject to polytopic uncertainties and external disturbances. By employing a parameter-dependent Lyapunov function combined with bounding matrix inequalities, we derive sufficient bilinear matrix inequality (BMI) conditions for controller synthesis. To address the inherent nonconvexity of the BMIs, the cone complementarity technique is utilized, resulting in a tractable linear matrix inequality (LMI)-based formulation. Numerical examples illustrate that the proposed method achieves reduced conservatism in disturbance attenuation compared to existing approaches. The proposed framework offers an effective and practical solution for robust static output feedback <i>H</i><sub>∞</sub> control of uncertain discrete-time systems.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"86 1-4","pages":"50 - 58"},"PeriodicalIF":0.6,"publicationDate":"2026-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147588512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust Control of Underactuated Underwater Vehicle","authors":"Alper Bayrak","doi":"10.1134/S0005117925600843","DOIUrl":"10.1134/S0005117925600843","url":null,"abstract":"<p>In this study, a robust control scheme based on the backstepping strategy is developed for underactuated UUVs. The proposed method does not require system model or parameter knowledge and, owing to its simple structure, offers ease of implementation. Through Lyapunov stability analysis, it has been demonstrated that the proposed control guarantees the boundedness of all system states and the ultimate stability of the output error vector. The control method has been validated through simulation studies, which confirm its successful performance.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"86 1-4","pages":"18 - 29"},"PeriodicalIF":0.6,"publicationDate":"2026-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147588525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Output Feedback Design in Discrete-Time Control Systems As an Optimization Problem","authors":"M. V. Khlebnikov","doi":"10.1134/S0005117924700425","DOIUrl":"10.1134/S0005117924700425","url":null,"abstract":"<p>This paper proposes a novel approach to rejecting nonrandom bounded exogenous disturbances in linear discrete-time control systems by means of dynamic output feedback. The approach is based on reducing the original problem to a matrix optimization problem with the gain and observer matrices as the variables. A gradient descent method for finding dynamic output feedback is derived and justified.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 12","pages":"1009 - 1023"},"PeriodicalIF":0.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Features of Service Rate Control in Fork-Join Queueing System","authors":"A. V. Gorbunova, A. V. Lebedev","doi":"10.1134/S0005117924700395","DOIUrl":"10.1134/S0005117924700395","url":null,"abstract":"<p>A classical fork-join queueing system is considered. The model is proposed for determining the optimal cost of such a system, taking into account the need to minimize the average response time simultaneously with reasonable costs for the resources required for this. The term “resources” within the framework of the mathematical model under study means the intensities of service on servers, the cost of which is directly proportional to the system performance, i.e., the rate of service requests. For the special case when the number of subsystems is equal to two, an exact analytical expression for determining the optimal cost is presented, for a more general case when the number of subsystems of a fork-join queueing system is greater than two, equation is obtained, the numerical solution of which allows calculating the desired value. In addition, the asymptotic analysis of the obtained solutions behavior is carried out.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 12","pages":"1056 - 1069"},"PeriodicalIF":0.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AUV Positioning and Motion Parameter Identification Based on Observations with Random Delays","authors":"A. V. Bosov","doi":"10.1134/S0005117924700413","DOIUrl":"10.1134/S0005117924700413","url":null,"abstract":"<p>A stochastic observation system model with random time delays between an arriving observation and the factual state of a moving object is adapted to identify its motion parameters. Equations for optimal Bayesian identification are given. A conditionally minimax nonlinear filter (CMNF) is applied to solve the problem in practice. The design procedure of the CMNF, including the choice of the filter structure, is discussed in detail on an example of autonomous underwater vehicle (AUV) positioning based on observations of stationary acoustic beacons. A computational experiment is carried out on a model close to practical needs using three variants of the filter, namely, the typical approximation of the updating process, the method of linear pseudomeasurements, and the geometric interpretation of angular measurements.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 12","pages":"1024 - 1040"},"PeriodicalIF":0.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. A. Galyaev, L. M. Berlin, P. V. Lysenko, V. G. Babikov
{"title":"Order Statistics of the Normalized Spectral Distribution for Detecting Weak Signals in White Noise","authors":"A. A. Galyaev, L. M. Berlin, P. V. Lysenko, V. G. Babikov","doi":"10.1134/S0005117924700401","DOIUrl":"10.1134/S0005117924700401","url":null,"abstract":"<p>This paper further develops the topic of the authors' previous research. In particular, order statistics of the discrete normalized spectral distribution of the additive white Gaussian noise are investigated to detect a deterministic useful signal in a noise mixture using information features. An additional relationship is established between the discrete spectral distribution of the single-window realization statistics of the white noise. Another novel result consists in exact formulas for calculating the mean and variance of normalized order statistics. Based on the analytical expressions derived, a new formula for calculating the spectral complexity is proposed and the already known one is refined. The theoretical results are verified by statistical simulation.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 12","pages":"1041 - 1055"},"PeriodicalIF":0.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Y. Golubin, V. N. Gridin, D. S. Smirnov, S. A. Bulgakov
{"title":"A Method of Optimal Investment with Stage-by-Stage Conditional Value at Risk (CVaR) Constraints and Known Parameters of Return Vectors","authors":"A. Y. Golubin, V. N. Gridin, D. S. Smirnov, S. A. Bulgakov","doi":"10.1134/S0005117924700383","DOIUrl":"10.1134/S0005117924700383","url":null,"abstract":"<p>The paper investigates a multi-stage investment problem under Conditional Value at Risk (CVaR) constraints with: a given security level for bankruptcy, short selling permission, a normal and an elliptical total return distribution models. The purpose of the work is to find a method of determining the optimal investment in this problem at each stage. As a result of the study, an optimal investment strategy is found and it is shown that the optimal investment portfolio at each stage does not depend on the value of the investor’s capital, but depends only on the number of stage. It is shown that the multi-stage problem can be reduced to a finite number of one-stage optimization problems, which are problems of conic programming. For the one-stage problem, conditions for the non-emptiness of the set of admissible portfolios are given and the Kuhn–Tucker theorem is applied. Additionally, this paper presents a numerical example of finding the optimal investment based on the open data on rates of assert prices of companies on the stock exchange.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 12","pages":"1070 - 1079"},"PeriodicalIF":0.6,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Investigation of Triangle Counts in Graphs Evolving by Clustering Attachment","authors":"M. Vaičiulis, N. M. Markovich","doi":"10.1134/S0005117924700255","DOIUrl":"10.1134/S0005117924700255","url":null,"abstract":"<p>The clustering attachment (CA) model proposed by Bagrow and Brockmann in 2013 may be used as an evolution tool for undirected random networks. A general definition of the CA model is introduced. Theoretical results are obtained for a new CA model that can be treated as the former’s limit in the case of the model parameters α → 0 and <span>(epsilon )</span> = 0. This study is focused on the triangle count of connected nodes at an evolution step <i>n</i>, an important characteristic of the network clustering considered in the literature. As is proved for the new model below, the total triangle count Δ<sub><i>n</i></sub> tends to infinity almost surely as <i>n</i> → ∞ and the growth rate of <i>E</i>Δ<sub><i>n</i></sub> at an evolution step <i>n</i> <span>( geqslant )</span> 2 is higher than the logarithmic one. Computer simulation is used to model sequences of triangle counts. The simulation is based on the generalized Pólya–Eggenberger urn model, a novel approach introduced here for the first time.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 11","pages":"978 - 989"},"PeriodicalIF":0.6,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hierarchical Games and Computational Procedures in the Linear Case","authors":"M. A. Gorelov, F. I. Ereshko","doi":"10.1134/S0005117924700309","DOIUrl":"10.1134/S0005117924700309","url":null,"abstract":"<p>The prerequisites for the emergence of the theory of hierarchical games are described. The models are described and linked to a set of articles that give an idea of the key problems and the fundamental results obtained. Attention is paid to practical applications. The basic concepts and provisions are illustrated by solutions in the case of linear problems. In conclusion, the need for further research in the field of computational methods is noted.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":"85 10","pages":"843 - 856"},"PeriodicalIF":0.6,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}