We propose an algorithm, based on symbolic computation packages, for testing observability conditions of general polynomial systems, which were formulated in Sontag, SIAM J. Control Optim. 17 (1979) 139 -151. Computational complexity of the observability test can be reduced and the test simpliÿed fo
Controllability for a class of simple Wiener–Hammerstein systems
✍ Scribed by Dragan Nešić
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 129 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
✦ Synopsis
Controllability for a class of simple Wiener-Hammerstein systems is considered. Necessary and su cient conditions for dead-beat and complete controllability for these systems are presented. The controllability tests consist of two easy-to-check tests for the subsystems.
📜 SIMILAR VOLUMES
Necessary and sufficient conditions for dead-beat and complete controllability for a class of generalised Hammerstein systems are presented. Since the system's structure is very close to linear, only linear algebra is used for the controllability test. The test is very simple and easy to use. A clos
A new robust state-feedback controller is designed to solve the tracking problem of a class of nonlinear uncertain systems. The contributions of our paper are threefold: Firstly, a new robust state-feedback controller with a simple structure is derived. Owing to its simplicity, less computation is n
Many dynamic systems in physics, chemistry, biology, engineering, and information science have impulsive dynamical behaviors due to abrupt jumps at certain instants during the dynamical processes. These complex dynamic behaviors can be modeled by impulsive di erential systems. This paper studies the