PROJECT TITLE :

Synthesis of Sparse Dynamic Structures via Semidefinite Programming

ABSTRACT:

This temporary presents a scientific approach for the look of sparse dynamic output feedback control structures. A supplementary complexity cost function term is employed to market sparsity within the structure while optimizing an performance cost simultaneously. Optimization problems in which a combinatorial sparsity live is combined with a nonlinear performance value function are NP-hard. NP-exhausting problems don't have tractable solutions, requiring either a numerical solution or a relaxation into a solvable kind. Relaxations will introduce conservatism, however at the identical time retain stability and performance guarantees. During this brief, a replacement relaxation methodology is proposed, which permits the matter to be formulated as a convex semidefinite program. This is created possible via use of a new state-area kind that establishes an instantaneous relationship between the state-space and therefore the resulting transfer operate matrix parameters.