Complexity of input output selection

A.G. Jager, de, O. Toker

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Input output selection is the procedure of choosing a set of inputs (actuators) and outputs (sensors) for a plant from a larger set. The goal is to be able to design a controller that fulfills the specifications for the closed loop. The input output selection problem is shown to fall in the class of problems that are $\cal N\cal P$-hard. However, an algorithm is presented that solves the problem efficiently, under the conditions that (1) the selection criterion satisfies some assumptions, (2) computing the criterion is an involved task, and (3) the number of items to choose from is not too large. The time needed is of the order of the product of the number of items to choose from, the size of the complete solution, and the time spend to evaluate the selection criterion for a single set. An engineering application shows the algorithm to be able to compute a solution in an acceptable time, so it has practical relevance.
Original languageEnglish
Title of host publicationProc. Internat. Symp. on the Mathematical Theory of Networks and Systems (MTNS 98)
EditorsA Beghi, L Finesso, G Picci
Place of PublicationPadova, Italy
PublisherIl Poligrafo
PagesFE8-FE8
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'Complexity of input output selection'. Together they form a unique fingerprint.

Cite this