Parameterisation of Degenerate Solutions of the Determinantal Assignment Problem
نویسندگان
چکیده
The paper is concerned with defining and parametrising the families of all degenerate compensators (feedback, squaring down etc) in a variety of linear control problems. Such compensators indicate the boundaries of the control design, but they also provide the means for linearising the nonlinear nature of the Determinantal Assignment Problems, which provide the unifying description for all frequency assignment problems (pole, zero) under static and dynamic compensation schemes.
منابع مشابه
System Degeneracy and the Output Feedback Problem: Parametrisation of the Family of Degenerate Compensators
This paper develops in depth the concept of degeneracy associated with the standard output feedback configuration of a proper multivariable system. The motivation stems from the very important property that degenerate feedback gains may be used for the linearisation of the pole assignment map and hence for frequency assignment. In general, the objective is the characterisation and parametrisati...
متن کاملApproximate Solutions of the Determinantal Assignment Problem and Distance Problems
The paper introduces the formulation of an exact algebrogeometric problem, the study of the Determinantal Assignment Problem (DAP) in the set up of design, where approximate solutions of the algebraic problem are sought. Integral part of the solution of the Approximate DAP is the computation of distance of a multivector from the Grassmann variety of a projective space. We examine the special ca...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملThe Approximate Determinantal Assignment Problem
The Determinantal Assignment Problem (DAP) has been introduced as the unifying description of all frequency assignment problems in linear systems and it is studied in a projective space setting. This is a multi-linear nature problem and its solution is equivalent to finding real intersections between a linear space, associated with the polynomials to be assigned, and the Grassmann variety of th...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کامل