zbMATH — the first resource for mathematics

Compensation of unknown sinusoidal disturbances in linear plants of arbitrary relative degree. (English. Russian original) Zbl 1163.93361
Autom. Remote Control 70, No. 3, 449-456 (2009); translation from Avtom. Telemekh. 2009, No. 3, 114-122 (2009).
Summary: A new algorithm is proposed for compensating parametrically uncertain harmonic disturbances. In contrast to the known results, the compensation is carried out in the situation where only the output variable and the control signal are measured, and the relative degree of the plant is arbitrary.

93C73 Perturbations in control/observation systems
93C15 Control/observation systems governed by ordinary differential equations
93C05 Linear systems in control theory
93B40 Computational methods in systems theory (MSC2010)
Full Text: DOI
[1] Marino, R., Santosuosso, G.L., and Tomei, P., Robust Adaptive Compensation of Biased Sinusoidal Disturbances with Unknown Frequency, Automatica, 2003, vol. 39, pp. 1755–1761. · Zbl 1054.93031 · doi:10.1016/S0005-1098(03)00170-5
[2] Bobtsov, A. and Kremlev, A., Adaptive Compensation of Biased Sinusoidal Disturbances with Unknown Frequency, Proc. 16th IFAC World Congr., Prague, 2005. · Zbl 1126.93426
[3] Bobtsov, A.A., Output Control Algorithm with Compensation of Biased Harmonic Disturbances, Avtom. Telemekh., 2008, no. 8, pp. 25–32. · Zbl 1156.93027
[4] Pervozvanskii, A.A., Kurs teorii avtomaticheskogo upravleniya (A Course on Automatic Control Theory), Moscow: Fizmatlit, 1986.
[5] Aranovskii, S.V., Bobtsov, A.A., Kremlev, A.S., and Lukyanova, G.V., Robust Algorithm for Identification of Frequency of Sinusoidal Signals, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2007, no. 3, pp. 1–6. · Zbl 1301.94014
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.