Pub Date : 2024-06-14DOI: 10.1109/LCSYS.2024.3414977
Edwin Baum;Zonglin Liu;Olaf Stursberg
This letter introduces two novel methods to synthesize distributed observers for time-varying communication graphs which are modeled as continuous-time Markov processes. The first method obtains all design parameters in a centralized step by solving a system of coupled LMI, while the second method utilizes an observability decomposition to design the parameters locally by partitioning into observable and unobservable system parts. For both methods, this letter provides sufficient conditions for the existence of distributed observers which asymptotically achieve omniscience almost surely. A numerical example to compare the two methods is provided in addition.
{"title":"Distributed State Estimation of Linear Systems With Randomly Switching Communication Graphs","authors":"Edwin Baum;Zonglin Liu;Olaf Stursberg","doi":"10.1109/LCSYS.2024.3414977","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414977","url":null,"abstract":"This letter introduces two novel methods to synthesize distributed observers for time-varying communication graphs which are modeled as continuous-time Markov processes. The first method obtains all design parameters in a centralized step by solving a system of coupled LMI, while the second method utilizes an observability decomposition to design the parameters locally by partitioning into observable and unobservable system parts. For both methods, this letter provides sufficient conditions for the existence of distributed observers which asymptotically achieve omniscience almost surely. A numerical example to compare the two methods is provided in addition.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141602457","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 : 2024-06-14DOI: 10.1109/LCSYS.2024.3414972
Ahmad Hafez;Frank J. Jiang;Karl H. Johansson;Amr Alanwar
This letter presents a novel approach for reachability analysis of using constrained polynomial logical zonotopes. We perform reachability analysis to compute the set of reachable states using a recently introduced set representation called polynomial logical zonotopes, enabling computationally efficient and exact reachability analysis on logical systems. Notably, polynomial logical zonotopes address the “curse of dimensionality” when analyzing the reachability of logical systems since the set representation can represent $2^{h}$ binary vectors using h generators. After finishing the reachability analysis, the formal verification involves verifying whether the intersection of the calculated reachable set and the unsafe set is empty or not. Polynomial logical zonotopes lack closure under intersections, prompting the formulation of constrained polynomial logical zonotopes, which preserve the computational efficiency and exactness of polynomial logical zonotopes for reachability analysis while enabling exact intersections. Additionally, an extensive empirical study is presented to demonstrate and validate the advantages of constrained polynomial logical zonotopes.
这封信提出了一种使用受约束多项式逻辑众数进行可达性分析的新方法。我们使用最近推出的一种称为多项式逻辑众数的集合表示法进行可达性分析，计算可达状态集合，从而实现对逻辑系统进行高效计算和精确可达性分析。值得注意的是，由于集合表示法可以用 h 个生成器来表示 $2^{h}$ 二进制向量，因此多项式逻辑纵向图解决了逻辑系统可达性分析中的 "维度诅咒 "问题。完成可达性分析后，形式验证包括验证计算出的可达集与不安全集的交集是否为空。多项式逻辑众数在交集下缺乏闭合性，这促使人们提出了受约束的多项式逻辑众数，它既保留了多项式逻辑众数在可达性分析中的计算效率和精确性，又实现了精确的交集。此外，本文还介绍了一项广泛的实证研究，以证明和验证受约束多项式逻辑众数的优势。
{"title":"Reachability Analysis Using Constrained Polynomial Logical Zonotopes","authors":"Ahmad Hafez;Frank J. Jiang;Karl H. Johansson;Amr Alanwar","doi":"10.1109/LCSYS.2024.3414972","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414972","url":null,"abstract":"This letter presents a novel approach for reachability analysis of using constrained polynomial logical zonotopes. We perform reachability analysis to compute the set of reachable states using a recently introduced set representation called polynomial logical zonotopes, enabling computationally efficient and exact reachability analysis on logical systems. Notably, polynomial logical zonotopes address the “curse of dimensionality” when analyzing the reachability of logical systems since the set representation can represent \u0000<inline-formula> <tex-math>$2^{h}$ </tex-math></inline-formula>\u0000 binary vectors using h generators. After finishing the reachability analysis, the formal verification involves verifying whether the intersection of the calculated reachable set and the unsafe set is empty or not. Polynomial logical zonotopes lack closure under intersections, prompting the formulation of constrained polynomial logical zonotopes, which preserve the computational efficiency and exactness of polynomial logical zonotopes for reachability analysis while enabling exact intersections. Additionally, an extensive empirical study is presented to demonstrate and validate the advantages of constrained polynomial logical zonotopes.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142329332","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 : 2024-06-14DOI: 10.1109/LCSYS.2024.3414962
Spencer Kraisler;Mehran Mesbahi
We consider direct policy optimization for the linear-quadratic Gaussian (LQG) setting. Over the past few years, it has been recognized that the landscape of dynamic output-feedback controllers of relevance to LQG has an intricate geometry, particularly pertaining to the existence of degenerate stationary points, that hinders gradient methods. In order to address these challenges, in this letter, we adopt a system-theoretic coordinate-invariant Riemannian metric for the space of dynamic output-feedback controllers and develop a Riemannian gradient descent for direct LQG policy optimization. We then proceed to prove that the orbit space of such controllers, modulo the coordinate transformation, admits a Riemannian quotient manifold structure. This geometric structure-that is of independent interest-provides an effective approach to derive direct policy optimization algorithms for LQG with a local linear rate convergence guarantee. Subsequently, we show that the proposed approach exhibits significantly faster and more robust numerical performance as compared with ordinary gradient descent.
{"title":"Output-Feedback Synthesis Orbit Geometry: Quotient Manifolds and LQG Direct Policy Optimization","authors":"Spencer Kraisler;Mehran Mesbahi","doi":"10.1109/LCSYS.2024.3414962","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414962","url":null,"abstract":"We consider direct policy optimization for the linear-quadratic Gaussian (LQG) setting. Over the past few years, it has been recognized that the landscape of dynamic output-feedback controllers of relevance to LQG has an intricate geometry, particularly pertaining to the existence of degenerate stationary points, that hinders gradient methods. In order to address these challenges, in this letter, we adopt a system-theoretic coordinate-invariant Riemannian metric for the space of dynamic output-feedback controllers and develop a Riemannian gradient descent for direct LQG policy optimization. We then proceed to prove that the orbit space of such controllers, modulo the coordinate transformation, admits a Riemannian quotient manifold structure. This geometric structure-that is of independent interest-provides an effective approach to derive direct policy optimization algorithms for LQG with a local linear rate convergence guarantee. Subsequently, we show that the proposed approach exhibits significantly faster and more robust numerical performance as compared with ordinary gradient descent.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495011","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3413868
Kyung-Bin Kwon;Ramij Raja Hossain;Sayak Mukherjee;Kaustav Chatterjee;Soumya Kundu;Sameer Nekkalapu;Marcelo Elizondo
This letter investigates the importance of integrating the coherency knowledge for designing controllers to dampen sustained oscillations in wide-area power networks with significant penetration of inverter-interfaced resources. Coherency is a fundamental property of power systems, where time-scale separation in frequency dynamics leads to clustered behavior among generators of different groups. Large-scale penetration of inverter-driven low inertia resources replacing conventional synchronous generators (SGs) can lead to perturbation in the coherent partitioning; hence, integrating such information is of utmost importance for oscillation control designs. We present the coherency-aware design of a distributed output feedback-based reinforcement learning method that additionally incorporates risk constraints to capture the uncertainties related to net-load fluctuations. The use of domain-aware coherency information has produced improved training and oscillation performance than the coherency-agnostic control design, hence proving to be effective in controller design. Finally, we validated the proposed method with numerical experiments on the benchmark IEEE 68-bus test system.
{"title":"Coherency-Aware Learning Control of Inverter-Dominated Grids: A Distributed Risk-Constrained Approach","authors":"Kyung-Bin Kwon;Ramij Raja Hossain;Sayak Mukherjee;Kaustav Chatterjee;Soumya Kundu;Sameer Nekkalapu;Marcelo Elizondo","doi":"10.1109/LCSYS.2024.3413868","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3413868","url":null,"abstract":"This letter investigates the importance of integrating the coherency knowledge for designing controllers to dampen sustained oscillations in wide-area power networks with significant penetration of inverter-interfaced resources. Coherency is a fundamental property of power systems, where time-scale separation in frequency dynamics leads to clustered behavior among generators of different groups. Large-scale penetration of inverter-driven low inertia resources replacing conventional synchronous generators (SGs) can lead to perturbation in the coherent partitioning; hence, integrating such information is of utmost importance for oscillation control designs. We present the coherency-aware design of a distributed output feedback-based reinforcement learning method that additionally incorporates risk constraints to capture the uncertainties related to net-load fluctuations. The use of domain-aware coherency information has produced improved training and oscillation performance than the coherency-agnostic control design, hence proving to be effective in controller design. Finally, we validated the proposed method with numerical experiments on the benchmark IEEE 68-bus test system.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142159878","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3414349
Amir Reza Zare;Mahdi Aliyari-Shoorehdeli;Mehdi Tavan;Kamran Sabahi
This letter studies the design of state and output feedback control for a class of bilinear systems aimed at achieving global exponential tracking of (admissible, differentiable) time-varying trajectories. We demonstrate that a persistency of excitation (PE) assumption on the desired trajectories is sufficient to achieve the control objective via a simple state feedback proportional (P) controller. The controller, in conjunction with a globally stable Kalman-like observer, is further developed into a certainty-equivalent output feedback version, maintaining stability under a detectability condition that depends on the behavior of the desired control effort. The proposed algorithm is applied to control a lossless single-phase grid-connected PV inverter with an unmeasurable output current.
{"title":"Output Feedback Tracking Control for a Class of Bilinear Systems: Application to Power Electronics Devices","authors":"Amir Reza Zare;Mahdi Aliyari-Shoorehdeli;Mehdi Tavan;Kamran Sabahi","doi":"10.1109/LCSYS.2024.3414349","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414349","url":null,"abstract":"This letter studies the design of state and output feedback control for a class of bilinear systems aimed at achieving global exponential tracking of (admissible, differentiable) time-varying trajectories. We demonstrate that a persistency of excitation (PE) assumption on the desired trajectories is sufficient to achieve the control objective via a simple state feedback proportional (P) controller. The controller, in conjunction with a globally stable Kalman-like observer, is further developed into a certainty-equivalent output feedback version, maintaining stability under a detectability condition that depends on the behavior of the desired control effort. The proposed algorithm is applied to control a lossless single-phase grid-connected PV inverter with an unmeasurable output current.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965910","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3414290
Anusree Rajan;Pavankumar Tallapragada
This letter deals with event-triggered parameterized control (ETPC) of nonlinear systems with external disturbances. In this control method, between two successive events, each control input to the plant is a linear combination of a set of linearly independent scalar functions. At each event, the controller updates the coefficients of the parameterized control input so as to minimize the error in approximating a continuous time control signal and communicates the same to the actuator. We design an event-triggering rule (ETR) that guarantees global uniform ultimate boundedness of trajectories of the closed loop system. We also ensure the absence of Zeno behavior by showing the existence of a uniform positive lower bound on the inter-event times (IETs). We illustrate our results through numerical examples.
{"title":"Event-Triggered Parameterized Control of Nonlinear Systems","authors":"Anusree Rajan;Pavankumar Tallapragada","doi":"10.1109/LCSYS.2024.3414290","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414290","url":null,"abstract":"This letter deals with event-triggered parameterized control (ETPC) of nonlinear systems with external disturbances. In this control method, between two successive events, each control input to the plant is a linear combination of a set of linearly independent scalar functions. At each event, the controller updates the coefficients of the parameterized control input so as to minimize the error in approximating a continuous time control signal and communicates the same to the actuator. We design an event-triggering rule (ETR) that guarantees global uniform ultimate boundedness of trajectories of the closed loop system. We also ensure the absence of Zeno behavior by showing the existence of a uniform positive lower bound on the inter-event times (IETs). We illustrate our results through numerical examples.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141602510","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3414378
Moslem Zamani;François Glineur;Julien M. Hendrickx
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this letter, we give an exact characterization of the set of possible minimizers of the sum. Our results cover several types of assumptions on the summands, such as smoothness or strong convexity. Our main tool is the use of necessary and sufficient conditions for interpolating the considered function classes, which leads to shorter and more direct proofs in comparison with previous work. We also address the setting where each summand minimizer is assumed to lie in a unit ball, and prove a tight bound on the norm of any minimizer of the sum.
{"title":"On the Set of Possible Minimizers of a Sum of Convex Functions","authors":"Moslem Zamani;François Glineur;Julien M. Hendrickx","doi":"10.1109/LCSYS.2024.3414378","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414378","url":null,"abstract":"Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this letter, we give an exact characterization of the set of possible minimizers of the sum. Our results cover several types of assumptions on the summands, such as smoothness or strong convexity. Our main tool is the use of necessary and sufficient conditions for interpolating the considered function classes, which leads to shorter and more direct proofs in comparison with previous work. We also address the setting where each summand minimizer is assumed to lie in a unit ball, and prove a tight bound on the norm of any minimizer of the sum.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141602533","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3413869
Apurva Patil;Grani A. Hanasusanto;Takashi Tanaka
In this letter, we derive the path integral control algorithm to solve a discrete-time stochastic Linear Quadratic Regulator (LQR) problem and carry out its sample complexity analysis. While the stochastic LQR problem can be efficiently solved by the standard backward Riccati recursion, our primary focus in this letter is to establish the foundation for a sample complexity analysis of the path integral method when the analytical expressions of optimal control law and the cost are available. Specifically, we derive a bound on the error between the optimal LQR input and the input computed by the path integral method as a function of the sample size. Our analysis reveals that the sample size required exhibits a logarithmic dependence on the dimension of the control input. Lastly, we formulate a chance-constrained optimization problem whose solution quantifies the worst-case control performance of the path integral approach.
{"title":"Discrete-Time Stochastic LQR via Path Integral Control and Its Sample Complexity Analysis","authors":"Apurva Patil;Grani A. Hanasusanto;Takashi Tanaka","doi":"10.1109/LCSYS.2024.3413869","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3413869","url":null,"abstract":"In this letter, we derive the path integral control algorithm to solve a discrete-time stochastic Linear Quadratic Regulator (LQR) problem and carry out its sample complexity analysis. While the stochastic LQR problem can be efficiently solved by the standard backward Riccati recursion, our primary focus in this letter is to establish the foundation for a sample complexity analysis of the path integral method when the analytical expressions of optimal control law and the cost are available. Specifically, we derive a bound on the error between the optimal LQR input and the input computed by the path integral method as a function of the sample size. Our analysis reveals that the sample size required exhibits a logarithmic dependence on the dimension of the control input. Lastly, we formulate a chance-constrained optimization problem whose solution quantifies the worst-case control performance of the path integral approach.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495212","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}
We analyze the convergence behavior of globally weakly and locally strongly contracting dynamics. Such dynamics naturally arise in the context of convex optimization problems with a unique minimizer. We show that convergence to the equilibrium is linear-exponential, in the sense that the distance between each solution and the equilibrium is upper bounded by a function that first decreases linearly and then exponentially. As we show, the linear-exponential dependency arises naturally in certain dynamics with saturations. Additionally, we provide a sufficient condition for local input-to-state stability. Finally, we illustrate our results on, and propose a conjecture for, continuous-time dynamical systems solving linear programs.
{"title":"On Weakly Contracting Dynamics for Convex Optimization","authors":"Veronica Centorrino;Alexander Davydov;Anand Gokhale;Giovanni Russo;Francesco Bullo","doi":"10.1109/LCSYS.2024.3414348","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3414348","url":null,"abstract":"We analyze the convergence behavior of globally weakly and locally strongly contracting dynamics. Such dynamics naturally arise in the context of convex optimization problems with a unique minimizer. We show that convergence to the equilibrium is linear-exponential, in the sense that the distance between each solution and the equilibrium is upper bounded by a function that first decreases linearly and then exponentially. As we show, the linear-exponential dependency arises naturally in certain dynamics with saturations. Additionally, we provide a sufficient condition for local input-to-state stability. Finally, we illustrate our results on, and propose a conjecture for, continuous-time dynamical systems solving linear programs.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141602559","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 : 2024-06-13DOI: 10.1109/LCSYS.2024.3413870
Shubham Aggarwal;Tamer Başar;Dipankar Maity
In this letter, we revisit the two-player continuous-time infinite-horizon linear quadratic differential game problem, where one of the players can sample the state of the system only intermittently due to a sensing constraint while the other player can do so continuously. Under these asymmetric sensing limitations between the players, we analyze the optimal sensing and control strategies for the player at a disadvantage while the other player continues to play its security strategy. We derive an optimal sensor policy within the class of stationary randomized policies. Finally, using simulations, we show that the expected cost accrued by the first player approaches its security level as its sensing limitation is relaxed.
{"title":"Linear Quadratic Zero-Sum Differential Games With Intermittent and Costly Sensing","authors":"Shubham Aggarwal;Tamer Başar;Dipankar Maity","doi":"10.1109/LCSYS.2024.3413870","DOIUrl":"https://doi.org/10.1109/LCSYS.2024.3413870","url":null,"abstract":"In this letter, we revisit the two-player continuous-time infinite-horizon linear quadratic differential game problem, where one of the players can sample the state of the system only intermittently due to a sensing constraint while the other player can do so continuously. Under these asymmetric sensing limitations between the players, we analyze the optimal sensing and control strategies for the player at a disadvantage while the other player continues to play its security strategy. We derive an optimal sensor policy within the class of stationary randomized policies. Finally, using simulations, we show that the expected cost accrued by the first player approaches its security level as its sensing limitation is relaxed.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10556616","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141500256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：