Pub Date : 2024-11-01DOI: 10.1016/j.ejcon.2024.101063
Hannah Häring , Dennis Gramlich , Christian Ebenbauer , Carsten W. Scherer
We develop a convex relaxation for the minimum energy control problem of the well-known unicycle model in the form of a semidefinite program. Through polynomialization techniques, the infinite-dimensional optimal control problem is first reformulated as a non-convex, infinite-dimensional quadratic program which can be viewed as a trajectory generation problem. This problem is then discretized to arrive at a finite-dimensional, albeit, non-convex quadratically constrained quadratic program. By applying the moment relaxation method to this quadratic program, we obtain a hierarchy of semidefinite relaxations. We construct an approximate solution for the infinite-dimensional trajectory generation problem by solving the first- or second-order moment relaxation. A comprehensive simulation study provided in this paper suggests that the second-order moment relaxation is lossless.
{"title":"Trajectory generation for the unicycle model using semidefinite relaxations","authors":"Hannah Häring , Dennis Gramlich , Christian Ebenbauer , Carsten W. Scherer","doi":"10.1016/j.ejcon.2024.101063","DOIUrl":"10.1016/j.ejcon.2024.101063","url":null,"abstract":"<div><div>We develop a convex relaxation for the minimum energy control problem of the well-known unicycle model in the form of a semidefinite program. Through polynomialization techniques, the infinite-dimensional optimal control problem is first reformulated as a non-convex, infinite-dimensional quadratic program which can be viewed as a trajectory generation problem. This problem is then discretized to arrive at a finite-dimensional, albeit, non-convex quadratically constrained quadratic program. By applying the moment relaxation method to this quadratic program, we obtain a hierarchy of semidefinite relaxations. We construct an approximate solution for the infinite-dimensional trajectory generation problem by solving the first- or second-order moment relaxation. A comprehensive simulation study provided in this paper suggests that the second-order moment relaxation is lossless.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101063"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577019","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101058
Xiaobing Dai , Zewen Yang , Mengtian Xu , Sihua Zhang , Fangzhou Liu , Georges Hattab , Sandra Hirche
Consensus control in multi-agent systems has received significant attention and practical implementation across various domains. However, managing consensus control under unknown dynamics remains a significant challenge for control design due to system uncertainties and environmental disturbances. This paper presents a novel learning-based distributed control law augmented by auxiliary dynamics. Gaussian processes are harnessed to compensate for the unknown components of the multi-agent system. For continuous enhancement in the predictive performance of the Gaussian process model, a data-efficient online learning strategy with a decentralized event-triggered mechanism is proposed. Furthermore, the control performance of the proposed approach is ensured via the Lyapunov theory, based on a probabilistic guarantee for prediction error bounds. To demonstrate the efficacy of the proposed learning-based controller, a comparative analysis is conducted, contrasting it with both conventional distributed control laws and offline learning methodologies.
{"title":"Decentralized event-triggered online learning for safe consensus control of multi-agent systems with Gaussian process regression","authors":"Xiaobing Dai , Zewen Yang , Mengtian Xu , Sihua Zhang , Fangzhou Liu , Georges Hattab , Sandra Hirche","doi":"10.1016/j.ejcon.2024.101058","DOIUrl":"10.1016/j.ejcon.2024.101058","url":null,"abstract":"<div><div><span><span>Consensus control in multi-agent systems has received significant attention and practical implementation across various domains. However, managing consensus control under unknown dynamics remains a significant challenge for control design due to system uncertainties and environmental disturbances. This paper presents a novel learning-based distributed control law augmented by </span>auxiliary dynamics. </span>Gaussian<span> processes are harnessed to compensate for the unknown components of the multi-agent system. For continuous enhancement in the predictive performance of the Gaussian process model, a data-efficient online learning strategy with a decentralized event-triggered mechanism is proposed. Furthermore, the control performance of the proposed approach is ensured via the Lyapunov theory, based on a probabilistic guarantee for prediction error bounds. To demonstrate the efficacy of the proposed learning-based controller, a comparative analysis is conducted, contrasting it with both conventional distributed control laws and offline learning methodologies.</span></div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101058"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141408948","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101069
Jiayuan Liang , Yanwei Zang , Wenbiao Zhang , Chaohui Gong , Lachlan L.H. Andrew , Hanran Zhang , Weilin Wang
In discrete event systems, it is often convenient and possible to observe directly whether or not the system is in a subset of the state space, typically after some delay, even if some event occurrences leading to the current state were not observed. We model supervisory control with the delayed observations of events and states and investigate the existence of a supervisor to obtain a given desired language accordingly. An existence verifier with polynomial run time is presented.
{"title":"Supervisory control under delayed observations of events and states","authors":"Jiayuan Liang , Yanwei Zang , Wenbiao Zhang , Chaohui Gong , Lachlan L.H. Andrew , Hanran Zhang , Weilin Wang","doi":"10.1016/j.ejcon.2024.101069","DOIUrl":"10.1016/j.ejcon.2024.101069","url":null,"abstract":"<div><div>In discrete event systems, it is often convenient and possible to observe directly whether or not the system is in a subset of the state space, typically after some delay, even if some event occurrences leading to the current state were not observed. We model supervisory control with the delayed observations of events and states and investigate the existence of a supervisor to obtain a given desired language accordingly. An existence verifier with polynomial run time is presented.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101069"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141717638","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101055
Riya Mathew , Juan G. Rueda-Escobedo , Johannes Schiffer
Phase-locked loop (PLL) algorithms are key elements for the successful integration of converter-interfaced renewable energy sources to the grid. Their main task is to estimate the phase angle of the terminal grid voltage with the aim to keep the converter output current synchronized to it. Yet, due to the increasing penetration of power-electronics-interfaced devices in power systems, the grid voltage signal becomes increasingly disturbed, making the reliable phase estimation a highly demanding task. To address this challenge, we present a robust design method based on matrix inequalities to tune the PLL gains, such that the estimation errors remain bounded in the presence of additive disturbances. Our design approach is formulated as a set of bilinear matrix inequalities (BMIs), which we then propose to solve using the P-K iteration method. This results in a convex problem to be solved at each step. Finally, the benefits of the proposed robust design are illustrated via a numerical example.
{"title":"Robust design of phase-locked loops in grid-connected power converters","authors":"Riya Mathew , Juan G. Rueda-Escobedo , Johannes Schiffer","doi":"10.1016/j.ejcon.2024.101055","DOIUrl":"10.1016/j.ejcon.2024.101055","url":null,"abstract":"<div><div>Phase-locked loop (PLL) algorithms are key elements for the successful integration of converter-interfaced renewable energy sources to the grid. Their main task is to estimate the phase angle of the terminal grid voltage with the aim to keep the converter output current synchronized to it. Yet, due to the increasing penetration of power-electronics-interfaced devices in power systems, the grid voltage signal becomes increasingly disturbed, making the reliable phase estimation a highly demanding task. To address this challenge, we present a robust design method based on matrix inequalities to tune the PLL gains, such that the estimation errors remain bounded in the presence of additive disturbances. Our design approach is formulated as a set of bilinear matrix inequalities (BMIs), which we then propose to solve using the P-K iteration method. This results in a convex problem to be solved at each step. Finally, the benefits of the proposed robust design are illustrated via a numerical example.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101055"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510836","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101035
Christoforos N. Hadjicostis , Alejandro D. Domínguez-García
We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state and updates it iteratively as a linear combination of the states maintained by its in-neighbors, i.e., nodes from which it receives information directly. Averaging algorithms within this class can be thought of as discrete-time linear time-varying systems without external driving inputs and whose state matrix is column stochastic. As a result, the algorithms exhibit a global invariance property in that the sum of the state variables remains constant at all times. In this paper, we report on another invariance property for the aforementioned class of averaging algorithms. This property is local to each node and reflects the conservation of certain quantities capturing an aggregate of all the values received by a node from its in-neighbors and all the values sent by said node to its out-neighbors (i.e., nodes to which it sends information directly) throughout the execution of the averaging algorithm. We show how this newly-discovered invariant can be leveraged for detecting errors while executing the averaging algorithm.
{"title":"Invariant properties of linear-iterative distributed averaging algorithms and application to error detection","authors":"Christoforos N. Hadjicostis , Alejandro D. Domínguez-García","doi":"10.1016/j.ejcon.2024.101035","DOIUrl":"10.1016/j.ejcon.2024.101035","url":null,"abstract":"<div><div>We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state and updates it iteratively as a linear combination of the states maintained by its in-neighbors, i.e., nodes from which it receives information directly. Averaging algorithms within this class can be thought of as discrete-time linear time-varying systems without external driving inputs and whose state matrix is column stochastic. As a result, the algorithms exhibit a global invariance property in that the sum of the state variables remains constant at all times. In this paper, we report on another invariance property for the aforementioned class of averaging algorithms. This property is local to each node and reflects the conservation of certain quantities capturing an aggregate of all the values received by a node from its in-neighbors and all the values sent by said node to its out-neighbors (i.e., nodes to which it sends information directly) throughout the execution of the averaging algorithm. We show how this newly-discovered invariant can be leveraged for detecting errors while executing the averaging algorithm.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101035"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577078","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101065
Sofia Trombini , Edoardo Pasta , Lorenzo Fagiano
This study investigates deep offshore, pumping Airborne Wind Energy systems, focusing on the kite-platform interaction. The considered system includes a 360 m soft-wing kite, connected by a tether to a winch installed on a 10-meter-deep spar with four mooring lines. Wind power is converted into electricity with a feedback controlled periodic trajectory of the kite and corresponding reeling motion of the tether. An analysis of the mutual influence between the platform and the kite dynamics, with different wave regimes, reveals a rather small sensitivity of the flight pattern to the platform oscillations; on the other hand, the frequency of tether force oscillations can be close to the platform resonance peaks, resulting in possible increased fatigue loads and damage of the floating and submerged components. A control design procedure is then proposed to avoid this problem, acting on the kite path planner. Simulation results confirm the effectiveness of the approach.
{"title":"On the kite-platform interactions in offshore Airborne Wind Energy Systems: Frequency analysis and control approach","authors":"Sofia Trombini , Edoardo Pasta , Lorenzo Fagiano","doi":"10.1016/j.ejcon.2024.101065","DOIUrl":"10.1016/j.ejcon.2024.101065","url":null,"abstract":"<div><div>This study investigates deep offshore, pumping Airborne Wind Energy systems, focusing on the kite-platform interaction. The considered system includes a 360 m<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span> soft-wing kite, connected by a tether to a winch installed on a 10-meter-deep spar with four mooring lines. Wind power is converted into electricity with a feedback controlled periodic trajectory of the kite and corresponding reeling motion of the tether. An analysis of the mutual influence between the platform and the kite dynamics, with different wave regimes, reveals a rather small sensitivity of the flight pattern to the platform oscillations; on the other hand, the frequency of tether force oscillations can be close to the platform resonance peaks, resulting in possible increased fatigue loads and damage of the floating and submerged components. A control design procedure is then proposed to avoid this problem, acting on the kite path planner. Simulation results confirm the effectiveness of the approach.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101065"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510839","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101060
Xiao Chen, Zhiqi Tang, Karl H. Johansson, Jonas Mårtensson
This paper proposes a novel formation control design for safe platooning and merging of a group of vehicles in multi-lane road scenarios. Provided a leader vehicle is independently controlled, the objective is controlling the follower vehicles to drive in the desired lane with a constant desired distance behind the neighboring (preceding) vehicle while preventing collisions with both the neighboring vehicle and the road’s edges. Inspired by the recent concept of constructive barrier feedback, the proposed controller for each follower vehicle is composed of two parts: one is the nominal controller that ensures its tracking of the neighboring vehicle; another is for collision avoidance by using divergent flow as a dissipative term, which slows down the relative velocity in the direction of the neighboring vehicle and road edges without compromising the nominal controller’s performance. The key contribution of this work is that the proposed control method ensures collision-free platooning and merging control in multi-lane road scenarios with computational efficiency and systematic stability analysis. Simulation results are provided to demonstrate the effectiveness of the proposed algorithms.
{"title":"Safe platooning and merging control using constructive barrier feedback","authors":"Xiao Chen, Zhiqi Tang, Karl H. Johansson, Jonas Mårtensson","doi":"10.1016/j.ejcon.2024.101060","DOIUrl":"10.1016/j.ejcon.2024.101060","url":null,"abstract":"<div><div>This paper proposes a novel formation control design for safe platooning and merging of a group of vehicles in multi-lane road scenarios. Provided a leader vehicle is independently controlled, the objective is controlling the follower vehicles to drive in the desired lane with a constant desired distance behind the neighboring (preceding) vehicle while preventing collisions with both the neighboring vehicle and the road’s edges. Inspired by the recent concept of constructive barrier feedback, the proposed controller for each follower vehicle is composed of two parts: one is the nominal controller that ensures its tracking of the neighboring vehicle; another is for collision avoidance by using divergent flow as a dissipative term, which slows down the relative velocity in the direction of the neighboring vehicle and road edges without compromising the nominal controller’s performance. The key contribution of this work is that the proposed control method ensures collision-free platooning and merging control in multi-lane road scenarios with computational efficiency and systematic stability analysis. Simulation results are provided to demonstrate the effectiveness of the proposed algorithms.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101060"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141717569","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}
This paper considers the stability and optimality properties of traffic demand management schemes, motivated by the integration of smart monitoring and control technologies in traffic networks. First, a suitable optimization problem is formulated that aims to obtain demand input values that maximize the throughput within traffic networks adhering to regional traffic dynamics with triangular macroscopic fundamental diagrams. We show that optimal solutions to this problem may lead to unstable behaviour, revealing a trade-off between stability and optimality. To address this issue, we analytically study the stability properties of traffic networks at the presence of constant demand input and provide suitable local conditions that guarantee stability when the system’s equilibrium densities are strictly within the free-flow region, but not at the critical density. The latter case is significant, since the maximum throughput behaviour coincides in many cases with the local critical density. We resolve this by proposing a decentralized proportional demand control scheme and suitable local design conditions such that stability is guaranteed. Our analytic results are validated with numerical simulations in a 3-region system that demonstrate the effectiveness and practicality of the proposed approach.
{"title":"Stability of regional traffic networks employing maximum throughput demand management","authors":"Michalis Ramp , Andreas Kasis , Charalambos Menelaou , Stelios Timotheou","doi":"10.1016/j.ejcon.2024.101061","DOIUrl":"10.1016/j.ejcon.2024.101061","url":null,"abstract":"<div><div>This paper considers the stability and optimality properties of traffic demand management schemes, motivated by the integration of smart monitoring and control technologies in traffic networks. First, a suitable optimization problem is formulated that aims to obtain demand input values that maximize the throughput within traffic networks adhering to regional traffic dynamics with triangular macroscopic fundamental diagrams. We show that optimal solutions to this problem may lead to unstable behaviour, revealing a trade-off between stability and optimality. To address this issue, we analytically study the stability properties of traffic networks at the presence of constant demand input and provide suitable local conditions that guarantee stability when the system’s equilibrium densities are strictly within the free-flow region, but not at the critical density. The latter case is significant, since the maximum throughput behaviour coincides in many cases with the local critical density. We resolve this by proposing a decentralized proportional demand control scheme and suitable local design conditions such that stability is guaranteed. Our analytic results are validated with numerical simulations in a 3-region system that demonstrate the effectiveness and practicality of the proposed approach.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101061"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577018","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101043
Andreas A. Malikopoulos
In this paper, we provide a theoretical framework that separates the control and learning tasks in a linear system. This separation allows us to combine offline model-based control with online learning approaches and thus circumvent current challenges in deriving optimal control strategies in applications where a large volume of data is added to the system gradually in real time and not altogether in advance. We provide an analytical example to illustrate the framework.
{"title":"Combining learning and control in linear systems","authors":"Andreas A. Malikopoulos","doi":"10.1016/j.ejcon.2024.101043","DOIUrl":"10.1016/j.ejcon.2024.101043","url":null,"abstract":"<div><div>In this paper, we provide a theoretical framework that separates the control and learning tasks in a linear system. This separation allows us to combine offline model-based control with online learning approaches and thus circumvent current challenges in deriving optimal control strategies in applications where a large volume of data is added to the system gradually in real time and not altogether in advance. We provide an analytical example to illustrate the framework.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101043"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141530139","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 : 2024-11-01DOI: 10.1016/j.ejcon.2024.101129
Huiqing Xie, Chuandong Liu
Partial eigenvalue assignment problem (PEAP) of second order descriptor systems is investigated by using acceleration–velocity–displacement feedback. First, we derive parametric expressions of the solutions to the PEAP of a second order descriptor system, i.e., giving the expressions of acceleration, velocity and displacement feedback matrices such that the closed-loop system is regular and has the index at most 1, and some eigenvalues of the open-loop system are replaced by the desired ones, and the other eigenpairs of the open-loop system are kept unchanged. Then a numerical method is proposed for robust partial eigenvalue assignment of a second order descriptor system so that the closed-loop system is as robust as possible. Our method avoids to use the unchanged eigenpairs of the open-loop system and it is effective whether the closed-loop system has infinite eigenvalue or not. Numerical experiments are reported to test the efficiency of the proposed method.
{"title":"Robust partial eigenvalue assignment of second order descriptor systems","authors":"Huiqing Xie, Chuandong Liu","doi":"10.1016/j.ejcon.2024.101129","DOIUrl":"10.1016/j.ejcon.2024.101129","url":null,"abstract":"<div><div>Partial eigenvalue assignment problem (PEAP) of second order descriptor systems is investigated by using acceleration–velocity–displacement feedback. First, we derive parametric expressions of the solutions to the PEAP of a second order descriptor system, i.e., giving the expressions of acceleration, velocity and displacement feedback matrices such that the closed-loop system is regular and has the index at most 1, and some eigenvalues of the open-loop system are replaced by the desired ones, and the other eigenpairs of the open-loop system are kept unchanged. Then a numerical method is proposed for robust partial eigenvalue assignment of a second order descriptor system so that the closed-loop system is as robust as possible. Our method avoids to use the unchanged eigenpairs of the open-loop system and it is effective whether the closed-loop system has infinite eigenvalue or not. Numerical experiments are reported to test the efficiency of the proposed method.</div></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"80 ","pages":"Article 101129"},"PeriodicalIF":2.5,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142592639","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号