Decentralized Control via Gröbner Bases and Variable Elimination

نویسندگان

  • Hyung Sik Shin
  • Sanjay Lall
چکیده

We consider the problem of optimal decentralized controller synthesis. There are several classes of such problems for which effective solution methods are known, including the quadratically invariant one. In this paper, we use Gröbner bases and elimination theory to characterize all closed-loop maps achievable by forming a feedback loop with decentralized controllers. We show that this approach allows solution of a wide class of optimal decentralized control problems; it includes not only quadratically invariant problems under a technical condition but also some other problems which are not quadratically invariant.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Gröbner Basis Approach to CNF-Formulae Preprocessing

This paper presents a CNF SAT-formulae transformation technique employing Gröbner bases as a means to analyze the problem structure. Gröbnerbases have been applied in the past for SAT; however, their use was primarily restricted to analyzing entire problems for proof-refutation. In contrast, this technique analyzes limited subsets of problems, and uses the derived Gröbner bases to yield new con...

متن کامل

Non-Commutative Gröbner Bases in Poincaré-Birkhoff-Witt Extensions

Commutative Gröbner Bases are a well established technique with many applications, including polynomial solving and constructive approaches to commutative algebra and algebraic geometry. Noncommutative Gröbner Bases are a focus of much recent research activity. For example, combining invariant theory and elimination theory, or elimination in moving frames of partial differential operators invar...

متن کامل

On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases

Resultants and Gröbner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study — by means of elementary tools — the difference between the multiplicity of the factors of ...

متن کامل

IFS Coding of Non-Homogeneous Fractal Images Using Gröbner Basis Techniques

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of nonhomogeneous fractal images with unequal probabilities. Moment based encoding algorithms for IFS coding of non-homogeneous fractal images require a solution of simultaneous algebraic equations that are difficult to handle with numerical root-finding methods. The proposed algorithm employs a vari...

متن کامل

On Computing Gröbner Bases in Rings of Differential Operators with Coefficients in a Ring

Following the definition of Gröbner bases in rings of differential operators given by Insa and Pauer(1998), we discuss some computational properties of Gröbner bases arising when the coefficient set is a ring. First we give examples to show that the generalization of S-polynomials is necessary for computation of Gröbner bases. Then we prove that under certain conditions the G-S-polynomials can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2012