Minimum Cost Feedback Selection for Arbitrary Pole Placement in Structured Systems
From MaRDI portal
Publication:4559533
Abstract: This paper addresses optimal feedback selection for generic arbitrary pole placement of structured systems when each feedback edge is associated with a cost. Given a structured system and a feedback cost matrix, our aim is to find a feasible feedback matrix of minimum cost that guarantees arbitrary pole placement of the closed-loop structured system. We first give a polynomial time reduction of the weighted set cover problem to an instance of the feedback selection problem and thereby show that the problem is NP-hard. Then we prove the inapproximability of the problem by showing that constant factor approximation for the problem does not exist unless the set cover problem can be approximated within a constant factor. Since the problem is hard, we study a subclass of systems whose directed acyclic graph constructed using the strongly connected components of the state digraph is a line graph and the state bipartite graph has a perfect matching. We propose a polynomial time optimal algorithm based on dynamic programming for solving the problem on this class of systems. Further, over the same class of systems we relax the perfect matching assumption, and provide a polynomial time 2-optimal solution based on dynamic programming and a minimum cost perfect matching algorithm.
Cited in
(5)- Approximating constrained minimum cost input-output selection for generic arbitrary pole placement in structured systems
- An overview of structural systems theory
- Feedback robustness in structured closed-loop system
- Structurally quotient fixed modes
- Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors
This page was built for publication: Minimum Cost Feedback Selection for Arbitrary Pole Placement in Structured Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559533)
