نتایج جستجو برای: pole assignment
تعداد نتایج: 64701 فیلتر نتایج به سال:
This paper deals with a pole assignment problem by single-input state feedback control arising from a one-dimensional vibrating system with aerodynamic effect. On the practical side, we derive explicit formulae for the required controlling force terms, which can reassign part of the spectrum to the desired values while leaving the remaining spectrum unchanged. On the mathematical side, unlike t...
The eigenstructure assignment scheme for robust multivariable state feedback control is extended to redundantly actuated dynamical systems. The fact that the plants that are atleast square allow for the exact assignment of an arbitrary orthonormal set of closed loop eigenvectors makes this methodology attractive for feedback controller design poorly modeled dynamical systems. For second order m...
The partial pole assignment (PPA) problem is the one of reassigning a few unwanted eigenvalues of a control system by feedback to suitably chosen ones, while keeping the remaining large number of eigenvalues unchanged. The problem naturally arises in modifying dynamical behaviour of the system. The PPA has been considered by several authors in the past for standard state–space systems and for q...
This paper presents the application of symbolic algebra techniques to the MATHEMATICA implementation of a set of output-feedback pole assignment algorithms, for systems characterised by parametric uncertainty. For multivariable systems there may be more than one feedback matrix solutions leading to the same closed-loop poles based on the same algorithm used. Thus overparameterised solutions are...
A new numerically reliable algorithm is proposed for the pole assignment of single input linear time invariant sy stems The proposed algorithm is based on an implicit multishift QR like technique using exclusively orthogo nal transformations to compute a feedback matrix which assigns the desired poles The new algorithm allows for a dynamic adjustment of the number of shifts This feature is part...
In many classifier systems, the classifier strength parameter serves as a predictor of future payoff and as the classifier’s fitness for the genetic algorithm. We investigate a classifier system, XCS, in which each classifier maintains a prediction of expected payoff, but the classifier’s fitness is given by a measure of the prediction’s accuracy. The system executes the genetic algorithm in ni...
Some elementary optimization techniques, together with some not so well-known robustness measures and condition numbers, will be utilized in pole assignment. In particular, “Method 0” by Kautsky et al. (1985) for optimal selection of vectors is shown to be convergent to a local minimum, with respect to the condition number 1 2 ‖X‖2F − ln | detX|. This contrasts with the misconception by Kautsky...
1 IRCCyN, École des Mines de Nantes, 4 rue Alfred Kastler, 44307 Nantes, France. [email protected] 2 Institute of Mathematics, University of Szczecin, 70451 Szczecin, Wielkopolska 15, Poland. [email protected] 3 Department of Mechanics and Mathematics, Kharkov University, 4 Svobody sqr., Kharkov, 61077, Ukraine. [email protected] J. J. Loiseau, W. Michiels, S.-I. Niculescu, R. Sipahi...
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 coefficient space of closed-loop characteristic polynomials. A constructive procedure for generating stable simplexes is given starting from the unit hypercube of reflection coefficients of monic polynomials. This procedu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید