arXiv math/05111122005-11-04math.OC

Output Feedback Pole Assignment for Transfer Functions with Symmetries

Uwe Helmke, Joachim Rosenthal, Alex Wang

备注：: 18 pages

英文摘要：

This paper studies the problem of pole assignment for symmetric and Hamiltonian transfer functions. A necessary and sufficient condition for pole assignment by complex symmetric output feedback transformations is given. Moreover, in the case where the McMillan degree coincides with the number of parameters appearing in the symmetric feedback transformations, we derive an explicit combinatorial formula for the number of pole assigning symmetric feedback gains. The proof uses intersection theory in projective space as well as a formula for the degree of the complex Lagrangian Grassmann manifold.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Schur Method for Robust Pole Assignment of Descriptor Systems via Proportional Plus Derivative State Feedback

The pole assignment problem for descriptor systems is a classical inverse algebraic eigenvalue problem, which has attracted attention for decades. In this paper, we propose a direct method to solve the problem with the application of the proportional plus derivative state feedback, intending to obtain a robust closed-loop system. Theorems on the feasibility of our method will be presented. Numerical examples show that our method yields poles of high relative accuracy.

2016-08-23math.OC

Zero Assignment in Multivariable System Using Pole Assignment Method

In the paper we consider the invariant zero assignment problem in a linear multivariable system with several inputs/outputs by constructing a system output matrix. The problem is reduced to the pole assignment problem by a state feedback (modal control) in a descriptor system or a regular one. It is shown that the zero assignment and pole assignment are mathematically equivalent problems.

2002-07-11math.DSmath.OC

A Modified Schur Method for Robust Pole Assignment in State Feedback Control

Recently, a \textbf{SCHUR} method was proposed in \cite{Chu2} to solve the robust pole assignment problem in state feedback control. It takes the departure from normality of the closed-loop system matrix $A_c$ as the measure of robustness, and intends to minimize it via the real Schur form of $A_c$. The \textbf{SCHUR} method works well for real poles, but when complex conjugate poles are involved, it does not produce the real Schur form of $A_c$ and can be problematic. In this paper, we put forward a modified Schur method, which improves the efficiency of \textbf{SCHUR} when complex conjugate …

2014-10-11math.OC

Coupling effect and pole assignment in trajectory regulation of multi-agent systems

This paper revisits a well studied leader-following consensus problem of linear multi-agent systems, while aiming at follower nodes' transient performance. Conventionally, when not all follower nodes have access to the leader's state information, distributed observers are designed to estimate the leader's state, and the observers are coupled via communication network. Then each follower node only needs to track its observer's state independently, without interacting with its neighbors. This paper deliberately introduces certain coupling effect among follower nodes, such that the follower nodes…

2021-12-31math.OC

状态反馈矩阵在极点配置问题中的局部参数化

A Local Parametrization of the State-Feedback Matrices in the Pole Assignment Problem

本文研究了极点配置问题中状态反馈矩阵的局部参数化方法，通过微分流形结构和李群作用提供了一种参数化方案。

2025-11-25math.OC

Zero Assignment, Pole Placement and Matrix Extension Problems: A Common Point of View

The paper studies a general inverse eigenvalue problem which contains as special cases many well studied pole placement and matrix extension problems. It is shown that the studied problem corresponds on the geometric side to a central projection from some projective variety. The degree for this variety is computed in the critical dimension.

1999-03-29math.AGmath.OC

更多相关论文收起更多论文

A unified method for optimal arbitrary pole placement

We consider the classic problem of pole placement by state feedback. We offer an eigenstructure assignment algorithm to obtain a novel parametric form for the pole-placing feedback matrix that can deliver any set of desired closed-loop eigenvalues, with any desired multiplicities. This parametric formula is then exploited to introduce an unconstrained nonlinear optimisation algorithm to obtain a feedback matrix that delivers the desired pole placement with optimal robustness and minimum gain. Lastly we compare the performance of our method against several others from the recent literature.

2014-05-07math.OC

多体空间望远镜建模与姿态控制的系统化方法

A Systematic Methodology for Modeling and Attitude Control of Multi-body Space Telescopes

本文提出一种基于 Kane 方法和符号线性化的多体空间望远镜建模方法，并比较 LQR 与鲁棒极点配置控制性能，表明后者在执行器使用和指向精度上更优。

2024-04-15math.OC

Data-Driven Exact Pole Placement for Linear Systems

The exact pole placement problem concerns computing a feedback gain that will assign the poles of a system, controlled via static state feedback, at a set of pre-specified locations. This is a classic problem in feedback control and numerous methodologies have been proposed in the literature for cases where a model of the system to control is available. In this paper, we study the problem of computing feedback gains for pole placement (and, more generally, eigenstructure assignment) directly from experimental data. Interestingly, we show that the closed-loop poles can be placed exactly at arbi…

2023-03-20cs.SYeess.SYmath.OC

Cluster Assignment in Multi-Agent Systems : Sparsity Bounds and Fault Tolerance

We study cluster assignment in homogeneous diffusive multi-agent networks. Given the number of clusters and agents within each cluster, we design the network graph ensuring the system will converge to the prescribed cluster configuration. Using recent results linking clustering and symmetries, we show that it is possible to design an oriented graph for which the action of the automorphism group of the graph has orbits of predetermined sizes, guaranteeing the network will converge to the prescribed cluster configuration. We provide bounds on the number of edges needed to construct these graphs …

2022-11-02cs.DMcs.DScs.SY

Minimum-gain Pole Placement with Sparse Static Feedback

The minimum-gain eigenvalue assignment/pole placement problem (MGEAP) is a classical problem in LTI systems with static state feedback. In this paper, we study the MGEAP when the state feedback has arbitrary sparsity constraints. We formulate the sparse MGEAP problem as an equality-constrained optimization problem and present an analytical characterization of its locally optimal solution in terms of eigenvector matrices of the closed loop system. This result is used to provide a geometric interpretation of the solution of the non-sparse MGEAP, thereby providing additional insights for this cla…

2020-08-14cs.SYeess.SYmath.OC