Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2025.106019
Ge Guo , Xinxin Zhang , Renyongkang Zhang , Jian Kang
This paper presents an event-triggered distributed optimization (DO) algorithm for consensus constraints and strongly convex local cost functions. The algorithm is derived by means of the zero-gradient-sum mechanism and sliding mode control, which is free from any initial conditions or local minimization. In order to avoid continuous communication and measurement, our algorithm enables the interaction between agents solely at event-triggered instants, resulting in conserving communication resources. Importantly, the proposed method drives system to the optimal consensus state within a predefined time. Simulation results demonstrate the effectiveness of our approach.
{"title":"Event-triggered predefined-time distributed optimization algorithm based on zero-gradient-sum","authors":"Ge Guo , Xinxin Zhang , Renyongkang Zhang , Jian Kang","doi":"10.1016/j.sysconle.2025.106019","DOIUrl":"10.1016/j.sysconle.2025.106019","url":null,"abstract":"<div><div>This paper presents an event-triggered distributed optimization (DO) algorithm for consensus constraints and strongly convex local cost functions. The algorithm is derived by means of the zero-gradient-sum mechanism and sliding mode control, which is free from any initial conditions or local minimization. In order to avoid continuous communication and measurement, our algorithm enables the interaction between agents solely at event-triggered instants, resulting in conserving communication resources. Importantly, the proposed method drives system to the optimal consensus state within a predefined time. Simulation results demonstrate the effectiveness of our approach.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106019"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.106012
Shao Shao , Linying Xiang , Fei Chen
This paper explores finite-time safe control in probabilistic Boolean control networks (PBCNs) through event-triggered control (ETC), presenting necessary and sufficient conditions as a set-based testing framework for problem solvability under ETC. Despite the unsolvability of the safe control problem in PBCNs with non-intermittent feedback controllers, ETC offers a potential solution. The paper contributes an algorithm to calculate the feasible triggering set and corresponding feedback gain matrices. An illustrative example is included to highlight the practical effectiveness of the proposed approach.
{"title":"Finite-time safe control of probabilistic Boolean networks: An event-triggered approach","authors":"Shao Shao , Linying Xiang , Fei Chen","doi":"10.1016/j.sysconle.2024.106012","DOIUrl":"10.1016/j.sysconle.2024.106012","url":null,"abstract":"<div><div>This paper explores finite-time safe control in probabilistic Boolean control networks (PBCNs) through event-triggered control (ETC), presenting necessary and sufficient conditions as a set-based testing framework for problem solvability under ETC. Despite the unsolvability of the safe control problem in PBCNs with non-intermittent feedback controllers, ETC offers a potential solution. The paper contributes an algorithm to calculate the feasible triggering set and corresponding feedback gain matrices. An illustrative example is included to highlight the practical effectiveness of the proposed approach.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106012"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work, we consider a ‘cooperative’ multi-agent Markov decision process (MDP) involving agents. At each decision epoch, all the agents independently select actions in order to minimize a common long-term cost objective. In the policy iteration process of multi-agent setup, the number of actions grows exponentially with the number of agents, incurring huge computational costs. Thus, recent works consider decentralized policy improvement, where each agent improves its decisions unilaterally, assuming that the decisions of the other agents are fixed. However, exact value functions are considered in the literature, which is computationally expensive for a large number of agents with high dimensional state–action space. Thus, we propose approximate decentralized policy iteration algorithms, using approximate linear programming with function approximation to compute the approximate value function for decentralized policy improvement. Further, we consider (both) cooperative multi-agent finite and infinite horizon discounted MDPs and propose suitable algorithms in each case. Moreover, we provide theoretical guarantees for our algorithms and also demonstrate their advantages over existing state-of-the-art algorithms in the literature.
{"title":"Approximate linear programming for decentralized policy iteration in cooperative multi-agent Markov decision processes","authors":"Lakshmi Mandal , Chandrashekar Lakshminarayanan , Shalabh Bhatnagar","doi":"10.1016/j.sysconle.2024.106003","DOIUrl":"10.1016/j.sysconle.2024.106003","url":null,"abstract":"<div><div>In this work, we consider a ‘cooperative’ multi-agent Markov decision process (MDP) involving <span><math><mrow><mi>m</mi><mrow><mo>(</mo><mo>></mo><mn>1</mn><mo>)</mo></mrow></mrow></math></span> agents. At each decision epoch, all the <span><math><mi>m</mi></math></span> agents independently select actions in order to minimize a common long-term cost objective. In the policy iteration process of multi-agent setup, the number of actions grows exponentially with the number of agents, incurring huge computational costs. Thus, recent works consider decentralized policy improvement, where each agent improves its decisions unilaterally, assuming that the decisions of the other agents are fixed. However, exact value functions are considered in the literature, which is computationally expensive for a large number of agents with high dimensional state–action space. Thus, we propose approximate decentralized policy iteration algorithms, using approximate linear programming with function approximation to compute the approximate value function for decentralized policy improvement. Further, we consider (both) cooperative multi-agent finite and infinite horizon discounted MDPs and propose suitable algorithms in each case. Moreover, we provide theoretical guarantees for our algorithms and also demonstrate their advantages over existing state-of-the-art algorithms in the literature.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106003"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.106006
Yike Zhang , Xinmin Song , Wei Xing Zheng
Recursive three-step filters are often used for state estimation of systems with unknown input direct feedthrough, that is, systems where the unknown input simultaneously affect the state equation and measurement equation. However, when the system is disturbed by non-Gaussian noise, especially heavy-tailed impulsive noise, the performance of such recursive three-step filters will deteriorate. This paper proposes a maximum correntropy recursive three-step filter that can effectively handle non-Gaussian measurement noise pollution. The derivation of this filter is based on the traditional recursive three-step filter and utilizes a maximum correntropy criterion and a fixed-point iterative algorithm to simultaneously estimate the unknown input and state. It is shown that when the kernel bandwidths approach infinity, the derived maximum correntropy recursive three-step filter will degenerate into the traditional recursive three-step filter. Finally, the effectiveness and reliability of the proposed algorithm are demonstrated through simulation experiments.
{"title":"Maximum correntropy recursive three-step filter","authors":"Yike Zhang , Xinmin Song , Wei Xing Zheng","doi":"10.1016/j.sysconle.2024.106006","DOIUrl":"10.1016/j.sysconle.2024.106006","url":null,"abstract":"<div><div>Recursive three-step filters are often used for state estimation of systems with unknown input direct feedthrough, that is, systems where the unknown input simultaneously affect the state equation and measurement equation. However, when the system is disturbed by non-Gaussian noise, especially heavy-tailed impulsive noise, the performance of such recursive three-step filters will deteriorate. This paper proposes a maximum correntropy recursive three-step filter that can effectively handle non-Gaussian measurement noise pollution. The derivation of this filter is based on the traditional recursive three-step filter and utilizes a maximum correntropy criterion and a fixed-point iterative algorithm to simultaneously estimate the unknown input and state. It is shown that when the kernel bandwidths approach infinity, the derived maximum correntropy recursive three-step filter will degenerate into the traditional recursive three-step filter. Finally, the effectiveness and reliability of the proposed algorithm are demonstrated through simulation experiments.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106006"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.106015
Francesco Tedesco, Gianfranco Gagliardi, Alessandro Casavola
This paper extends the well-known Command Governor (CG) scheme to the case of rate-bounded persistent disturbances acting as exogenous signals on the plant. The methodology is founded on a multimodal supervisory unit that, during online operations, effectively orchestrates the switching among various CG configurations. These configurations are pre-designed offline based on the magnitude of disturbance occurrences to satisfy the prescribed constraints. To achieve this, a customized notion of transition dwell-time is incorporated within the proposed supervisory framework to determine the necessary duration to facilitate safe transitions among operational modes without compromising constraint satisfaction. Simulation results on two different linear systems indicate that the multimodal CG architecture is markedly less conservative when compared to the traditional single CG scheme.
{"title":"Command governor schemes for dynamical systems subject to rate-bounded disturbances","authors":"Francesco Tedesco, Gianfranco Gagliardi, Alessandro Casavola","doi":"10.1016/j.sysconle.2024.106015","DOIUrl":"10.1016/j.sysconle.2024.106015","url":null,"abstract":"<div><div>This paper extends the well-known Command Governor (CG) scheme to the case of rate-bounded persistent disturbances acting as exogenous signals on the plant. The methodology is founded on a multimodal supervisory unit that, during online operations, effectively orchestrates the switching among various CG configurations. These configurations are pre-designed offline based on the magnitude of disturbance occurrences to satisfy the prescribed constraints. To achieve this, a customized notion of <em>transition dwell-time</em> is incorporated within the proposed supervisory framework to determine the necessary duration to facilitate safe transitions among operational modes without compromising constraint satisfaction. Simulation results on two different linear systems indicate that the multimodal CG architecture is markedly less conservative when compared to the traditional single CG scheme.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106015"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.105991
Florian Meiners, Jürgen Adamy
Unknown differences between system states and observer estimates inherently result in, potentially large, initial errors. This paper deals with the mitigation of this problem in discrete LTI systems by using an approximation of the system state directly calculated from past and present values of its input and output. This information is used in a nonlinear modification of the classical linear state observer structure to reduce the transient error and deviations due to disturbances. We show the stability of this extension in the presence and absence of noise. Additionally, we prove the fulfillment of the separation principle. For the case of noisy measurement, we argue that there is a predictable ideal filter length if the noise variance is known. The ideas are subsequently illustrated in simulation.
{"title":"Improving discrete observers via unreliable direct state reconstruction","authors":"Florian Meiners, Jürgen Adamy","doi":"10.1016/j.sysconle.2024.105991","DOIUrl":"10.1016/j.sysconle.2024.105991","url":null,"abstract":"<div><div>Unknown differences between system states and observer estimates inherently result in, potentially large, initial errors. This paper deals with the mitigation of this problem in discrete LTI systems by using an approximation of the system state directly calculated from past and present values of its input and output. This information is used in a nonlinear modification of the classical linear state observer structure to reduce the transient error and deviations due to disturbances. We show the stability of this extension in the presence and absence of noise. Additionally, we prove the fulfillment of the separation principle. For the case of noisy measurement, we argue that there is a predictable ideal filter length if the noise variance is known. The ideas are subsequently illustrated in simulation.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105991"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.105973
Patricio Guzmán, Esteban Hernández
In this paper we prove the rapid stabilization of an unstable heat equation subjected to an unknown disturbance, which is assumed to be acting at the flux boundary condition. To that end, we design a multivalued feedback law by employing the backstepping method, Lyapunov techniques and the sign multivalued operator, which is used to handle the effects of the unknown disturbance. The well-posedness of the closed-loop system, which is a differential inclusion, is shown with the maximal monotone operator theory.
{"title":"Rapid stabilization of an unstable heat equation with disturbance at the flux boundary condition","authors":"Patricio Guzmán, Esteban Hernández","doi":"10.1016/j.sysconle.2024.105973","DOIUrl":"10.1016/j.sysconle.2024.105973","url":null,"abstract":"<div><div>In this paper we prove the rapid stabilization of an unstable heat equation subjected to an unknown disturbance, which is assumed to be acting at the flux boundary condition. To that end, we design a multivalued feedback law by employing the backstepping method, Lyapunov techniques and the sign multivalued operator, which is used to handle the effects of the unknown disturbance. The well-posedness of the closed-loop system, which is a differential inclusion, is shown with the maximal monotone operator theory.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105973"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143183244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2025.106020
Romeo Ortega , Bowen Yi , Alexey Bobtsov , Anton Pyrkin , Madina Sinetova
We are interested in this paper in the problem of designing a globally convergent adaptive observer for nonlinear systems that contain nonlinear terms in the unmeasurable part of the state. Therefore, they do not fit into the category of state-affine systems for which several adaptive observers have been reported. Furthermore, the system is not in a normal triangular form, hence it is not amenable for high-gain observer designs. To solve the problem we introduce two new technical tools, first, the construction of a mixed linear regression equation, dependent on the unmeasurable state and the unknown parameters. Second, the proof that the error dynamics can be immersed in a lower dimension target dynamics with the desired convergence characteristics. Although it is assumed that the derivative of the unmeasurable part of the state is known, it is shown in the paper that this is the case for several practical examples. Simulation results with a van der Pol-like system are used to illustrate the performance of the proposed adaptive observer.
我们在本文中关注的问题是为非线性系统设计全局收敛的自适应观测器，这些系统的状态不可测量部分包含非线性项。因此，这些系统不属于状态-非线性系统的范畴，目前已有一些自适应观测器被报道过。此外，该系统不是正常的三角形形式，因此不适合高增益观测器的设计。为了解决这个问题，我们引入了两个新的技术工具：第一，构建一个混合线性回归方程，该方程取决于不可测量的状态和未知参数。其次，证明误差动力学可以沉浸在具有理想收敛特性的低维度目标动力学中。虽然本文假定状态不可测部分的导数是已知的，但在几个实际例子中都证明了这一点。本文用一个类似于 van der Pol 的系统的仿真结果来说明所提出的自适应观测器的性能。
{"title":"Adaptive state observers for a class of nonlinear systems: The non-triangular and non-state-affine case","authors":"Romeo Ortega , Bowen Yi , Alexey Bobtsov , Anton Pyrkin , Madina Sinetova","doi":"10.1016/j.sysconle.2025.106020","DOIUrl":"10.1016/j.sysconle.2025.106020","url":null,"abstract":"<div><div>We are interested in this paper in the problem of designing a globally convergent adaptive observer for nonlinear systems that contain nonlinear terms in the <em>unmeasurable</em> part of the state. Therefore, they do not fit into the category of state-affine systems for which several adaptive observers have been reported. Furthermore, the system is not in a normal triangular form, hence it is not amenable for high-gain observer designs. To solve the problem we introduce two new technical tools, first, the construction of a <em>mixed</em> linear regression equation, dependent on the unmeasurable state and the unknown parameters. Second, the proof that the error dynamics can be <em>immersed</em> in a lower dimension target dynamics with the desired convergence characteristics. Although it is assumed that the derivative of the unmeasurable part of the state is known, it is shown in the paper that this is the case for several practical examples. Simulation results with a van der Pol-like system are used to illustrate the performance of the proposed adaptive observer.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106020"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2025.106022
Lulu Li , Haodong Chen , Yuchi Guo , Jianquan Lu
This paper addresses the parameter estimation of probabilistic Boolean control networks (PBCNs) that exhibit unknown and time-varying switching probability distributions (SPDs). We begin by transforming PBCNs with time-varying SPDs into an algebraic form within the framework of algebraic state-space representation (ASSR). In contrast to traditional PBCNs, our investigation incorporates uncertainty through variable switching probabilities. We propose an optimization-based approach for estimating the unknown and time-varying SPD of PBCNs. While existing methods typically focus on estimating Boolean networks (BNs) states, our approach targets the more challenging task of estimating time-varying SPDs. We validate the effectiveness of the proposed method using a simplified apoptosis network model.
{"title":"Parameter estimation of probabilistic Boolean control networks: An optimization-based approach","authors":"Lulu Li , Haodong Chen , Yuchi Guo , Jianquan Lu","doi":"10.1016/j.sysconle.2025.106022","DOIUrl":"10.1016/j.sysconle.2025.106022","url":null,"abstract":"<div><div>This paper addresses the parameter estimation of probabilistic Boolean control networks (PBCNs) that exhibit unknown and time-varying switching probability distributions (SPDs). We begin by transforming PBCNs with time-varying SPDs into an algebraic form within the framework of algebraic state-space representation (ASSR). In contrast to traditional PBCNs, our investigation incorporates uncertainty through variable switching probabilities. We propose an optimization-based approach for estimating the unknown and time-varying SPD of PBCNs. While existing methods typically focus on estimating Boolean networks (BNs) states, our approach targets the more challenging task of estimating time-varying SPDs. We validate the effectiveness of the proposed method using a simplified apoptosis network model.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106022"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.1016/j.sysconle.2024.106008
Shenyu Liu , Sonia Martinez
This work introduces a distributed algorithm for finding least squares (LS) solutions of linear algebraic equations (LAEs). Unlike the methods studied in the literature, we assume that our distributed algorithm has limited computation power and network bandwidth, in the sense that each agent can only solve small-scale LAEs and the group of agents can only exchange messages of small size at a time. Our algorithm contains two layers of nested loops. A part of the solution is updated by a consensus algorithm in the inner loop, while an scheduling sequence in the outer loop decides which part of the solution to be updated. By appealing to the alternating projection theorem, we prove convergence of the proposed algorithm when the scheduling sequence is both spanning and periodic. The accuracy of our algorithm is verified through a numerical example.
{"title":"Solving linear algebraic equations with limited computational power and network bandwidth","authors":"Shenyu Liu , Sonia Martinez","doi":"10.1016/j.sysconle.2024.106008","DOIUrl":"10.1016/j.sysconle.2024.106008","url":null,"abstract":"<div><div>This work introduces a distributed algorithm for finding least squares (LS) solutions of linear algebraic equations (LAEs). Unlike the methods studied in the literature, we assume that our distributed algorithm has limited computation power and network bandwidth, in the sense that each agent can only solve small-scale LAEs and the group of agents can only exchange messages of small size at a time. Our algorithm contains two layers of nested loops. A part of the solution is updated by a consensus algorithm in the inner loop, while an scheduling sequence in the outer loop decides which part of the solution to be updated. By appealing to the alternating projection theorem, we prove convergence of the proposed algorithm when the scheduling sequence is both spanning and periodic. The accuracy of our algorithm is verified through a numerical example.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106008"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号