Pub Date : 2025-02-17DOI: 10.1109/LCSYS.2025.3542684
Vatsal Kedia;Sneha Susan George;Debraj Chakraborty
In this letter, the problem of reducing the computational complexity of a recently developed data-driven predictive control scheme is considered. For this purpose, a randomized data compression technique is proposed, which makes the dimension of the decision variable independent of the recorded data size, thereby reducing the complexity of the online optimization problems in data-driven predictive control to that of classical model-based predictive control. The proposed method outperforms other competing complexity reduction schemes in benchmark tests, while guaranteeing similar control performance and stability properties.
{"title":"Fast Data-Driven Predictive Control for LTI Systems: A Randomized Approach","authors":"Vatsal Kedia;Sneha Susan George;Debraj Chakraborty","doi":"10.1109/LCSYS.2025.3542684","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3542684","url":null,"abstract":"In this letter, the problem of reducing the computational complexity of a recently developed data-driven predictive control scheme is considered. For this purpose, a randomized data compression technique is proposed, which makes the dimension of the decision variable independent of the recorded data size, thereby reducing the complexity of the online optimization problems in data-driven predictive control to that of classical model-based predictive control. The proposed method outperforms other competing complexity reduction schemes in benchmark tests, while guaranteeing similar control performance and stability properties.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3416-3421"},"PeriodicalIF":2.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143521538","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}
Pub Date : 2025-02-11DOI: 10.1109/LCSYS.2025.3540947
Pengcheng Chen;Jiye Zhang;Cailu Wang
This letter proposes the feedback regulation of max-plus linear systems, and designs the regulator for irreducible systems that ensures the system can directly enter a uniform periodic steady state, regardless of the initial input. The feedback regulator configures the period and transient of the system to become 1. Moreover, it preserves the eigenvalues and eigenvectors of the original system. The proposed method is constructive and has polynomial complexity. The feedback regulation approach is applied in manufacturing systems to streamline operations and improve consistency.
{"title":"Feedback Regulation for Irreducible Max-Plus Linear Systems","authors":"Pengcheng Chen;Jiye Zhang;Cailu Wang","doi":"10.1109/LCSYS.2025.3540947","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3540947","url":null,"abstract":"This letter proposes the feedback regulation of max-plus linear systems, and designs the regulator for irreducible systems that ensures the system can directly enter a uniform periodic steady state, regardless of the initial input. The feedback regulator configures the period and transient of the system to become 1. Moreover, it preserves the eigenvalues and eigenvectors of the original system. The proposed method is constructive and has polynomial complexity. The feedback regulation approach is applied in manufacturing systems to streamline operations and improve consistency.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3404-3409"},"PeriodicalIF":2.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455316","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}
To improve the dynamic performance and disturbance rejection capability of the permanent magnet synchronous motor (PMSM) system, an adaptive super-twisting nonsingular terminal sliding mode control (AST-NTSMC) approach based on the disturbance compensation technique is investigated in this letter. Firstly, the dynamic model of PMSM system under non-cascade structure is formulated, and two high-order sliding mode observers (HOSMOs) are designed to estimate and compensate for both matched and mismatched disturbances within the system. A composite non-cascade speed controller is subsequently developed. While a larger switching gain coefficient can enhance dynamic performance and disturbance rejection ability, it often tends to increase chattering issues. To tackle this challenge, an adaptive mechanism is proposed for the PMSM speed regulation system, allowing dynamic adjustment of the gain coefficient during the sliding mode reaching phase, which significantly enhances both dynamic and steady-state performance compared to the conventional NTSMC method. Experimental results validate the effectiveness of the proposed control approach.
{"title":"Adaptive Super-Twisting Sliding Mode Control With Disturbance Compensation for Speed Regulation of PMSM System","authors":"Yaping He;Zhongkun Cao;Jianliang Mao;Kun Liang;Chuanlin Zhang","doi":"10.1109/LCSYS.2025.3541167","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3541167","url":null,"abstract":"To improve the dynamic performance and disturbance rejection capability of the permanent magnet synchronous motor (PMSM) system, an adaptive super-twisting nonsingular terminal sliding mode control (AST-NTSMC) approach based on the disturbance compensation technique is investigated in this letter. Firstly, the dynamic model of PMSM system under non-cascade structure is formulated, and two high-order sliding mode observers (HOSMOs) are designed to estimate and compensate for both matched and mismatched disturbances within the system. A composite non-cascade speed controller is subsequently developed. While a larger switching gain coefficient can enhance dynamic performance and disturbance rejection ability, it often tends to increase chattering issues. To tackle this challenge, an adaptive mechanism is proposed for the PMSM speed regulation system, allowing dynamic adjustment of the gain coefficient during the sliding mode reaching phase, which significantly enhances both dynamic and steady-state performance compared to the conventional NTSMC method. Experimental results validate the effectiveness of the proposed control approach.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3410-3415"},"PeriodicalIF":2.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143471816","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}
This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.
{"title":"Decentralized Fault Diagnosis for Constant-Time Automata","authors":"Shaowen Miao;Aiwen Lai;Jan Komenda;Sébastien Lahaye","doi":"10.1109/LCSYS.2025.3538737","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3538737","url":null,"abstract":"This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3392-3397"},"PeriodicalIF":2.4,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422951","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}
Pub Date : 2025-01-28DOI: 10.1109/LCSYS.2025.3535787
N. Naveen Mukesh;Deepak U. Patil;Debasattam Pal
In this letter, a data-driven solution to the disturbance decoupling problem (DDP) is provided. The required data consists of initial conditions, input, and output which is assumed to be corrupted by an unknown disturbance signal. A criterion is derived to check solvability of DDP just using the experimental (noisy) data. Further, data-driven computation of the largest controlled invariant subspace contained in the kernel of the output matrix is provided. The necessary state feedback matrices (often called friends of this subspace) for solving the DDP, are also computed using the experimental (noisy) data. In the process, several novel equivalent conditions for solvability of DDP are also established.
{"title":"Data-Driven Disturbance Decoupling Problem","authors":"N. Naveen Mukesh;Deepak U. Patil;Debasattam Pal","doi":"10.1109/LCSYS.2025.3535787","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3535787","url":null,"abstract":"In this letter, a data-driven solution to the disturbance decoupling problem (DDP) is provided. The required data consists of initial conditions, input, and output which is assumed to be corrupted by an unknown disturbance signal. A criterion is derived to check solvability of DDP just using the experimental (noisy) data. Further, data-driven computation of the largest controlled invariant subspace contained in the kernel of the output matrix is provided. The necessary state feedback matrices (often called friends of this subspace) for solving the DDP, are also computed using the experimental (noisy) data. In the process, several novel equivalent conditions for solvability of DDP are also established.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3374-3379"},"PeriodicalIF":2.4,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422852","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}
Pub Date : 2025-01-27DOI: 10.1109/LCSYS.2025.3534476
Zhaowen Xu;Yibo Yu;Zheng-Guang Wu;Ying Shen
The objective of this letter is to address the event-based ${H}_{infty }$ control problem for continuous-time hidden Markov jump systems. A continuous-time hidden Markov model is introduced where parameters can be tuned to fully describe the asynchronous phenomenon between the controller and system modes. To reduce the communication load on the network, an event-triggered scheme is integrated into the design of the asynchronous controller. By employing the Lyapunov-Krasoviskii functional approach, sufficient conditions are derived for constructing an event-based mode-dependent controller that ensures ${H}_{infty }$ performance for the closed-loop system under event-triggered scheme. Finally, to substantiate the effectiveness of the proposed results and to demonstrate its potential application in real-world systems, a tunnel diode circuit model is introduced.
{"title":"Asynchronous Event-Triggered H∞ Control for Continuous-Time Markov Jump Systems","authors":"Zhaowen Xu;Yibo Yu;Zheng-Guang Wu;Ying Shen","doi":"10.1109/LCSYS.2025.3534476","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3534476","url":null,"abstract":"The objective of this letter is to address the event-based <inline-formula> <tex-math>${H}_{infty }$ </tex-math></inline-formula> control problem for continuous-time hidden Markov jump systems. A continuous-time hidden Markov model is introduced where parameters can be tuned to fully describe the asynchronous phenomenon between the controller and system modes. To reduce the communication load on the network, an event-triggered scheme is integrated into the design of the asynchronous controller. By employing the Lyapunov-Krasoviskii functional approach, sufficient conditions are derived for constructing an event-based mode-dependent controller that ensures <inline-formula> <tex-math>${H}_{infty }$ </tex-math></inline-formula> performance for the closed-loop system under event-triggered scheme. Finally, to substantiate the effectiveness of the proposed results and to demonstrate its potential application in real-world systems, a tunnel diode circuit model is introduced.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3386-3391"},"PeriodicalIF":2.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422851","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}
Pub Date : 2025-01-27DOI: 10.1109/LCSYS.2025.3535379
Ziqi Yang;Lihua Xie
This letter presents a nonlinear disturbance observer-parameterized control barrier function (DOp-CBF) designed for a robust safety control system under external disturbances. This framework emphasizes that the safety bounds are relevant to the disturbances, acknowledging the critical impact of disturbances on system safety. This letter incorporates a disturbance observer (DO) as an adaptive mechanism of the safety bounds design. Instead of considering the worst-case scenario, the safety bounds are dynamically adjusted using DO. The forward invariance of the proposed method regardless of the observer error is ensured, and the corresponding optimal control formulation is presented. The performance of the proposed method is demonstrated through simulations of a cruise control problem under varying road grades. The influence of road grade on the safe distance between vehicles is analyzed and managed using a DO. The results demonstrate the advantages of this approach in maintaining safety and improving system performance under disturbances.
{"title":"Disturbance Observer-Parameterized Control Barrier Function With Adaptive Safety Bounds","authors":"Ziqi Yang;Lihua Xie","doi":"10.1109/LCSYS.2025.3535379","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3535379","url":null,"abstract":"This letter presents a nonlinear disturbance observer-parameterized control barrier function (DOp-CBF) designed for a robust safety control system under external disturbances. This framework emphasizes that the safety bounds are relevant to the disturbances, acknowledging the critical impact of disturbances on system safety. This letter incorporates a disturbance observer (DO) as an adaptive mechanism of the safety bounds design. Instead of considering the worst-case scenario, the safety bounds are dynamically adjusted using DO. The forward invariance of the proposed method regardless of the observer error is ensured, and the corresponding optimal control formulation is presented. The performance of the proposed method is demonstrated through simulations of a cruise control problem under varying road grades. The influence of road grade on the safe distance between vehicles is analyzed and managed using a DO. The results demonstrate the advantages of this approach in maintaining safety and improving system performance under disturbances.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3380-3385"},"PeriodicalIF":2.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422952","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}
Pub Date : 2025-01-27DOI: 10.1109/LCSYS.2025.3535301
Rio Aurachman;Giuliano Punzo
Networks of social interactions can drive the dynamics of socio-technical systems. In groups, where strategic decisions are shaped by the tension between cooperation and defection, the replicator equation serves as a valuable tool underpinning the modelling of evolutionary dynamics of strategies. In this letter, we integrate the replicator dynamics with an SI (Susceptible-Infected) model for information diffusion in general networks. Considering also conformity, we model the evolution of cooperation in a public good game. The trajectories of the resulting dynamical systems converge to consensus about an internal point solution in the snowdrift setting and boundary solutions of full cooperation or full defection in social dilemmas, asymmetric games and stag hunt settings. Through the application of the Lyapunov stability theorem, we establish the stability of the internal equilibrium point. We then examine the basin of attraction obtaining the conditions leading to full cooperation. This letter is relevant for the study of social dynamics in groups where strategic interactions are mediated by conformity.
{"title":"Strategy Diffusion and Conformity in Evolutionary Dynamics on General Networks","authors":"Rio Aurachman;Giuliano Punzo","doi":"10.1109/LCSYS.2025.3535301","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3535301","url":null,"abstract":"Networks of social interactions can drive the dynamics of socio-technical systems. In groups, where strategic decisions are shaped by the tension between cooperation and defection, the replicator equation serves as a valuable tool underpinning the modelling of evolutionary dynamics of strategies. In this letter, we integrate the replicator dynamics with an SI (Susceptible-Infected) model for information diffusion in general networks. Considering also conformity, we model the evolution of cooperation in a public good game. The trajectories of the resulting dynamical systems converge to consensus about an internal point solution in the snowdrift setting and boundary solutions of full cooperation or full defection in social dilemmas, asymmetric games and stag hunt settings. Through the application of the Lyapunov stability theorem, we establish the stability of the internal equilibrium point. We then examine the basin of attraction obtaining the conditions leading to full cooperation. This letter is relevant for the study of social dynamics in groups where strategic interactions are mediated by conformity.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3398-3403"},"PeriodicalIF":2.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422850","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}
Pub Date : 2025-01-23DOI: 10.1109/LCSYS.2025.3533383
Shriram Srinivasan;Kaarthik Sundar
The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. This letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.
{"title":"Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations","authors":"Shriram Srinivasan;Kaarthik Sundar","doi":"10.1109/LCSYS.2025.3533383","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3533383","url":null,"abstract":"The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. This letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3368-3373"},"PeriodicalIF":2.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422795","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}
A wide variety of data can be represented using third-order tensors. Applications of these tensors include chemometrics, psychometrics, and image/video processing. However, traditional data-driven frameworks are not naturally equipped to process tensors without first unfolding or flattening the data, which can result in a loss of crucial higher-order structural information. In this letter, we introduce a novel framework for data-driven analysis of T-product-based dynamical systems (TPDSs), where the system evolution is governed by the T-product between a third-order dynamic tensor and a third-order state tensor. In particular, we examine the data informativity of TPDSs concerning system identification, stability, controllability, and stabilizability and illustrate significant computational improvements over unfolding-based approaches by leveraging the unique properties of the T-product. The effectiveness of our framework is demonstrated through both synthetic and real-world examples.
{"title":"Data-Driven Analysis of T-Product-Based Dynamical Systems","authors":"Xin Mao;Anqi Dong;Ziqin He;Yidan Mei;Shenghan Mei;Ren Wang;Can Chen","doi":"10.1109/LCSYS.2025.3532470","DOIUrl":"https://doi.org/10.1109/LCSYS.2025.3532470","url":null,"abstract":"A wide variety of data can be represented using third-order tensors. Applications of these tensors include chemometrics, psychometrics, and image/video processing. However, traditional data-driven frameworks are not naturally equipped to process tensors without first unfolding or flattening the data, which can result in a loss of crucial higher-order structural information. In this letter, we introduce a novel framework for data-driven analysis of T-product-based dynamical systems (TPDSs), where the system evolution is governed by the T-product between a third-order dynamic tensor and a third-order state tensor. In particular, we examine the data informativity of TPDSs concerning system identification, stability, controllability, and stabilizability and illustrate significant computational improvements over unfolding-based approaches by leveraging the unique properties of the T-product. The effectiveness of our framework is demonstrated through both synthetic and real-world examples.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"3356-3361"},"PeriodicalIF":2.4,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184171","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：