Modern missiles must deal with stringent performance requirements and ensure robustness across a wide range of operating conditions during flight time. Classic gain-scheduling designs have been successful in practice, but do not provide theoretically ensured bounds on both robustness. Controllers are interpolated at intermediate switching them may cause instability. On the other hand, polytopic...

This paper develops a simple algorithm for having robust optimal computer control in decentralized stochastic singularly-perturbed systems by poles assignment. This type of noise-disturbed system can be often seen in computer controlled large-scale systems such as electric power systems, communication networks, and aerospace systems. Due to that this computer controlled system possesses the fas...

We explore the use of learning schemes in training and adapting performance on simple coordination tasks. The tasks are 1-D pole balancing. Several programs incorporating learning have already achieved this (1, S, 8]: the problem is to move a cart along a short piece of track to at to keep a pole balanced on its end; the pole is hinged to the cart at its bottom, and the cart is moved either to ...

The paper deals with the problem of zero assignment in RLC networks by selection of appropriate values for the nondynamical elements, the resistors. For a certain family of network redesign problems by the additive perturbations may be described as diagonal perturbations and such modifications are considered here. This problem belongs to the family of DAP problems (Determinantal Assignment Prob...

Abstract. Analogous to the pole assignment problem where eigenvalues of a square matrix are relocated, this paper considers the problem of reassigning singular values of a rectangular matrix by additive low rank matrices. Precise and easy-to-check necessary and sufficient conditions under which the problem is solvable are completely characterized, generalizing some traditional singular value in...

Numerically reliable computational methods are proposed for the stabilization of a linear descriptor system with or without simultaneous elimination of its impulsive behavior. Two basic stabilization approaches are discussed. The rst approach relies on methods which represent generalizations of direct stabilization techniques for standard state-space systems. The second approach is based on a r...

A new algorithm is proposed for the pole assignment of single-input linear time-invariant systems. The proposed algorithm belongs to the family of Hessenberg methods and is based on an implicit multishift QR-like technique. The new method compares favorably in many respects (speed, memory usage) with existing numerically stable methods. Its improved vectorizability guarantees good opportunities...

In this brief note it is shown that the linear matrix inequalities that result from the application of interconnection and damping assignment passivity–based control to general linear time–invariant systems are feasible if and only if the system is stabilizable. A very simple proof of this fact is given that, in contrast to previous results, does not require the assumption that the system has n...