Some results on the genericity of the pole placement problem

In this note, the pole placement problem for a linear MIMO systems with p outputs and m inputs is studied from the algebraic point of view. A formulation is proposed, that allows to analyze both theoretical and numerical aspects of the case min(m,p)=2 with more sharpness. Moreover, here it is shown that arbitrary pole placement by static output feedback of unitary rank is generically not possible even if m+p>n holds true.     

An efficient model predictive controller with pole placement

For model predictive control (MPC) of constrained systems, enlarging the feasible region is usually in conflict with improving the dynamic performance. To resolve the conflict, we proposed an efficient model predictive controller with pole placement for a class of discrete-time linear systems. By specifying a group of circular regions that contain the desired closed-loop poles, appropriate terminal weighting matrices and local controllers are calculated to construct a time-varying terminal convex set, which is a significant constraint for the online optimization problem. During the online optimization, the size of the terminal convex set can adjust itself according to the actual state at each sampling time. In this way, a large initial feasible region can be achieved while maintaining the good dynamic performance. An illustrative example is used to show the effectiveness of the proposed approach.     

Dominant pole placement for multi-loop control systems

This paper proposes a method for multi-loop PI controller design which can achieve dominant pole placement for two input two output processes. It is an extension of the original dominant pole design (PID Controllers: Theory, Design, and Tuning, Instrument Society of America, Research Triangle park, NC, 1995.) for SISO systems. Unlike its SISO counterpart, where the controller parameters can be obtained analytically, the multi-loop version amounts to solving some coupled nonlinear equation with complex coefficients, for which closed-form formulae are not possible. A novel approach is developed to solve the equation using a “root trajectory” method, in which the solution to our pole placement problem is found from intersection points between the “root trajectories” and the positive real axis. The design procedure is given and simulation examples are provided to show the effectiveness of the proposed method and comparisons are made with the BLT method.     

Almost disturbance decoupling and pole placement

We revisit here the Almost Disturbance Decoupling Problem (ADDP) (Willems, 1981) by state feedback with the objective to solve ADDP and simultaneously place the maximal number of poles in the closed-loop solution. Indeed, when ADDP is solvable, we show that, whatever be the choice of a particular feedback solution, the obtained closed-loop system always has a set of fixed poles. We characterize these Fixed Poles of ADDP. The other (non-fixed) poles can be placed freely, and we characterize the “optimal” solutions (in terms of ad hoc subspaces and feedbacks) which allow us to solve ADDP with maximal pole placement. From our contribution, which treats the most general case for studying ADDP with maximal, usually partial, pole placement, directly follow the solutions of ADDP with complete pole placement (when there are no ADDP Fixed Poles) and ADDP with internal stability (when all the Fixed Poles of ADDP are stable), without requiring the use of stabilizability subspaces, as in Willems (1981). We extend the concept of Self-Bounded Controlled-Invariant Subspaces (Basile & Marro, 1992) to almost ones. An example is proposed that illustrates our contributions.     

Direct pole placement adaptive tracking of non-minimum phase systems

In this paper, we propose a direct pole placement adaptive tracking scheme for non-minimum-phase, open-loop stable, linear plants with time delays. This controller utilizes the internal model principle to eliminate steady-state tracking error for signals with known distinct frequencies. The controller order depends only on the number of frequencies in the reference input, but not on the order of the plant. It is shown that with sufficiently small loop gain, the controller can guarantee stable closed loop, and asymptotic tracking.     

Robust H∞ control for uncertain discrete singular systems with pole placement in a disk

This paper addresses the design of robust H_∞ controllers for uncertain discrete singular systems with time-invariant uncertainty in both the state and measurement matrices. The singular system to be controlled is not assumed to be regular. A regular dynamic output feedback controller is designed such that a prescribed H_∞ performance condition is satisfied and the closed-loop poles are placed in a specified disk while the regularity, causality and stability of the closed-loop system can be guaranteed for all admissible uncertainties. The desired controller can be obtained by solving a set of matrix inequalities. A numerical example is given to demonstrate the application of the proposed method.     

A necessary condition for pole assignment by constant output feedback

In this paper we shall investigate the pole assignment problem by constant output feedback using transfer function techniques. In particular, a necessary condition is given for the existence of constant output feedback which assigns the eigenvalues of closed-loop system to any desired positions.     

Singular PDEs and the single-step formulation of feedback linearization with pole placement

The present work proposes a new formulation and approach to the problem of feedback linearization with pole placement. The problem under consideration is not treated within the context of geometric exact feedback linearization, where restrictive conditions arise from a two-step design method (transformation of the original nonlinear system into a linear one in controllable canonical form with an external reference input, and the subsequent employment of linear pole-placement techniques). In the present work, the problem is formulated in a single step, using tools from singular PDE theory. In particular, the mathematical formulation of the problem is realized via a system of first-order quasi-linear singular PDEs and a rather general set of necessary and sufficient conditions for solvability is derived, by using Lyapunov's auxiliary theorem. The solution to the system of singular PDEs is locally analytic and this enables the development of a series solution method, that is easily programmable with the aid of a symbolic software package. Under a simultaneous implementation of a nonlinear coordinate transformation and a nonlinear state feedback law computed through the solution of the system of singular PDEs, both feedback linearization and pole-placement design objectives may be accomplished in a single step, effectively overcoming the restrictions of the other approaches by bypassing the intermediate step of transforming the original system into a linear controllable one with an external reference input.     

Output feedback pole placement for linear time-varying systems with application to the control of nonlinear systems

The output feedback pole placement problem is solved in an input-output algebraic formalism for linear time-varying (LTV) systems. The recent extensions of the notions of transfer matrices and poles of the system to the case of LTV systems are exploited here to provide constructive solutions based, as in the linear time-invariant (LTI) case, on the solutions of diophantine equations. Also, differences with the results known in the LTI case are pointed out, especially concerning the possibilities to assign specific dynamics to the closed-loop system and the conditions for tracking and disturbance rejection. This approach is applied to the control of nonlinear systems by linearization around a given trajectory. Several examples are treated in detail to show the computation and implementation issues.     

Generalized pole placement via static output feedback: A methodology based on projections

This paper presents an algorithm for solving static output feedback pole placement problems of the following rather general form: given n subsets of the complex plane, find a static output feedback that places in each of these subsets a pole of the closed-loop system. The algorithm presented is iterative in nature and is based on alternating projection ideas. Each iteration of the algorithm involves a Schur matrix decomposition, a standard least-squares problem and a combinatorial least-squares problem. While the algorithm is not guaranteed to always find a solution, computational results are presented demonstrating the effectiveness of the algorithm.     

A new approach for instantaneous pole placement with recurrent neural networks and its application in control of nonlinear time-varying systems

In this paper, we first show that online computation of feedback gain used for pole placement of nonlinear systems in recent years is not reliable, and then we present a new approach for instantaneous pole placement and apply it with dynamical recurrent neural networks for online computation of feedback gain. Because of high-speed convergence of neural network to feedback gain, we can apply this method for pole placement of nonlinear time-varying systems. One strategy for realization of this method is instantaneous linearization, as we do here by simulation. The advantage of the proposed method is a global uniform asymptotical exponential stability (GUAES) of closed-loop system around the equilibrium point.     

Sufficient conditions for arbitrary pole assignment by constant decentralized output feedback

This paper examines the problem of arbitrary pole assignment by decentralized output feedback. New sufficient conditions for the existence of real solutions are derived in terms of the heights of the first Whitney classes corresponding to the channel pairs ofm _i outputs, p_i inputs, and some appropriate partitioning of the number of states. These results extend the odd intersection framework approach based on the heights to the decentralized case and provide sufficient conditions for cases not covered by previous results.This research has been supported by EPSRC Grant GR/H 20466, U.K.     

On a generalized predictive control algorithm

Generalized predictive control algorithms with reference models on imputs and outputs of the process have been proposed recently in the literature. Thise algorithms are extended by introducing suitable weighting factors in the performance index and it is shown that such algorithms provide a combined feedback feedforward control resulting in pole-zero cancellation of poles which do not correspond to the reference model. Hence, the system behaves asymptotically as the reference model provided the cancelled poles are stable. Therefore, a careful analysis of the stability of those poles in still needed.     

Continuous pole placement for delay equations

In this paper, we describe a stabilization method for linear time-delay systems which extends the classical pole placement method for ordinary differential equations. Unlike methods based on finite spectrum assignment, our method does not render the closed loop system, finite dimensional but consists of controlling the rightmost eigenvalues. Because these are moved to the left half plane in a (quasi-)continuous way, we refer to our method as continuous pole placement. We explain the method by means of the stabilization of a linear finite dimensional system in the presence of an input delay and illustrate its applicability to more general stabilization problems.     

Robust pole assignment via reflection coefficients of polynomials

A robust version of the output controller design for discrete-time systems is introduced. Instead of a single stable point a stable polytope (or simplex) is preselected in the closed-loop characteristic polynomial coefficients space. A constructive procedure for generating stable polytopes is given starting from the unit hypercube of reflection coefficients of monic polynomials. This procedure is quite straightforward because for a special family of polynomials the linear cover of so-called reflection vectors is stable. The roots placement of reflection vectors is studied. If a stable target simplex is preselected then the robust output controller design task is solved by quadratic programming approach.     

Feedback norm minimisation with regional pole placement

This article proposes a convex algorithm for minimising an upper bound of the state feedback gain matrix norm with regional pole placement for linear time-invariant multi-input systems. The inherent non-convexity in this optimisation is resolved by a combination of two separate approaches: (1) an inner convex approximation of the polynomial matrix stability region due to Henrion and (2) a novel convex parameterisation of column reduced matrix fraction system representations. Using a sequence of approximations enabled by the above two methods, it is shown that the constraints on closed-loop poles (both pre-specified exact locations and regional placement) define linear matrix inequalities. Finally, the effectiveness of the proposed algorithm is compared with similar pole placement algorithms through numerical examples.     

Virus coevolution partheno-genetic algorithms for optimal sensor placement

A virus coevolutionary partheno-genetic algorithm (VEPGA), which combined a partheno-genetic algorithm (PGA) with virus evolutionary theory, is proposed to place sensors optimally on a large space structure for the purpose of modal identification. The VEPGA is composed of a host population of candidate solutions and a virus population of substrings of host individuals. The traditional crossover and mutation operators in genetic algorithm are repealed and their functions are implemented by particular partheno-genetic operators which are suitable to combinatorial optimization problems. Three different optimal sensor placement performance index, one aim on the maximization of linear independence, one aim on the maximization of modal energy and the last is a combination of the front two indices, have been investigated. The algorithm is applied to two examples: sensor placement for a portal frame and a concrete arc dam. Results show that the proposed VEPGA outperforms the sequential reduction procedure (SRP) and PGA. The combined performance index makes an excellent compromise between the linear independence aimed index and the modal energy aimed index.     

Parameter-insensitive pole assignment

A problem of parameter-insensitive pole assignment for a kind of finite-dimensional linear time-invariant (FDLTI) system is considered. Conditions for the existence of some parameter-insensitive poles are obtained. Further, an approach for constructing the feedback law is suggested.     

Linear quadratic regulators with eigenvalue placement in a specified region

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at ±π/2k (k = 2 or 3) from the negative real axis with a sector angle ≤π/2, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane. Also, a shifted sector method is presented to optimally place the closed-loop poles of a system in any general sector having a sector angle between π/2 and π. The optimal pole placement is achieved without explicitly utilizing the eigenvalues of the open-loop system. The design method is mainly based on the solution of a linear matrix Lyapunov equation and the resultant closed-loop system with its eigenvalues in the desired region is optimal with respect to a quadratic performance index.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.